Efficient image computation in infinite state model checking

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

Volumn 2725, Issue , 2003, Pages 249-261

  Bartzis, Constantinos ^a   Bultan, Tevfik ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTER AIDED ANALYSIS; ENCODING (SYMBOLS); MODEL CHECKING;

ARITHMETIC CONSTRAINTS; IMAGE COMPUTATION; INFINITE STATE MODEL CHECKING; INPUT SET; LINEAR ARITHMETIC CONSTRAINTS; LINEAR TIME; SYMBOLIC REPRESENTATION;

COMPUTATIONAL EFFICIENCY;

EID: 35048862253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_26     Document Type: Article

References (21)

1. ∼boigelot/research/lash/.
2. Constantinos Bartzis and Tevfik Bultan. Efficient symbolic representations for arithmetic constraints in verification. International Journal of Foundations of Computer Science. To appear.
3. Constantinos Bartzis and Tevfik Bultan. Automata-based representations for arithmetic constraints in automated verification. In Proceedings of the Seventh International Conference on Implementation and Application of Automata, 2002.
4. Constantinos Bartzis and Tevfik Bultan. Construction of efficient BDDs for bounded arithmetic constraints. In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2003.
5. A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In H. Kirchner, editor, Proceedings of the 21st International Colloquium on Trees in Algebra and Programming - CAAP'96, volume 1059 of Lecture Notes in Computer Science, pages 30-43. Springer-Verlag, April 1996.
6. R. Bryant. Graph-based algorithms for boolean function manipulation. In Proceedings of the 27th ACM/IEEE Design Automation Conference, 1990.
7. T. Bultan and T. Yavuz-Kahveci. Action language verifier. In Proceedings of the 16th IEEE International Conference on Automated Software Engineering, 2001.
8. Tevfik Bultan, Richard Gerber, and William Pugh. Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. ACM Transactions on Programming Languages and Systems, 21(4):747-789, 1999.
9. G. Delzanno and T. Bultan. Constraint-based verification of client-server protocols. In Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, 2001.
10. Giorgio Delzanno and Andreas Podelski. Constraint-based deductive model checking. Journal of Software Tools and Technology Transfer, 3(3):250-270, 2001.
11. N. Dor, M. Rodeh, and M. Sagiv. Cleanness checking of string manipulations in C programs via integer analysis. In Proceedings of the 8th International Static Analysis Symposium, volume 2126 of Lecture Notes in Computer Science, pages 194-212. Springer-Verlag, 2001.
12. N. Halbwachs, Y. E. Proy, and P. Roumanoff. Verification of real-time systems using linear relation analysis. Formal Methods in System Design, 11(2):157-185, August 1997.
13. T. A. Henzinger, P. Ho, and H. Wong-Toi. Hytech: a model checker for hybrid systems. Software Tools for Technology Transfer, 1:110-122, 1997.
14. Nils Klarlund and Anders Møller. MONA Version 1.4 User Manual BRIGS Notes Series NS-01-1, Department of Computer Science, University of Aarhus, 2001.
15. K. L. McMillan. Symbolic model checking. Kluwer Academic Publishers, Massachusetts, 1993.
16. W. Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis, 1992.
17. Tatiana Rybina and Andrei Voronkov. Using canonical representations of solutions to speed up infinite-state model checking. In Proceedings of the 14th International Conference on Computer Aided Verification, pages 400-411, 2002.
18. P. Wolper and B. Boigelot. An automata-theoretic approach to Presburger arithmetic constraints. In Proceedings of the Static Analysis Symposium, 1995.
19. P. Wolper and B. Boigelot. On the construction of automata from linear arithmetic constraints. In S. Graf and M. Schwartzbach, editors, Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, pages 1-19. Springer, April 2000.
20. T. Yavuz-Kahveci and T. Bultan. Specification, verification, and synthesis of concurrency control components. In Proceedings of the International Symposium on Software Testing and Analysis, pages 169-179, July 2002.
21. T. Yavuz-Kahveci, M. Tuncer, and T. Bultan. Composite symbolic library. In Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of Lecture Notes in Computer Science, pages 335-344. Springer-Verlag, April 2001.