On the decidability of the existence of polyhedral invariants in transition systems

Abstract

Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties. For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear (in)equalities. Forty years of research on convex polyhedral invariants have focused, on the one hand, on identifying “easier… (More)

Topics

Cite this paper

@article{Monniaux2017OnTD, title={On the decidability of the existence of polyhedral invariants in transition systems}, author={David Monniaux}, journal={CoRR}, year={2017}, volume={abs/1709.04382} }