A two-tier technique for supporting quantifiers in a lazily proof-explicating theorem prover

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 334-348

  Leino, K Rustan M ^a   Musuvathi, Madan ^a   Ou, Xinming ^b  

^a MICROSOFT RESEARCH   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; DECISION THEORY; FORMAL LOGIC; PROBLEM SOLVING;

DECISION PROCEDURES; PREPOSITIONAL REASONING; QUANTIFIERS; SEARCH SPACE;

THEOREM PROVING;

EID: 24644514004     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_22     Document Type: Conference Paper

References (14)

1. Mike Barnett, Robert DeLine, Manuel Fähndrich, K. Rustan M. Leino, and Wolfram Schulte. Verification of object-oriented programs with invariants. Journal of Object Technology, 3(6):27-56, 2004.
2. Clark Barrett and Sergey Berezin. CVC Lite: A new implementation of the cooperating validity checker. In Proceedings of the 16th International Conference on Computer Aided Verification (CAV), Lecture Notes in Computer Science. Springer, July 2004.
3. Leonardo de Moura and Harald Rueß. Lemmas on demand for satisfiability solvers. In Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT'02), May 2002.
4. David Déharbe and Silvio Ranise. Light-weight theorem proving for debugging and verifying units of code. In Proc. of the International Conference on Software Engineering and Formal Methods (SEFM03), Camberra, Australia, September 2003.
5. David Detlefs, Greg Nelson, and James B. Saxe. Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, HP Labs, July 2003.
6. David L. Detlefs, K. Rustan M. Leino, Greg Nelson, and James B. Saxe. Extended static checking. Research Report 159, Compaq Systems Research Center, December 1998.
7. Cormac Flanagan, Rajeev Joshi, Xinming Ou, and James B. Saxe. Theorem proving using lazy proof explication. In 15th Computer-Aided Verification conference (CAV), July 2003.
8. Cormac Flanagan, Rajeev Joshi, and James B. Saxe. An explicating theorem prover for quantified formulas. Technical Report HPL-2004-199, HP Labs, 2004.
9. Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, and Raymie Stata. Extended static checking for Java. In Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), volume 37, number 5 in SIGPLAN Notices, pages 234-245. ACM, May 2002.
10. Kenneth L. McMillan. Interpolation and SAT-based model checking. In 15th International Conference on Computer Aided Verification, Lecture Notes in Computer Science. Springer, 2003.
11. Charles Gregory Nelson. Techniques for Program Verification. PhD thesis, Stanford University, 1980. Also available as Xerox PARC technical report CSL-81-10,1981.
12. Greg Nelson and Derek C. Oppen. Simplification by coorperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-57, 1979.
13. Alexandre Riazanov and Andrei Voronkov. The design and implementation of vampire. AI Commun., 15(2):91-110, 2002.
14. Lintao Zhang and Sharad Malik. Extracting small unsatisfiable cores from unsatisfiable boolean formulas. In Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), May 2003.