Set-based analysis of reactive infinite-state systems-Reference-Cited by-同舟云学术

Set-based analysis of reactive infinite-state systems

Published:1998 Issue: Volume: Page:358-375
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Charatonik Witold,Podelski Andreas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0054183

Reference29 articles.

1. O. Bernholtz, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In Computer Aided Verification, Proc. 6th Int. Workshop, volume 818 of LNCS, pages 142–155, Stanford, California, June 1994. Springer-Verlag. Full version available from authors.

2. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR'97. LNCS 1243, 1997.

3. A. Bouajjani and O. Maler. Reachability Analysis of Pushdown Automata. In Infinity'96. tech. rep. MIP-9614, Univ. Passau, 1996.

4. F. Bourdoncle. Abstact debugging of higher-order imperative languages. In Proceedings of the SIGPLAN'93 Conference on Programming Language Design and Implementation (PLDI'93), LNCS, pages 46–55. ACM Press, 1993.

5. O. Burkart and B. Steffen. Composition, Decomposition and Model-Checking of Pushdown Processes. Nordic Journal of Computing, 2, 1995.

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

1. Alternating two-way AC-tree automata;Information and Computation;2007-06

2. Deductive Multi-valued Model Checking;Logic Programming;2005

3. Techniques for Scaling Up Analyses Based on Pre-interpretations;Logic Programming;2005

4. On temporal logic versus datalog;Theoretical Computer Science;2003-06

5. Set Constraints with Intersection;Information and Computation;2002-12