Symbolic Reachability for Process Algebras with Recursive Data Types-Reference-Cited by-同舟云学术

Symbolic Reachability for Process Algebras with Recursive Data Types

Published:2008 Issue: Volume: Page:81-95
ISSN:0302-9743
Container-title:Theoretical Aspects of Computing - ICTAC 2008
language:
Short-container-title:

Author:

Blom Stefan,van de Pol Jaco

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-85762-4_6

Reference24 articles.

1. Lecture Notes in Computer Science;H. Garavel,2007

2. Lecture Notes in Computer Science;J.C. Fernandez,1996

3. Roscoe, B.: The theory and practice of concurrency. Prentice-Hall, Englewood Cliffs (amended, 1998) (2005)

4. Lecture Notes in Computer Science;S. Blom,2001

5. Ciardo, G., Miner, A.S.: SMART: The Stochastic Model checking Analyzer for Reliability and Timing. In: QEST, pp. 338–339. IEEE Computer Society, Los Alamitos (2004)

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Decision Diagram Operation for Reachability;Formal Methods;2023

2. Simplifying Process Parameters by Unfolding Algebraic Data Types;Theoretical Aspects of Computing – ICTAC 2023;2023

3. Hybrid Parallel Model Checking of Hybrid LTL on Hybrid State Space Representation;Lecture Notes in Computer Science;2022

4. Recursive Variable-Length State Compression for Multi-core Software Model Checking;Lecture Notes in Computer Science;2021

5. Reducing Time and/or Memory Consumption of the SOG Construction in a Parallel Context;2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom);2018-12