A Decision Procedure for (Co)datatypes in SMT Solvers

Andrew Reynolds 1 Jasmin Blanchette 2, 3
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Datatypes and codatatypes are useful to represent finite and potentially infinite objects. We describe a decision procedure to reason about such types. The procedure has been integrated into CVC4, a modern SMT (satisfiability modulo theories) solver, which can be used both as a constraint solver and as an automatic theorem prover. An evaluation based on formalizations developed in the Isabelle proof assistant shows the potential of the procedure.
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01397082
Contributor : Jasmin Blanchette <>
Submitted on : Tuesday, November 15, 2016 - 2:15:02 PM
Last modification on : Tuesday, May 7, 2019 - 1:32:27 PM
Long-term archiving on : Thursday, March 16, 2017 - 5:23:53 PM

File

sister.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01397082, version 1

Collections

Citation

Andrew Reynolds, Jasmin Blanchette. A Decision Procedure for (Co)datatypes in SMT Solvers. IJCAI 2016, Jul 2016, New York City, United States. ⟨hal-01397082⟩

Share

Metrics

Record views

189

Files downloads

180