Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
External Rewriting for Skeptical Proof Assistants
Journal of Automated Reasoning
Automated Proof Construction in Type Theory Using Resolution
Journal of Automated Reasoning
Using BDDs with Combinations of Theories
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
ICS: Integrated Canonizer and Solver
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
The Quest for Efficient Boolean Satisfiability Solvers
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Efficient Representation and Validation of Proofs
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Compiling with proofs
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Automation for interactive proof: first prototype
Information and Computation - Special issue: Combining logical systems
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Compressing Propositional Refutations
Electronic Notes in Theoretical Computer Science (ENTCS)
A Compressing Translation from Propositional Resolution to Natural Deduction
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Combining Proof-Producing Decision Procedures
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
LCF-Style Propositional Simplification with BDDs and SAT Solvers
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Proof Checking Technology for Satisfiability Modulo Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Data Compression for Proof Replay
Journal of Automated Reasoning
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
veriT: An Open, Trustable and Efficient SMT-Solver
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Combination of convex theories: Modularity, deduction completeness, and explanation
Journal of Symbolic Computation
HOL-Boogie--An Interactive Prover-Backend for the Verifying C Compiler
Journal of Automated Reasoning
Combined satisfiability modulo parametric theories
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Fast reflexive arithmetic tactics the linear case and beyond
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Rocket-fast proof checking for SMT solvers
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Bounded relational analysis of free data types
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Formal Correctness Proof for DPLL Procedure
Informatica
Extending Sledgehammer with SMT solvers
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Checking safety of neural networks with SMT solvers: a comparative evaluation
AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Decision procedures for the formal analysis of software
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Integrating automated and interactive protocol verification
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Combining decision procedures by (model-)equality propagation
Science of Computer Programming
Fast LCF-Style proof reconstruction for z3
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
A modular integration of SAT/SMT solvers to coq through proof witnesses
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Modular SMT proofs for fast reflexive checking inside coq
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Reconstruction of z3's bit-vector proofs in HOL4 and Isabelle/HOL
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Challenging SMT solvers to verify neural networks
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
SMT proof checking using a logical framework
Formal Methods in System Design
Foundational proof certificates in first-order logic
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Hi-index | 0.00 |
Formal system development needs expressive specification languages, but also calls for highly automated tools. These two goals are not easy to reconcile, especially if one also aims at high assurances for correctness. In this paper, we describe a combination of Isabelle/HOL with a proof-producing SMT (Satisfiability Modulo Theories) solver that contains a SAT engine and a decision procedure for quantifier-free first-order logic with equality. As a result, a user benefits from the expressiveness of Isabelle/HOL when modeling a system, but obtains much better automation for those fragments of the proofs that fall within the scope of the (automatic) SMT solver. Soundness is not compromised because all proofs are submitted to the trusted kernel of Isabelle for certification. This architecture is straightforward to extend for other interactive proof assistants and proof-producing reasoners.