Model checking as constraint solving

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

Volumn 1824 LNCS, Issue , 2000, Pages 22-37

  Podelski, Andreas ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); LOGIC PROGRAMMING; STATIC ANALYSIS;

CONSTRAINT SOLVING; INFERENCE RULES; INFINITE STATE SYSTEMS; SYMBOLIC DATA; TEMPORAL PROPERTY;

MODEL CHECKING;

EID: 84906094867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45099-3_2     Document Type: Conference Paper

References (28)

1. O. Bernholtz, M. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In D. Dill, editor, CAV 94: Computer-aided Verification, LNCS, pages 142-155. Springer, 1994.
2. B. Boigelot, Symbolic Methods for Exploring Infinite State Spaces, PhD thesis University of Lìege May,1998.
3. B. Boigelot and P. Godefroid. Symbolic verification of communications protocols with infinite state spaces using QDDs. In Proceedings of CAV'96, volume 1102 of LNCS, Berlin, 1996. Springer
4. B. Boigelot and P. Wolp er. Symbolic Verification with Periodic Sets. In D. L. Dill, editor, Proceedings of CAV'94: Computer-aided Verification, volume 818 of LNCS, pages 55-67. Springer, 1994
5. B. Boigelot and P. Wolper . Verifying Systems with Infinite but Regular State Space. In A. J. Hu and M. Y. Vardi, editors, Proceedings of CAV'98: Computeraided Verification, volume 1427 of LNCS, pages 88-97. Springer, 1998
6. A . Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In A.W. Mazurkiewicz and J.Winkowski, editors, CONCUR '97: Concurrency Theory,, volume 1243 of LNCS, pages 135-1 50. Springer, 1997
7. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configuarations. Theoretical Computer Science, 221:211-250, 1999
8. T. Bultan, R. Gerber, and W. Pugh. Symbolic Model Checking of Infinitestate Systems using Presburger Arithmetics. In O. Grumberg, editor, Proceedings of CAV'97: Computer-aided Verification, volume 1254 of LNCS, pages 400-411. Springer, 1997
9. O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. In S. S. J. Bergstra, A. Ponse, editor, Handbook of Process Algebra. Elsevier Science Publisher B.V., 1999. to appear. 22
10. O. Burkart and B. Steffen. Composition, decomposition and model checking optimal of pushdown processes. Nordic Journal of Computing, 2(2):89-125, 1995
11. O. Burkart and B. Steffen. Model-checking the full modal mu-calculus for infinite sequential processes. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, International Col loquium on Automata, Languages, and Programming (ICALP'97), volume 1256 of LNCS, pages 419-429. Springer, 1997
12. W. Chan, R. Anderson, P. Beame, and D. Notkin. Combining Constraint Solving and Symbolic Model Checking for a Class of Systems with Non-linear Constraints. In O. Grumberg, editor, Proceedings of the Ninth Conference on Computer Aided Verification (CAV'97), volume 1254 of LNCS, pages 316-327. Springer, 1997
13. W. Charatonik, D. McAllester, D. Niwinski, A. Podelski, and I. Walukiewicz. The Horn mu-calculus. In V. Pratt, editor, Proceedings of LICS'98: Logic in Computer Science, pages 58-69. IEE E Computer Society Press, 1998
14. W. Charatonik, S. Mukhopadhyay, and A. Podelski. The S?-calculus. Submitted to this conference. 29, 3515
15. W. Charatonik and A. Podelski. Set-based analysis of reactive infinite-st ate systems. In B. Steffen, editor, Proceedings of TACAS'98: Tools and Algorithms for the Construction and Analysis of Systems, volume 1384 of LNCS, pages 358-375. Springer, 1998
16. G. Delzanno and A. Podelski. Model checking in CLP. In R. Cleaveland, editor, Proceedings of TACAS'99: Tools and Algorithms for the Construction and Analysis of Systems, volume 1579 of LNCS, pages 223-239. Springer, 1999
17. J. Esparza and A. Podelski. Efficient algorithms for pre-and post-on interprocedural parallel flow graphs. In T. Reps, editor, Proceedings of POPL'00: Principles of Programming Languages, pages 1-11. IEEE, ACM Press, January 2000
18. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science 9, www.elsevier.nl/locate/entcs, 13 pages, 1997
19. L. Fribourg and J. Richardson. Symbolic Verification with Gap-order Constraints. Technical Report LIENS-93-3, Laboratoire d'Informatique, Ecole Normale Superieure, Paris, 1996
20. S. Graf and H. Saidi. Verifying invariant s using theorem proving. In Proceedings of CAV'96: Computer-aided Verification, volume 1102 of LNCS, pages 196-207. Springer, 1996
21. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: a Mode l Checker for Hybrid Systems. In O. Grumberg, editor, Proceedings of CAV'97: Computer Aided Verification, volume 1254 of LNCS, pages 460-463. Springer, 1997
22. K. G. Larsen, P. Pettersson, and W. Y i. Compositional and symbolic model checking of real-time systems. In Proceedings of the 16th Annual Real-time Systems Symposium, pages 76-87. IEEE Computer Society Press, 1995
23. D. McAllester. On th e complexity analysis of static analyses. In A. Cortesi and G. Fiĺe, editors, SAS'99: Static Analysis Symposium, volume 1694 of LNCS, pages 312-329. Springer, 1999.
24. S. Mukhopadhyay A. Podelski, Model checking in Uppaal and query evaluation, In preparation.
25. Y. S. Ramakrishnan, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Efficient M odel Checking using Tabled Resolution. In O. Grumberg, editor, Proceedings of CAV'97: Computer-aided Verification, volume 1254 of LNCS, pages 143-154. Springer, 1997
26. T. R. Shiple, J. H. Kukula, and R. K. Ranjan. A Comparison of Presburger Engines for EFSM Reachability. In A. J. Hu and M. Y. Vardi, editors, Proceedings of CAV'98: Computer-aided Verification, volume 1427 of LNCS, pages 280-292. Springer, 1998
27. H. B. Sipma, T. E. Uribe, and Z. Manna. Deductive Model Checking. In R. Alur and T. Henzinger, editors, Proceedings of CAV'96: Computer-aided Verification, volume 1102 of LNCS, pages 208-219. Springer, 1996
28. I. Walukiewicz. Pushdown processes: Games and model checking. In Proceedings of CAV'96: Computer-aided Verification, volume 1102 of LNCS, pages 62-74. Springer, 1996