An Abstract Decision Procedure for a Theory of Inductive Data Types
Open Access
- 1 July 2007
- journal article
- Published by SAGE Publications in Journal on Satisfiability, Boolean Modeling and Computation
- Vol. 3 (1-2) , 21-46
Abstract
Inductive data types are a valuable modeling tool for software verification. In the past, decision procedures have been proposed for various theories of inductive data types, some focused on the universal fragment, and some focused on handling arbitrKeywords
This publication has 6 references indexed in Scilit:
- Abstract Congruence ClosureJournal of Automated Reasoning, 2003
- A decision procedure for term algebras with queuesACM Transactions on Computational Logic, 2001
- Decidability of the purely existential fragment of the theory of term algebrasJournal of the ACM, 1987
- Reasoning About Recursively Defined Data StructuresJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979