Compositional proof systems for model checking infinite state processes-Reference-Cited by-同舟云学术

Compositional proof systems for model checking infinite state processes

Published:1995 Issue: Volume: Page:12-26
ISSN:0302-9743
Container-title:CONCUR '95: Concurrency Theory
language:
Short-container-title:

Author:

Dam Mads

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60218-6_2.pdf

Reference14 articles.

1. R. Amadio and M. Dam. Reasoning about higher-order processes. SICS Research report RR:94-18, 1994. To appear in Proc. CAAP'95.

2. H. Andersen, C. Stirling, and G. Winskel. A compositional proof system for the modal μ-calculus. In Proc. LICS'94, 1994.

3. J. Bradfield and C. Stirling. Local model checking for infinite state spaces. Theoretical Computer Science, 96:157–174, 1992.

4. R. Cleaveland, M. Dreimüller, and B. Steffen. Faster model checking for the modal mu-calculus. In Proc. CAV'92, Lecture Notes in Computer Science, 663:383–394, 1992.

5. M. Dam. Model checking mobile processes (full version). SICS report RR 94:1, 1994. Prel. version appeared in Proc. Concur'93, LNCS 715, pp. 22–36.

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

1. A general account of coinduction up-to;Acta Informatica;2016-06-25

2. Using heuristic search for finding deadlocks in concurrent systems;Information and Computation;2005-11

3. Sequent calculi for process verification: Hennessy–Milner logic for an arbitrary GSOS;The Journal of Logic and Algebraic Programming;2004-07

4. Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes;Lecture Notes in Computer Science;2002

5. Compositional Reasoning in Model Checking;Compositionality: The Significant Difference;1998