Using BDDs with combinations of theories

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

Volumn 2514, Issue , 2002, Pages 190-201

  Fontaine, Pascal ^a   Gribomont, E Pascal ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BINARY DECISION DIAGRAMS; COMPUTER CIRCUITS; CONTEXT FREE LANGUAGES;

BINARY DECISION DIAGRAMS (BDD); BOOLEAN FORMULAE; DECISION PROCEDURE; FIRST ORDER; FREE LANGUAGES; GENERAL CONSTRAINTS; LINEAR ARITHMETIC CONSTRAINTS; QUANTIFIER-FREE FIRST ORDER LOGIC;

BOOLEAN FUNCTIONS;

EID: 84954432638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36078-6_13     Document Type: Conference Paper

References (25)

1. W. Ackermann. Solvable Cases of the Decision Problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1954.
2. C. W. Barrett, D. L. Dill, and A. Stump. A generalization of Shostak’s method for combining decision procedures. In Frontiers of Combining Systems (FROCOS), volume 2309 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
3. N. S. Bjørner, Z. Manna, H. B. Sipma, and T. E. Uribe. Deductive verification of real-time systems using STeP. TCS:The oretical Computer Science, 253, 2001.
4. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677–691, Aug. 1986.
5. 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 Proc. 9th Conf. Computer Aided Verification, volume 1254 of Lecture Notes in Computer Science, pages 316–327. Springer-Verlag, 1997.
6. K. M. Chandy and J. Misra. Parallel Program Design. Addison-Wesley, Reading, Massachusetts, 1988.
7. D. Cyrluk, P. Lincoln, and N. Shankar. On Shostak’s decision procedure for combinations of theories. In Proc. 13th Int. Conf. on Automated Deduction, volume 1104 of Lecture Notes in Computer Science, pages 463–477, New Brunswick, NJ, 1996. Springer-Verlag.
8. J.-C. Filliˆatre, S. Owre, H. Rueß, and N. Shankar. ICS: integrated canonizer and solver. In Proc. 13th Conf. Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, pages 246–249. Springer-Verlag, 2001.
9. A. Goel, K. Sajid, H. Zhou, A. Aziz, and V. Singhal. BDD based procedures for a theory of equality with uninterpreted functions. In Proc. 10th Conf. Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 244–255. Springer-Verlag, 1998.
10. J. Goubault. Proving with BDDs and control of information. In Proc. 12th Conf. on Automated Deduction, volume 814 of Lecture Notes in Computer Science, pages 499–513. Springer-Verlag, 1994.
11. E. P. Gribomont and D. Rossetto. CAVEAT: technique and tool for Computer Aided VErification And Transformation. In Proc. 7th Conf. on Computer Aided Verification, volume 939 of Lecture Notes in Computer Science, pages 70–83, Liege, Belgium, 1995. Springer-Verlag.
12. E. P. Gribomont and N. Salloum. Using OBDD’s for the validation of Skolem verification conditions. In Proc. 16th Int. Conf. on Automated Deduction, volume 1632 of Lecture Notes in Computer Science, pages 222–226, Trento, Italy, 1999. Springer-Verlag.
13. J. F. Groote and J. van de Pol. Equational binary decision diagrams. In Logic Programming and Automated Reasoning, volume 1955 of Lecture Notes in Computer Science, pages 161–178. Springer-Verlag, 2000.
14. C. Heitmeyer and N. A. Lynch. The generalized railroad crossing — a case study in formal verification of real-time systems. In Proceedings 15th IEEE Real-Time Systems Symposium, San Juan, Puerto Rico, pages 120–131, Dec. 1994.
15. The Liège Automata-based Symbolic Handler (LASH). Available at http://www.montefiore.ulg.ac.be/˜boigelot/research/lash/.
16. J. R. Levitt. Formal Verification Techniques for Digital Systems. PhDthesis, Stanford University, December 1998.
17. N. Lynch. Distributed Algorithms. Morgan Kaufmann, San Francisco, CS, 1996.
18. J. Møller, J. Lichtenberg, H. R. Andersen, and H. Hulgaard. Difference decision diagrams. In Computer Science Logic, volume 1683 of Lecture Notes in Computer Science, pages 111–125. Springer-Verlag, 1999.
19. G. Nelson and D. C. Oppen. Simplifications by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245–257, Oct. 1979.
20. G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356–364, 1980.
21. J. Posegga and P. H. Schmitt. Automated deduction with shannon graphs. Journal of Logic and Computation, 5(6):697–729, Dec. 1995.
22. H. Rueß and N. Shankar. Deconstructing shostak. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science (LICS-01), pages 19–28, Los Alamitos, CA, 2001. IEEE Computer Society.
23. R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1–12, Jan. 1984.
24. C. Tinelli and M. T. Harandi. A new correctness proof of the Nelson–Oppen combination procedure. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems:P roceedings of the 1st International Workshop (Munich, Germany), pages 103–120. Kluwer Academic Publishers, 1996.
25. P. Wolper and B. Boigelot. On the construction of automata from linear arithmetic constraints. In Proc. 6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science, pages 1–19, Berlin, March 2000. Springer-Verlag.