Zero, successor and equality in BDDs

Annals of Pure and Applied Logic

Volumn 133, Issue 1-3 SPEC. ISS., 2005, Pages 101-123

  Badban, Bahareh ^a   van de Pol, Jaco ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 14644429797     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2004.10.005     Document Type: Article

References (31)

1. W. Ackermann Solvable cases of the decision problem in: Studies in Logic and the Foundations of Mathematics 1954 North-Holland Amsterdam
2. H.R. Andersen H. Hulgaard Boolean expression diagrams in: Twelfth Annual IEEE Symposium on Logic in Computer Science Warsaw, Poland 1997 IEEE Computer Society pp 88-98
3. F. Baader T. Nipkow Term Rewriting and All That 1998 Cambridge University Press
4. B. Badban, J.C. van de Pol, Two solutions to incorporate zero, successor and equality in binary decision diagrams, Technical Report SEN-R0231, Centrum voor Wiskunde en Informatica, Amsterdam, December 2002
5. C.W. Barrett D.L. Dill J.R. Levitt Validity checking for combinations of theories with equality In: M.K. Srivas A. Camilleri (Eds.) Proceedings of Formal Methods in Computer-Aided Design FMCAD LNCS vol. 1166 1996 Springer pp. 187-201
6. G. Behrmann K.G. Larsen J. Pearson C. Weise W. Yi Efficient timed reachability analysis using clock difference diagrams Proc. of 11th Computer Aided Verification 1999 pp. 341-353
7. J. Bengtsson K.G. Larsen F. Larsson P. Pettersson W. Yi UPPAAL: A tool suite for the automatic verification of real-time systems In: R. Alur T.A. Henzinger E.D. Sontag (Eds.) Hybrid Systems III LNCS vol. 1066 1996 Springer pp. 232-243
8. A.J.C. Bik, H.A.G. Wijshoff, Implementation of Fourier-Motzkin elimination, Technical Report 94-42, Dept. of Computer Science, Leiden University, Leiden, The Netherlands, 1994
9. S.C.C. Blom W.J. Fokkink J.F. Groote I. van Langevelde B. Lisser J.C. van de Pol μ CRL: A toolset for analysing algebraic specifications In; G. Berry H. Comon A. Finkel (Eds.) Proc. of CAV 2001 July LNCS vol. 2102 2001 Springer 250-254
10. S.C.C. Blom J.C. van de Pol State space reduction by proving confluence In: E. Brinksma K.G. Larsen (Eds.) Proc. of Computer-Aided Verification CAV LNCS vol. 2404 2002 Springer pp 596-609
11. R.E. Bryant Symbolic boolean manipulation with ordered binary-decision diagrams ACM Computing Surveys 24 3 1992 293-318
12. R.E. Bryant S. German M.N. Velev Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic ACMTCL: ACM Transactions on Computational Logic 2 2001
13. J.R. Burch D.L. Dill Automatic verification of pipelined micro-processors control In: D.L. Dill (Ed.) Proceedings of Computer Aided Verification CAV'94 LNCS vol. 818 1994 Springer pp 68-80
14. N. Dershowitz Termination of rewriting Journal of Symbolic Computation 3 1-2 1987 69-115
15. H. Ganzinger Shostak light in: A. Voronkov (Ed.), Automated Deduction-CADE-18 LNCS vol. 2392 2002 Springer pp. 332-346
16. A. Goel K. Sajid H. Zhou A. Aziz BDD based procedures for a theory of equality with uninterpreted functions in: Proc. of Computer Aided Verification CAV'98 LNCS vol. 1427 1998 Springer pp. 244-255
17. J.F. Groote J.C. van de Pol Equational binary decision diagrams In: M. Parigot A. Voronkov (Eds.) Proc. of LPAR 2000 LNAI vol. 1955 2000 Springer pp. 161-178
18. J. Møller J. Lichtenberg H.R. Andersen H. Hulgaard Difference decision diagrams in: Computer Science Logic Denmark, September 1999
19. G. Nelson D.C. Oppen Fast decision procedures based on congruence closure Journal of the ACM 27 2 1980 356-364
20. S. Owre S. Rajan J.M. Rushby N. Shankar M.K. Srivas PVS: Combining specification, proof checking, and model checking In: R. Alur T.A. Henzinger (Eds.) Proceedings of Computer Aided Verification CAV'96 LNCS vol. 1102 1996 Springer pp. 411-414
21. A. Pnueli Y. Rodeh O. Shtrichman M. Siegel Deciding equality formulas by small domains instantiations In: N. Halbwachs D. Peled (Eds.) Proc. of Computer Aided Verification CAV'99 LNCS vol. 1633 1999 Springer
22. V. Pratt, Two easy theories whose combination is hard, Technical Report, Massachusetts Institute of Technology, Cambridge, MA, 1970
23. H. Ruess N. Shankar Deconstructing Shostak in: 16th Ann. IEEE Symp. on Logic in Computer Science LICS'01 2001 IEEE pp. 19-28
24. S.A. Seshia S. Lahiri R.E. Bryant Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions In: E. Brinksma K.G. Larsen (Eds.) Proc. of Computer-Aided Verification CAV LNCS vol. 2404 2002 Springer pp. 78-92
25. N. Shankar H. Rueβ Combining Shostak theories In: S. Tison. (Ed.) Rewriting Techniques and Applications RTA LNCS vol. 2378 2002 Springer pp. 1-18
26. R.E. Shostak An algorithm for reasoning about equality Communications of the ACM 21 7 1978 583-585
27. O. Strichman On solving Presburger and linear arithmetic with SAT In: M.D. Aagaard J.W. O'Leary (Eds.) Formal Methods in Computer-Aided Design FMCAD LNCS vol. 2517 2002 pp. 160-170
28. O. Strichman S.A. Seshia R.E. Bryant Deciding separation formulas with SAT In: E. Brinksma K.G. Larsen (Eds.) Proc. of Computer-Aided Verification CAV LNCS vol. 2404 2002 Springer pp. 209-222
29. J.C. van de Pol, A prover for the μ CRL toolset with applications - Version 0.1, Technical Report SEN-R0106, CWI, Amsterdam, 2001
30. H. Zantema Termination of term rewriting In: M.A. Bezem J.W. Klop R.C. de Vrijer (Eds.) Term Rewriting Systems 2003 Cambridge University Press (Chapter 6)
31. H. Zantema J.C. van de Pol A rewriting approach to binary decision diagrams Journal of Logic and Algebraic Programming 49 1-2 2001 61-86