Revisiting positive equality

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

Volumn 2988, Issue , 2004, Pages 1-15

  Lahiri, Shuvendu K ^a   Randal, E ^a   Bryant, ^a   Goel, Amit ^a   Talupur, Muralidhar ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

DECISION PROCEDURE; FUNCTION SYMBOLS; LOGIC OF EQUALITIES; POSITIVE EQUALITY; UNINTERPRETED FUNCTIONS;

ARTIFICIAL INTELLIGENCE;

EID: 24944564861     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_1     Document Type: Article

References (22)

1. W. Ackermann. Solvable Cases of the Decision Problem. North-Holland, Amsterdam, 1954.
2. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In Programming Language Design and Implementation (PLDI '01), Snowbird, Utah, June, 2001. SIGPLAN Notices, 36(5), May 2001.
3. C. Barrett, D. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In M. Srivas and A. Camilleri, editors, Formal Methods in Computer-Aided Design (FMCAD '96), LNCS 1166, pages 187-201, November 1996.
4. C. W. Barrett, D. L. Dill, and A. Stump. Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In E. Brinksma and K. G. Larsen, editors, Proc. Computer-Aided Verification (CAV'02), LNCS 2404, pages 236-249, July 2002.
5. R. E. Bryant, S. German, and M. N. Velev. Exploiting positive equality in a logic of equality with uninterpreted functions. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification (CAV '99), LNCS 1633, pages 470-482, July 1999.
6. R. E. Bryant, S. German, and M. N. Velev. Processor verification using efficient reductions of the logic of uninterpreted functions to prepositional logic. ACM Transactions on Computational Logic, 2(1):1-41, January 2001.
7. R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and Verifying Systems using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions. In E. Brinksma and K. G. Larsen, editors, Proc. Computer-Aided Verification (CAV'02), LNCS 2404, pages 78-92, July 2002.
8. J. R. Burch and D. L. Dill. Automated verification of pipelined microprocessor control. In D. Dill, editor, Computer-Aided Verification (CAV '94), LNCS 818, pages 68-80, June 1994.
9. C. Flanagan, R. Joshi, X. Ou, and J. Saxe. Theorem Proving usign Lazy Proof Explication. In W. A. Hunt, Jr. and F. Somenzi, editors, Computer-Aided Verification (CAV 2003), LNCS 2725, pages 355-367, 2003.
10. A. Goel, K. Sajid, H. Zhou, A. Aziz, and V. Singhal. BDD based procedures for a theory of equality with uninterpreted functions. In A. J. Hu and M. Y. Vardi, editors, Computer-Aided Verification (CAV '98), LNCS 1427, pages 244-255, June 1998.
11. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy Abstraction. In John Launchbury and John G. Mitchell, editors, Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages (POPL '02), pages 58-70, 2002.
12. S. K. Lahiri. An efficient decision procedure for the logic of Counters, Constrained Lambda expressions, Uninterpreted Functions and Ordering. Master's thesis, ECE Department, Carnegie Mellon University, May 2001.
13. S. K. Lahiri, R. E. Bryant, and B. Cook. A symbolic approach to predicate abstraction. In W. A. Hunt, Jr. and F. Somenzi, editors, Computer-Aided Verification (CAV 2003), LNCS 2725, pages 141-153, 2003.
14. S. K. Lahiri, R. E. Bryant, A. Goel, and M. Talupur. Revisiting positive equality. Technical Report CMU-CS-03-196, Carnegie Mellon University, November 2003.
15. S. K. Lahiri, S. A. Seshia, and R. E. Bryant. Modeling and verification of out-of-order microprocessors in UCLID. In J. W. O'Leary M. Aagaard, editor, Formal Methods in Computer-Aided Design (FMCAD '02), LNCS 2517, pages 142-159, Nov 2002.
16. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In 38th Design Automation Conference (DAC '01), 2001.
17. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (TOPLAS), 2(1):245-257, 1979.
18. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In D. Kapur, editor, 11th International Conference on Automated Deduction (CADE), June 1992.
19. A. Pnueli, Y. Rodeh, O. Shtrichman, and M. Siegel. Deciding equality formulas by small-domain instantiations. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 455-469. Springer-Verlag, July 1999.
20. A. Pnueli, Y. Rodeh, O. Strichman, and M. Siegel. The Small Model Property: How Small Can It Be? Information and Computation. Information and Computation, 178(l):279-293, 2002.
21. Y. Rodeh and O. Strichmann. Finite Instantiations in Equivalence Logic with Uninterpreted Functions. In G. Berry, H. Comon, and A. Finkel, editors, Computer-Aided Verification (CAV '01), LNCS 2102, pages 144-154, 2001.
22. R. E. Shostak. Deciding Combinations of Theories. Journal of the ACM, 31(1):1-12, 1984.