Proving termination of imperative programs using Max-SMT

@article{Larraz2013ProvingTO,
  title={Proving termination of imperative programs using Max-SMT},
  author={Daniel Larraz and Albert Oliveras and Enric Rodr{\'i}guez-Carbonell and Albert Rubio},
  journal={2013 Formal Methods in Computer-Aided Design},
  year={2013},
  pages={218-225}
}
We show how Max-SMT can be exploited in constraint-based program termination proving. Thanks to expressing the generation of a ranking function as a Max-SMT optimization problem where constraints are assigned different weights, quasi-ranking functions -functions that almost satisfy all conditions for ensuring well-foundedness- are produced in a lack of… CONTINUE READING