pith. sign in

arxiv: 1411.3790 · v1 · pith:JI2IK7TYnew · submitted 2014-11-14 · 💻 cs.LO · cs.SE

Monotonic Abstraction Techniques: from Parametric to Software Model Checking

classification 💻 cs.LO cs.SE
keywords modelcheckingtechniquesabstractiondeclarativemonotonicquantifiersoftware
0
0 comments X
read the original abstract

Monotonic abstraction is a technique introduced in model checking parameterized distributed systems in order to cope with transitions containing global conditions within guards. The technique has been re-interpreted in a declarative setting in previous papers of ours and applied to the verification of fault tolerant systems under the so-called "stopping failures" model. The declarative reinterpretation consists in logical techniques (quantifier relativizations and, especially, quantifier instantiations) making sense in a broader context. In fact, we recently showed that such techniques can over-approximate array accelerations, so that they can be employed as a meaningful (and practically effective) component of CEGAR loops in software model checking too.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.