2000 character limit reached
The existence of polyhedral invariants is undecidable for linear systems
Published 25 Sep 2026 in cs.LO | (2609.31146v1)
Abstract: The existence of polyhedral inductive invariants suitable for proving that a given control location is unreachable is undecidable for programs using only linear arithmetic over Z or Q, by reduction from 2-counter machines.
Paper Prompts
Sign up for free to create and run prompts on this paper.