Lightweight integration of the Ergo theorem prover inside a proof assistant

AFM'07: 2nd Workshop on Automated Formal Methods

Volumn , Issue , 2007, Pages 55-59

  Conchon, Sylvain ^a,b   Contejean, Evelyne ^a,b   Kanig, Johannes ^a,b   Lescuyer, Stéphane ^a,b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CORE COMPONENTS; ERGO THEOREM PROVER; JAVA PROGRAM; PARAMETERIZED; PROGRAM VERIFICATION; PROOF ASSISTANT;

ATOMIC FORCE MICROSCOPY; COMPUTER SOFTWARE; FORMAL LOGIC; FORMAL METHODS; JAVA PROGRAMMING LANGUAGE;

THEOREM PROVING;

EID: 77954566336     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1345169.1345176     Document Type: Conference Paper

References (19)

1. The A3PAT Project. http://www3.iie.cnam.fr/~urbain/a3pat/.
2. N. Ayache and J.-C. Filliâtre. Combining the Coq Proof Assistant with First-Order Decision Procedures. Unpublished, March 2006.
3. C. Barrett and C. Tinelli. Cvc3. In W. Damm and H. Hermanns, editors, Proceedings of the 19th International Conference on Computer Aided Verification (CAV'07), Berlin, Germany, Lecture Notes in Computer Science. Springer, 2007.
4. S. Conchon and E. Contejean. The Ergo automatic theorem prover. http://ergo.lri.fr/.
5. S. Conchon, E. Contejean, and J. Kanig. CC(X): Efficiently Combining Equality and Solvable Theories without Canonizers. In S. Krstic and A. Oliveras, editors, SMT 2007: 5th International Workshop on Satisfiability Modulo, 2007.
6. S. Conchon and J.-C. Filliâtre. Type-Safe Modular Hash-Consing. In ACM SIGPLAN Workshop on ML, Portland, Oregon, Sept. 2006.
7. S. Conchon and J.-C. Filliâtre. Semi-Persistent Data Structures. Research Report 1474, LRI, Université Paris Sud, September 2007.
8. J.-F. Couchot and S. Lescuyer. Handling polymorphism in automated deduction. In 21th International Conference on Automated Deduction (CADE-21), volume 4603 of LNCS (LNAI), pages 263-278, Bremen, Germany, July 2007.
9. L. de Moura and N. Bjørner. Z3, An Efficient SMT Solver. http://research.microsoft.com/projects/z3/.
10. L. de Moura and B. Dutertre. Yices: An SMT Solver. http://yices.csl.sri. com/.
11. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a theorem prover for program checking. J. ACM, 52(3):365-473, 2005.
12. J.-C. Filliâtre. Preuve de programmes impératifs en théorie des types. PhD thesis, Université Paris-Sud, July 1999.
13. J.-C. Filliâtre. Verification of non-functional programs using interpretations in type theory. 13(4):709-745, July 2003. [English translation of [12]].
14. J.-C. Filliâtre and C. Marché. The Why/Krakatoa/Caduceus platform for deductive program verification.
15. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Programming, Languages and Systems, 1(2):245-257, Oct. 1979.
16. ProVal Project. Why Benchmarks. http://proval.lri.fr/why-benchmarks/.
17. S. Ranise and C. Tinelli. The Satisfiability Modulo Theories Library (SMT-LIB). http://www.SMT-LIB.org, 2006.
18. H. Rueß and N. Shankar. Deconstructing Shostak. In LICS '01: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, page 19, Washington, DC, USA, 2001. IEEE Computer Society.
19. R. E. Shostak. Deciding combinations of theories. J. ACM, 31:1-12, 1984.