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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence |
| Subtitle of host publication | IJCAI 2016, New York, NY, USA, 9-15 July 2016 |
| Publisher | IJCAI/AAAI Press |
| Pages | 4205-4209 |
| ISBN (Print) | 978-1-57735-770-4 |
| Publication status | Published - 2016 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'A Decision Procedure for (Co)datatypes in SMT Solvers'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver