Invariant Inference With Provable Complexity From the Monotone Theory

by   Yotam M. Y. Feldman, et al.

Invariant inference algorithms such as interpolation-based inference and IC3/PDR show that it is feasible, in practice, to find inductive invariants for many interesting systems, but non-trivial upper bounds on the computational complexity of such algorithms are scarce, and limited to simple syntactic forms of invariants. In this paper we achieve invariant inference algorithms, in the domain of propositional transition systems, with provable upper bounds on the number of SAT calls. We do this by building on the monotone theory, developed by Bshouty for exact learning Boolean formulas. We prove results for two invariant inference frameworks: (i) model-based interpolation, where we show an algorithm that, under certain conditions about reachability, efficiently infers invariants when they have both short CNF and DNF representations (transcending previous results about monotone invariants); and (ii) abstract interpretation in a domain based on the monotone theory that was previously studied in relation to property-directed reachability, where we propose an efficient implementation of the best abstract transformer, leading to overall complexity bounds on the number of SAT calls. These results build on a novel procedure for computing least monotone overapproximations.


page 1

page 2

page 3

page 4


Property-Directed Reachability as Abstract Interpretation in the Monotone Theory

Inferring inductive invariants is one of the main challenges of formal v...

Learning the Boundary of Inductive Invariants

We study the complexity of invariant inference and its connections to ex...

Complexity and Information in Invariant Inference

This paper addresses the complexity of SAT-based invariant inference, a ...

On the Monniaux Problem in Abstract Interpretation

The Monniaux Problem in abstract interpretation asks, roughly speaking, ...

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

We present a new technique for automatically inferring inductive invaria...

Confluence of CHR revisited: invariants and modulo equivalence

Abstract simulation of one transition system by another is introduced as...

Fixpoint Theory – Upside Down

Knaster-Tarski's theorem, characterising the greatest fixpoint of a mono...

Please sign up or login with your details

Forgot password? Click here to reset