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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.