Yet another decision procedure for Equality Logic

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 307-320

  Meir, Orly ^a   Strichman, Ofer ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; BOOLEAN ALGEBRA; CONSTRAINT THEORY; FORMAL LOGIC; GRAPH THEORY;

BOOLEAN VARIABLES; CONTRADICTARY CYCLES;

DECISION THEORY;

EID: 26444519778     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_32     Document Type: Conference Paper

References (17)

1. W. Ackermann. Solvable cases of the Decision Problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1954.
2. th Intl. Conference on Computer Aided Verification (CAV'99), 1999.
3. R. Bryant, S. German, and M. Velev. Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic. ACM Transactions on Computational Logic, 2(1): 1-41, 2001.
4. th Intl. Conference on Computer Aided Verification (CAV'00), volume 1855 of LNCS, 2000.
5. th Intl. Conference on Computer Aided Verification (CAV'02), 2002.
6. th Intl. Conference on Computer Aided Verification (CAV'94), volume 818 of LNCS, pages 68-80. Springer-Verlag, 1994.
7. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms, chapter 26, page 563. MIT press, 2000.
8. R. Gershman and O. Strichman. Cost-effective hyper-resolution for preprocessing cnf formulas. In T. Walsh and F. Bacchus, editors, Theory and Applications of Satisfiability Testing (SAT'05), 2005.
9. A. Goel, K. Sajid, H. Zhou, A. Aziz, and V. Singhal. BDD based procedures for a theory of equality with uninterpreted functions. In A. Hu and M. Vardi, editors, CAV98, volume 1427 of LNCS. Springer-Verlag, 1998.
10. L.Ryan. Efficient algorithms for clause-learning SAT solvers. Master's thesis, Simon Fraser University, 2004.
11. O. Meir and O. Strichman. Yet another decision procedure for equality logic (full version), 2005. ie.technion.ac.il/∼ofers/cav05_full.ps.
12. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. Design Automation Conference (DAC'01), 2001.
13. th Intl. Conference on Computer Aided Verification (CAV'99), LNCS. Springer-Verlag, 1999.
14. A. Pnueli, Y. Rodeh, O. Strichman, and M. Siegel. The small model property: How small can it be? Information and computation, 178(1):279-293, Oct. 2002.
15. A. Pnueli, M. Siegel, and O. Shtrichman. Translation validation for synchronous languages. In K. Larsen, S. Skyum, and G. Winskel, editors, ICALP'98, volume 1443 of LNCS, pages 235-246. Springer-Verlag, 1998.
16. Y. Rodeh and O. Shtrichman. Finite instantiations in equivalence logic with uninterpreted functions. In Computer Aided Verification (CAV), 2001.
17. R. Shostak. An algorithm for reasoning about equality. Communications of the ACM, 21(7):583-585, July 1978.