Efficient symbolic representations for arithmetic constraints in verification

International Journal of Foundations of Computer Science

Volumn 14, Issue 4, 2003, Pages 605-624

  Bartzis, Constantinos ^a   Bultan, Tevfik ^a  

^a University of California   (United States)

Author keywords

Automata; Presburger arithmetic; symbolic model checking

Indexed keywords

EID: 4544326700     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001911     Document Type: Article

References (25)

1. K. L. McMillan. Symbolic model checking. Kluwer Academic Publishers, Massachusetts,1993
2. T. A. Henzinger, P. Ho, and H. Wong-Toi. Hytech: a model checker for hybridsystems. Software Tools for Technology Transfer, 1:110-122, 1997
3. T. Bultan, R. Gerber, and W. Pugh. Model-checking concurrent systems withunbounded integer variables: Symbolic representations, approximations, and experimentalresults. ACM Transactions on Programming Languages and Systems,21(4):747-789, July 1999
4. Giorgio Delzanno and Andreas Podelski. Constraint-based deductive model checking.Journal of Software Tools and Technology Transfer, 3(3):250-270, 2001
5. T. Yavuz-Kahveci and T. Bultan. Specification, verification, and synthesis of concurrencycontrol components. In Proceedings of the International Symposium onSoftware Testing and Analysis, pages 169-179, July 2002
6. G. Delzanno and T. Bultan. Constraint-based verification of client-server protocols.In Proceedings of the 7th International Conference on Principles and Practice ofConstraint Programming, 2001
7. N. Dor, M. Rodeh, and M. Sagiv. Cleanness checking of string manipulations inC programs via integer analysis. In Proceedings of the 8th International StaticAnalysis Symposium, volume 2126 of Lecture Notes in Computer Science, pages194-212. Springer-Verlag, 2001
8. N. Halbwachs, Y. E. Proy, and P. Roumanoff. Verification of real-time systemsusing linear relation analysis. Formal Methods in System Design, 11(2):157-185,August 1997
9. W. Pugh. The Omega test: a fast and practical integer programming algorithm fordependence analysis, 1992
10. A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finiteautomata. In H. Kirchner, editor, Proceedings of the 21st International Colloquiumon Trees in Algebra and Programming-CAAP'96, volume 1059 of Lecture Notes inComputer Science, pages 30-43. Springer-Verlag, April 1996
11. P. Wolper and B. Boigelot. An automata-theoretic approach to Presburger arithmeticconstraints. In Proceedings of the Static Analysis Symposium, 1995
12. Bernard Boigelot, Stephane Rassart, and Pierre Wolper. On the expressiveness ofreal and integer arithmetic automata. LNCS, 1443, 1998
13. P. Wolper and B. Boigelot. On the construction of automata from linear arithmeticconstraints. In S. Graf and M. Schwartzbach, editors, Proceedings of the 6th InternationalConference on Tools and Algorithms for the Construction and Analysis ofSystems, Lecture Notes in Computer Science, pages 1-19. Springer, April 2000
14. Nils Klarlund and Anders M0ller. MONA Version 1.4 User Manual BRICS NotesSeries NS-01-1, Department of Computer Science, University of Aarhus, 2001
15. T. Yavuz-Kahveci, M. Tuncer, and T. Bultan. Composite symbolic library. InProceedings of the 7th International Conference on Tools and Algorithms for theConstruction and Analysis of Systems, volume 2031 of Lecture Notes in ComputerScience, pages 335-344. Springer-Verlag, April 2001
16. The Liege Automata-based Symbolic Handler (LASH). Available athttp://www.montefiore.ulg.ac.be/~boigelot/research/lash
17. The Omega project, http://www.cs.umd.edu/projects/omega
18. D. C. Cooper. Programs for mechanical program verification. In Machine Intelligence6, pages 43-59, New York, 1971. American Elsevier
19. R. Bryant. Graph-based algorithms for boolean function manipulation. In Proceedingsof the 27th ACM/IEEE Design Automation Conference, 1990
20. C. Bartzis and T. Bultan. Automata-based representations for arithmetic constraintsin automated verification. In Proceedings of the Seventh InternationalConference on Implementation and Application of Automata, June 2002
21. T. R. Shiple, J. H. Kukula, and R. K. Ranjan. A comparison of Presburger enginesfor EFSM reachability. In Proceedings of the 10th International Conference onComputer-Aided Verification, 1998
22. J.G. Henriksen, J. Jensen, M. Jorgensen, N. Klarlund, B. Paige, T. Rauhe, andA. Sandholm. Mona: Monadic second-order logic in practice. In Tools and Algorithmsfor the Construction and Analysis of Systems, First International Workshop,TACAS '95, LNCS 1019, 1996
23. T. Bultan and T. Yavuz-Kahveci. Action language verifier. In Proceedings of the16th IEEE International Conference on Automated Software Engineering, 2001
24. G. R. Andrews. Concurrent Programming: Principles and Practice. The Benjamin/Cummings Publishing Company, Redwood City, California, 1991
25. T. Yavuz-Kahveci and T. Bultan. Specification, verification, and synthesis of concurrencycontrol components. In Proceedings of the 2002 ACM/SIGSOFT InternationalSymposium on Software Testing and Analysis, pages 169-179, 2002.