Abstract

The Monniaux Problem in abstract interpretation asks, roughly speaking, whether the following question is decidable: given a program P , a safety ( e.g. , non-reachability) specification φ, and an abstract domain of invariants \(\mathcal {D} \) , does there exist an inductive invariant \(\mathcal {I} \) in \(\mathcal {D} \) guaranteeing that program P meets its specification φ. The Monniaux Problem is of course parameterised by the classes of programs and invariant domains that one considers. In this paper, we show that the Monniaux Problem is undecidable for unguarded affine programs and semilinear invariants (unions of polyhedra). Moreover, we show that decidability is recovered in the important special case of simple linear loops.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.