Cooperating theorem provers: A case study combining HOL-Light and CVC Lite (2006)

Cached

Download Links

by Sean Mclaughlin , Clark Barrett , Yeting Ge
Venue:In Proc. 3 rd Workshop on Pragmatics of Decision Procedures in Automated Reasoning (PDPAR ’05), volume 144(2) of Electronic Notes in Theoretical Computer Science
Citations:23 - 2 self

Documents Related by Co-Citation

419 Z3: An Efficient SMT Solver – Leonardo De Moura, Nikolaj Bjørner - 2008
23 Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants – Pascal Fontaine, Jean-yves Marion, Stephan Merz, Leonor Prensa Nieto, Alwen Tiu, Loria Inria, Lorraine Université Nancy - 2006
724 M.: Isabelle/HOL - A Proof Assistant for HigherOrder Logic – T Nipkow, L C Paulson, Wenzel - 2002
22 Fast LCF-style Proof Reconstruction for Z3 – S Böhme, T Weber - 2010
396 Simplification by cooperating decision procedures – Greg Nelson, Derek C. Oppen - 1979
357 Simplify: A theorem prover for program checking – David Detlefs, Greg Nelson, James B. Saxe - 2003
532 PVS: A Prototype Verification System – S. Owre, J. M. Rushby, N. Shankar - 1992
44 Integrating Gandalf and HOL – Joe Hurd - 1999
173 A.: The design and implementation of VAMPIRE – A Riazanov, Voronkov - 2002
39 The UCLID Decision Procedure – Shuvendu K. Lahiri, Sanjit A. Seshia - 2004
21 A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses – M Armand, G Faure, B Grégoire, C Keller, L Théry, B Werner - 2011
17 Source-Level Proof Reconstruction for Interactive Theorem Proving – Lawrence C. Paulson, Kong Woei Susanto
23 Combining WS1S and HOL – David Basin, Stefan Friedrich - 1998
33 Lightweight relevance filtering for machine-generated resolution problems – Jia Meng, Lawrence C. Paulson - 2006
16 veriT: an open, trustable and efficient SMT-solver – Thomas Bouton, Diego Caminha, B. Oliveira, David Déharbe, Pascal Fontaine - 2009
1472 Theory of Linear and Integer Programming – A Schrijver - 1986
36 Modular Data Structure Verification – Martin C. Rinard - 2007
28 Towards efficient satisfiability checking for boolean algebra with presburger arithmetic – Viktor Kuncak - 2007
29 Solving quantified verification conditions using satisfiability modulo theories – Yeting Ge, Clark Barrett, Cesare Tinelli - 2007