Modular Abstractions of Reactive Nodes using Disjunctive Invariants

David Monniaux (1) , Martin Bodin (2, 1)

1 VERIMAG - IMAG - VERIMAG
2 DI - Département d'informatique

We wish to abstract nodes in a reactive programming language, such as Lustre, into nodes with a simpler control structure, with a bound on the number of control states. In order to do so, we compute disjunctive invariants in predicate abstraction, with a bounded number of disjuncts, then we abstract the node, each disjunct representing an abstract state. The computation of the disjunctive invariant is performed by a form of quantifier elimination expressed using SMT-solving. The same method can also be used to obtain disjunctive loop invariants.

Mots clés: synchronous programming language; loop invariant; SMT-solving

Domaines: Langage de programmation [cs.PL]; Logique en informatique [cs.LO]

David Monniaux, Martin Bodin. Modular Abstractions of Reactive Nodes using Disjunctive Invariants. Asian symposium on programming languages and systems (APLAS), Dec 2011, Kenting, Taiwan. pp.19-33, ⟨10.1007/978-3-642-25318-8_5⟩. ⟨hal-00620682⟩