Analysis of recursive state machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2102, Issue , 2001, Pages 207-220

  Alur, Rajeev ^a,b   Etessami, Kousha ^a   Yannakakis, Mihalis ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

ALGORITHMIC ANALYSIS; HIERARCHICAL STATE MACHINES; IMPERATIVE PROGRAMS; PUSHDOWN SYSTEMS; RECURSIVE PROCEDURE; RECURSIVE STATE MACHINES; STATE-SPACE ANALYSIS; VISUAL NOTATIONS;

MODEL CHECKING;

EID: 84958771695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_18     Document Type: Conference Paper

References (15)

1. R. Alur and M. Yannakakis. Model checking of hierarchical state machines. In Proc. 6th ACM Symp. on Found. of Software Engineering, pages 175-188, 1998.
2. H. Andersen. Model checking and boolean graphs. TCS, 126(1):3-30, 1994.
3. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN'2000, volume 1885 of LNCS, pages 113-130, 2000.
4. M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. To appear in ICALP'2001.
5. G. Booch, I. Jacobson, and J. Rumbaugh. The Unified Modeling Language User Guide. Addison Wesley, 1997.
6. A. Boujjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Applications to model checking. In CONCUR'97, pages 135-150, 1997.
7. O. Burkart and B. Sten. Model checking the full modal mu-calculus for infinite sequential processes. Theoretical Computer Science, 221:251-270, 1999.
8. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Computer Aided Verification, 12th Int. Conference, volume 1855 of LNCS, pages 232-247. Springer, 2000.
9. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. In Infinity'97 Workshop, volume 9 of Electronic Notes in Theoretical Computer Science, 1997.
10. D. Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming, 8:231-274, 1987.
11. T. Reps. Program analysis via graph reachability. Information and Software Technology, 40(11):701-726, 1998.
12. T. Reps, S. Horwitz, and S. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL, pages 49-61, 1995.
13. J. D. Ullman. Principles of Database and Knowledge-base systems. Computer Science Press, 1988.
14. L. G. Valiant. General context-free recognition in less than cubic time. J. of Computer and System Sc., 10:308-315, 1975.
15. M. Yannakakis. Graph-theoretic methods in database theory. In Proc. 9th ACM Symp. on Principles of Database Systems, pages 230-242, 1990.