On-the-fly reachability and cycle detection for recursive state machines

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 61-76

  Alur, Rajeev ^a   Chaudhuri, Swarat ^a   Etessami, Kousha ^b   Madhusudan, P ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; BOOLEAN ALGEBRA; STATE SPACE METHODS;

BOOLEAN PROGRAMS; FINITE STATE SYSTEMS; MODEL CHECKING; RECURSIVE STATE MACHINES;

FINITE AUTOMATA;

EID: 24644501837     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_5     Document Type: Conference Paper

References (20)

1. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. Computer-Aided Verification, LNCS 2102: 207-220, 2001.
2. T. Andrews, S. Qadeer, S.K. Rajamani, J. Rehof, and Y. Xie. Zing: A model checker for concurrent software. In Proc. CAV'04, LNCS 3114: 484-487, 2004.
3. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN Workshop on Model Checking of Software, LNCS 1885: 113-130, 2000.
4. T. Ball and S. Rajamani. The SLAM toolkit. In Proc. CAV'01, LNCS 2102, 2001.
5. M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. In Proc. ICALP '01, LNCS 2076: 652-666, 2001.
6. A. Boujjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Applications to model checking. In CONCUR'97, LNCS 1243, 1997.
7. O. Burkart and B. Steffen. Model checking the full modal mu-calculus for infinite sequential processes. Theoretical Computer Science, 221:251-270, 1999.
8. J.C. Corbett, M.B. Dwyer, J. Hatcliff, S. Laubach, C.S. Pasareanu, Robby, and H. Zheng. Bandera: Extracting finite-state models from Java source code. In Proc. of Intl. Conf. on Software Engg., pages 439-448. 2000.
9. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
10. D.L. Dill, A.J. Drexler, A.J. Hu, and C.H. Yang. Protocol verification as a hardware design aid. In IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 522-525, 1992.
11. D. Engler, B. Chelf, A. Chou, and S. Hallem. Checking system rules using systemspecific, programmer-written compiler extensions. In Proc. 4th USENIX OSDI, pages 1-16, 2000.
12. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Computer Aided Verification, 12th International Conference, LNCS 1855, pages 232-247. Springer, 2000.
13. J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. Lecture Notes in Computer Science, 2102:324+, 2001.
14. M. Fähndrich, J.S. Foster, Z. Su, and A. Aiken. Partial online cycle elimination in inclusion constraint graphs. Proc. PLDI '98, pages 85-96, 1998.
15. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. In Proc. Workshop on Verification of Infinite State Systems, volume 9 of Electronic Notes in Theor. Comp. Sci. Elsevier, 1997.
16. H. Gabow. Path-based depth-first search for strong and biconnected components. Inf. Process. Lett., 74(3-4):107-114, 2000.
17. T.A. Henzinger, R. Jhala, R. Majumdar, G.C. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. In CAV 02: Proc. of 14th Conf. on Computer Aided Verification, LNCS 2404, pages 526-538, 2002.
18. G.J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
19. D.J. Pearce, P.H.J. Kelly, and C. Hankin. Online cycle detection and difference propagation for pointer analysis. Software Quality Journal, 12(4):311-337, 2004.
20. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. POPL '95, pages 49-61, 1995.