Construction of efficient BDDs for bounded arithmetic constraints

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

Volumn 2619, Issue , 2003, Pages 394-408

  Bartzis, Constantinos ^a   Bultan, Tevfik ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY;

ARITHMETIC CONSTRAINTS; BOUNDED ARITHMETIC; INEQUALITY CONSTRAINT; INTEGER ARITHMETIC; INTEGER VARIABLES; LINEAR ARITHMETIC; NUMBER AND SIZE; SYMBOLIC MODEL CHECKERS;

MODEL CHECKING;

EID: 35248879693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_28     Document Type: Article

References (13)

1. ∼kenmcmil/smv.
2. G. R. Andrews. Concurrent Programming: Principles and Practice. The Benjamin/Cummings Publishing Company, Redwood City, California, 1991.
3. R. Bryant. Graph-based algorithms for boolean function manipulation. In Proceedings of the 27th ACM/IEEE Design Automation Conference, 1990.
4. R.E Bryant and Y.A. Chen. Verification of arithmetic functions with binary moment diagrams. In Proceedings of the 32nd ACM/IEEE Design Automation Conference, June 1995.
5. T. Bultan, R. Gerber, and C. League. Composite model checking: Verification with type-specific symbolic representations. ACM Transactions on Software Engineering and Methodology, 9(1):3-50, January 2000.
6. T. Bultan and T. Yavuz-Kahveci. Action language verifier. In Proceedings of the 16th IEEE International Conference on Automated Software Engineering, 2001.
7. W. Chan, R. J. Anderson, P. Beame, S. Burns, F. Modugno, D. Notkin, and J. D. Reese. Model checking large software specifications. IEEE Transactions on Software Engineering, 24(7):498-520, July 1998.
8. A. Cimatti, E.M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. Nusmv 2: An opensource tool for symbolic model checking. In Proceedings of the International Conference on Computer-Aided Verification, 2002.
9. E.M. Clarke, M. Fujita, and X. Zhao. Hybrid decision diagrams - overcoming the limitations of mtbdds and bmds. In In International Conference of Computer-Aided Design, pages 159-163, 2000.
10. M. Garey and D. Jonson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
11. K. L. McMillan. Symbolic model checking. Kluwer Academic Publishers, Massachusetts, 1993.
12. J. Yang, A. K. Mok, and F. Wang. Symbolic model checking for event-driven real-time systems. ACM Transactions on Programming Languages and Systems, 19(2):386-412, March 1997.
13. 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.