SMT Solving Modulo Tableau and Rewriting Theories

Guillaume Bury 1 Simon Cruanes 2 David Delahaye 3
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
3 MAREL - Models And Reuse Engineering, Languages
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We propose an automated theorem prover that combines an SMT solver with tableau calculus and rewriting. Tableau inference rules are used to unfold propositional content into clauses while atomic formulas are handled using satisfiability decision procedures as in traditional SMT solvers. To deal with quantified first order formulas, we use metavariables and perform rigid unification modulo equalities and rewriting, for which we introduce an algorithm based on superposition, but where all clauses contain a single atomic formula. Rewriting is introduced along the lines of deduction modulo theory, where axioms are turned into rewrite rules over both terms and propositions. Finally, we assess our approach over a benchmark of problems in the set theory of the B method.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02083232
Contributor : David Delahaye <>
Submitted on : Thursday, March 28, 2019 - 6:58:11 PM
Last modification on : Monday, July 15, 2019 - 3:03:30 PM
Long-term archiving on : Saturday, June 29, 2019 - 3:21:14 PM

File

archsat.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02083232, version 1

Citation

Guillaume Bury, Simon Cruanes, David Delahaye. SMT Solving Modulo Tableau and Rewriting Theories. SMT: Satisfiability Modulo Theories, Jul 2018, Oxford, United Kingdom. ⟨hal-02083232⟩

Share

Metrics

Record views

109

Files downloads

94