Unrolling heuristic for recursive functions is complete for first-order theories of algebraic datatypes combined with decidable quantifier-free background theories.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
Case study shows that CHC transformations eliminating inductive data structures enable effective verification of partial correctness and arithmetic properties for several sorting algorithms using existing solvers.
citing papers explorer
-
Complete first-order reasoning for functional programs
Unrolling heuristic for recursive functions is complete for first-order theories of algebraic datatypes combined with decidable quantifier-free background theories.
-
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification
Case study shows that CHC transformations eliminating inductive data structures enable effective verification of partial correctness and arithmetic properties for several sorting algorithms using existing solvers.