Boolean Satisfiability with Transitivity Constraints

ACM Transactions on Computational Logic

Volumn 3, Issue 4, 2002, Pages 604-627

  Bryant, Randal E ^a   Velev, Miroslav N ^b  

^a Carnegie Mellon University   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Boolean satisfiability; decision procedures; formal verification; Verification

Indexed keywords

EID: 84974717885     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/566385.566390     Document Type: Article

References (17)

1. Bryant, R. E. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35, 8 (Aug.), 677-691
2. Bryant, R. E. 1991. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. Comput. 40, 2 (Feb.), 205-213
3. Bryant, R. E., German, S., and Velev, M. N. 1999. Exploiting positive equality in a logic of equality with uninterpreted functions. In Computer-Aided Verification, N. Halbwachs and D. Peled, Eds. Lecture Notes in Computer Science, vol. 1633. Springer-Verlag, New York, 470-482
4. Bryant, R. E. and Velev, M. N. 2001. Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic. ACM Trans. Comput. Logic 2, 1 (Jan.)
5. Burch, J. R., 1996. Techniques for verifying superscalar microprocessors. In Proceedings of the 33rd Design Automation Conference. 552-557
6. Burch, J. R. and Dill, D. L. 1994. Automated verification of pipelined microprocessor control. In Computer-Aided Verification, D. L. Dill, Ed. Lecture Notes in Computer Science, vol. 818. Springer-Verlag, New York, 68-80
7. Goel, A., Sajid, K., Zhou, H., Aziz, A., and Singhal, V. 1998. BDD based procedures for a theory of equality with uninterpreted functions. In Computer-Aided Verification, A. J. Hu and M. Y. Vardi, Eds. Lecture Notes in Computer Science, vol. 1427. Springer-Verlag, New York, 244-255
8. Hennessy, J. L. and Patterson, D. A. 1996. Computer Architecture: A Quantitative Approach, 2nd edition. Morgan-Kaufmann, San Mateo, Calif
9. Leighton, F. T. 1992. An Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes. Morgan-Kaufmann, San Mateo, Calif
10. Marques-Silva, J. P. 1999. The impact of branching heuristics in propositional satisfiability algorithms. In Proceedings of the 9th Portugese Conference on Artificial Intelligence
11. Marques-Silva, J. P., and Sakallah, K. A. 1999. GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Comput. 48, 5 (May), 506-521
12. Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., and Malik, S. 2001. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference
13. Rose, D. 1970. Triangulated graphs and the elimination process. J. Math. Anal. Appl. 32, 597-609
14. Velev, M. N. 2001. EVC: A validity checker for the logic of equality with uinterpred functions and memories, exploiting positive equality and conservative transformations. In Computer-Aided Verification, G. Berry, Ed. Lecture Notes in Computer Science, vol. 2102. Springer-Verlag, New York, 235-240
15. Velev, M. N. and Bryant, R. E. 1999. Superscalar processor verification using efficient reductions of the logic of equality with uninterpreted functions. In Correct Hardware Design and Verification Methods, L. Pierre and T. Kropf, Eds. Lecture Notes in Computer Science, vol. 1703. SpringerVerlag, New York, 37-53
16. Velev, M. N. and Bryant, R. E. 2001. Effective use of Boolean satisifiability solvers in the formal verification of superscalar and VLIW microprocessors. In Proceedings of the 38th Design Automation Conference
17. Yannakakis, M. 1981. Computing the minimum fill-in is NP-complete. SIAM J. Alg. Disc. Math. 2, 77-79