• Home
  • Search
  • Deciding and Interpolating Algebraic Data Types by Reduction
  • Cite Icon18
  • https://doi.org/10.1109/synasc.2017.00033Copy DOI Icon

Deciding and Interpolating Algebraic Data Types by Reduction

  • Sep 1, 2017
  • Hossein Hojjat +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Recursive algebraic data types (term algebras, ADTs) are one of the most well-studied theories in logic, and find application in contexts including functional programming, modelling languages, proof assistants, and verification. At this point, several state-of-the-art theorem provers and SMT solvers include tailor-made decision procedures for ADTs, and version~2.6 of the SMT-LIB standard includes support for ADTs. We study an extremely simple approach to decide satisfiability of ADT constraints, the reduction of ADT constraints to equisatisfiable constraints over uninterpreted functions (EUF) and linear integer arithmetic (LIA). We show that the reduction approach gives rise to both decision and Craig interpolation procedures in (extensions of) ADTs.

Similar Papers
  • Conference Article

Formally verified complete quantifier instatiation strategy for the theory of bounded linear integer arithmetic

  • Dec 01, 2020
  • Rafael Sadykov +1
  • PDF
  • Research Article
  • Citations8

A Formalization of Core Why3 in Coq

  • Jan 02, 2024
  • Proceedings of the ACM on Programming Languages
  • Joshua M Cohen +1
  • Research Article

Certified Decision Procedures for Width-Independent Bitvector Predicates

  • Oct 09, 2025
  • Proceedings of the ACM on Programming Languages
  • Siddharth Bhat +3
  • Book Chapter
  • Citations252

Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions

  • Jan 01, 2002
  • Randal E Bryant +2
  • Research Article
  • Citations1

BAIT: Benchmarking (Embedding) Architectures for Interactive Theorem-Proving

  • Mar 24, 2024
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Sean Lamont +4
  • Research Article

Formalization of mathematics through proof assistants

  • Jan 14, 2019
  • Revista dos Trabalhos de Iniciação Científica da UNICAMP
  • Henrique Yuji Rossetti Inonhe +1
  • Book Chapter
  • Citations44

Integrating Automated and Interactive Theorem Proving

  • Jan 01, 1998
  • Ahrendt +6
  • Book Chapter
  • Citations13

Integrating an Automated Theorem Prover into Agda

  • Jan 01, 2011
  • Simon Foster +1
  • Book Chapter
  • Citations1

A Distributed and Trusted Web of Formal Proofs

  • Dec 09, 2019
  • Dale Miller
  • Research Article
  • Citations20

Finite satisfiability of integrity constraints in object-oriented database schemas

  • Jan 01, 2002
  • IEEE Transactions on Knowledge and Data Engineering
  • A Formica
  • Journal Issue
  • Citations1

Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers

  • Dec 21, 2010
  • Electronic Proceedings in Theoretical Computer Science
  • Ana Bove +2
  • Research Article
  • Citations4

VeriML

  • Sep 27, 2010
  • ACM SIGPLAN Notices
  • Antonis Stampoulis +1
  • Research Article
  • Citations75

MathSAT: Tight Integration of SAT and Mathematical Decision Procedures

  • Oct 01, 2005
  • Journal of Automated Reasoning
  • Marco Bozzano +6
  • Conference Article
  • Citations3

A Refinement Method for Validity Checking of Quantified First-Order Formulas in Hardware Verification

  • Nov 01, 2006
  • Husam Abu-Haimed +2
  • Research Article
  • Citations6

Verified AIG Algorithms in ACL2

  • Apr 26, 2013
  • Electronic Proceedings in Theoretical Computer Science
  • Jared Davis +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.