Undecidability of Inferring Linear Integer Invariants

12/03/2018

∙

We show that the problem of determining the existence of an inductive invariant in the language of quantifier free linear integer arithmetic (QFLIA) is undecidable, even for transition systems and safety properties expressed in QFLIA.

READ FULL TEXT

Undecidability of Inferring Linear Integer Invariants

Reflections on Termination of Linear Loops

When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic

Synthesising a Database of Parameterised Linear and Non-Linear Invariants for Time-Series Constraints

How to Win First-Order Safety Games

Complexity and Information in Invariant Inference

Plain and Simple Inductive Invariant Inference for Distributed Protocols in TLA+

Inferring Invariants with Quantifier Alternations: Taming the Search Space Explosion

Undecidability of Inferring Linear Integer Invariants

Related Research

Reflections on Termination of Linear Loops

When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic

Synthesising a Database of Parameterised Linear and Non-Linear Invariants for Time-Series Constraints

How to Win First-Order Safety Games

Complexity and Information in Invariant Inference

Plain and Simple Inductive Invariant Inference for Distributed Protocols in TLA+

Inferring Invariants with Quantifier Alternations: Taming the Search Space Explosion