The algebra of equality proofs

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 469-483

  Stump, Aaron ^a   Tan, Li Yang ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; EQUIVALENCE CLASSES; TECHNICAL WRITING; THEOREM PROVING;

EQUALITY PROOFS; EQUIVALENCE RELATION; REFLEXIVITY;

ALGEBRA;

EID: 24944538073     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_34     Document Type: Conference Paper

References (17)

1. C. Barrett, D. Dill, and A. Stump. Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In 14th International Conference on Computer-Aided Verification, 2002.
2. Clark Barrett and Sergey Berezin. CVC Lite: A new implementation of the co-operating validity checker. In Proceedings of the 16th International Conference on Computer Aided Verification, 2004.
3. Jerry R. Burch and David L. Dill. Automatic verification of pipelined microprocessor control. In David L. Dill, editor, Conference on Computer-Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 68-80. Springer-Verlag, 1994.
4. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1992.
5. L. de Moura, H. Rueß, and N. Shankar. Justifying Equality. In S. Ranise and C. Tinelli, editors, 2nd International Workshop on Pragmatics of Decision Procedures in Automated Reasoning, 2004.
6. J. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: integrated canonizer and solver. In G. Berry, H. Comon, and A. Finkel, editors, 13th International Conference on Computer-Aided Verification, 2001.
7. D. Knuth and P. Bendix. Simple Word Problems in Universal Algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, 1970.
8. S. Lahiri, R. Bryant, A. Goel, and M. Talupur. Revisiting Positive Equality. In Tools and Algorithms for the Construction and Analysis of Systems, volume 2988 of LNCS, pages 1-15. Springer-Verlag, 2004.
9. G. Nelson and D. Oppen. Fast decision procedures based on congruence closure. Journal of the Association for Computing Machinery, 27(2):356-64, 1980.
10. R. Nieuwenhuis and A. Oliveras. Union-Find and Congruence Closure Algorithms that Produce Proofs. In S. Ranise and C. Tinelli, editors, 2nd International Workshop on Pragmatics of Decision Procedures in Automated Reasoning, 2004. (short paper).
11. R. Nieuwenhuis and A. Oliveras. Proof-producing Congruence Closure. In J. Giesl, editor, 16th International Conference on Rewriting Techniques and Applications, 2005. (under review).
12. A. Pnueli, Y. Rodeh, O. Shtrichman, and M. Siegel. Deciding Equality Formulas by Small Domains Instantiations. In Proceedings of the 11th International Computer-Aided Verification Conference, volume 1633 of Lecture Notes in Computer Science, pages 455-469. Springer-Verlag, 1999.
13. H. Ruess and N. Shankar. Deconstructing Shostak. In 16th IEEE Symposium on Logic in Computer Science, 2001.
14. R. Shostak. Deciding combinations of theories. Journal of the Association for Computing Machinery, 31(1):1-12, 1984.
15. A. Stump. Checking Validities and Proofs with CVC and flea. PhD thesis, Stanford University, 2002. available from http://www.cs.wustl.edu/~stump/.
16. A. Stump, C. Barrett, and D. Dill. CVC: a Cooperating Validity Checker. In 14th International Conference on Computer-Aided Verification, 2002.
17. M. Velev and R. Bryant. Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions. In L. Pierre and T. Kröpf, editors, Correct Hardware Design and Verification Methods, volume 1703 of Lecture Notes in Computer Science, pages 37-53. Springer-Verlag, 1999.