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

DOI10.1007/s00236-018-0324-yzbMath1421.68097arXiv1709.04382OpenAlexW2964040301WikidataQ129889860 ScholiaQ129889860MaRDI QIDQ2415375

David Monniaux

Publication date: 21 May 2019

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.04382

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Undecidability and degrees of sets of sentences (03D35) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Porous invariants ⋮ Unnamed Item

Cites Work

• Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs

This page was built for publication: On the decidability of the existence of polyhedral invariants in transition systems