Certificates for Parameterized Model Checking

Conchon, Sylvain; Mebsout, Alain; Zaïdi, Fatiha

doi:10.1007/978-3-319-19249-9_9

Cited by 11 publications

(8 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All in all, the present contribution is deeply rooted in the long-standing tradition of the application of model theory in computer science, as witnessed by notable approaches like the one in Ghilardi (2004), Baader et al (2006), Ghilardi et al (2008b), Ghilardi and van Gool (2017), Nicolini et al (2009aNicolini et al ( ,b, 2010, Sofronie-Stokkermans (2008, 2016, Ghilardi andGianola (2017, 2018). In particular, this paper applies these ideas in a genuinely novel mathematical context and shows how these techniques can be used for the first time to empower algorithmic techniques for the verification of infinite-state systems based on arrays in the style of Ghilardi et al (2008a), Ghilardi and Ranise (2010a,b), Alberti et al (2014aAlberti et al ( ,b, 2017, Conchon et al (2012Conchon et al ( , 2015Conchon et al ( , 2018a, Delzanno (2018), Cimatti et al (2018), so as to make such techniques applicable to the timely, challenging settings of data-aware processes (Calvanese et al 2019d). For an explicit linking between the use of model completeness in computer science and our application to verification, see in particular the survey (Calvanese et al 2019b).…”

Section: Main Contributionsmentioning

confidence: 99%

“…Starting from its first version (Ghilardi and Ranise 2010b), MCMT was successfully applied to cache coherence and mutual exclusions protocols (Ghilardi and Ranise 2010a), timed (Carioni et al 2010), and fault-tolerant (Alberti et al 2010(Alberti et al , 2012b distributed systems, and then to imperative programs (Alberti et al 2014b(Alberti et al , 2017; interesting case studies concerned waiting time bounds synthesis in parameterized timed networks (Bruttomesso et al 2012) and internet protocols (Bruschi et al 2017). Further related tools include SAFARI (Alberti et al 2012a) and ASASP (Alberti et al 2011); finally, Conchon et al (2012Conchon et al ( , 2013Conchon et al ( , 2015Conchon et al ( , 2018a implement the array-based setting on a parallel architecture with further powerful extensions.…”

Section: First Experimentsmentioning

confidence: 99%

See 1 more Smart Citation

SMT-based verification of data-aware processes: a model-theoretic approach

Calvanese

Ghilardi

Gianola

et al. 2020

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

In recent times, satisfiability modulo theories (SMT) techniques gained increasing attention and obtained remarkable success in model-checking infinite-state systems. Still, we believe that whenever more expressivity is needed in order to specify the systems to be verified, more and more support is needed from mathematical logic and model theory. This is the case of the applications considered in this paper: we study verification over a general model of relational, data-aware processes, to assess (parameterized) safety properties irrespectively of the initial database (DB) instance. Toward this goal, we take inspiration from array-based systems and tackle safety algorithmically via backward reachability. To enable the adoption of this technique in our rich setting, we make use of the model-theoretic machinery of model completion, which surprisingly turns out to be an effective tool for verification of relational systems and represents the main original contribution of this paper. In this way, we pursue a twofold purpose. On the one hand, we isolate three notable classes for which backward reachability terminates, in turn witnessing decidability. Two of such classes relate our approach to conditions singled out in the literature, whereas the third one is genuinely novel. On the other hand, we are able to exploit SMT technology in implementations, building on the well-known MCMT (Model Checker Modulo Theories) model checker for array-based systems and extending it to make all our foundational results fully operational. All in all, the present contribution is deeply rooted in the long-standing tradition of the application of model theory in computer science. In particular, this paper applies these ideas in an original mathematical context and shows how these techniques can be used for the first time to empower algorithmic techniques for the verification of infinite-state systems based on arrays, so as to make such techniques applicable to the timely, challenging settings of data-aware processes.

show abstract

Section: Main Contributionsmentioning

confidence: 99%

Section: First Experimentsmentioning

confidence: 99%

SMT-based verification of data-aware processes: a model-theoretic approach

Calvanese

Ghilardi

Gianola

et al. 2020

Math. Struct. Comp. Sci.

View full text Add to dashboard Cite

show abstract

“…8 We believe that the fact that we can easily produce proof obligations that can be independently checked is another strength of our approach. This is in contrast to the approach of Cubicle, where generating proof obligations is nontrivial [9].…”

Section: Experimental Evaluationmentioning

confidence: 91%

Universal Invariant Checking of Parametric Systems with Quantifier-free SMT Reasoning

Cimatti

Griggio

Redondi

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The problem of invariant checking in parametric systems – which are required to operate correctly regardless of the number and connections of their components – is gaining increasing importance in various sectors, such as communication protocols and control software. Such systems are typically modeled using quantified formulae, describing the behaviour of an unbounded number of (identical) components, and their automatic verification often relies on the use of decidable fragments of first-order logic in order to effectively deal with the challenges of quantified reasoning.In this paper, we propose a fully automatic technique for invariant checking of parametric systems which does not rely on quantified reasoning. Parametric systems are modeled with array-based transition systems, and our method iteratively constructs a quantifier-free abstraction by analyzing, with SMT-based invariant checking algorithms for non-parametric systems, increasingly-larger finite instances of the parametric system. Depending on the verification result in the concrete instance, the abstraction is automatically refined by leveraging canditate lemmas from inductive invariants, or by discarding previously computed lemmas.We implemented the method using a quantifier-free SMT-based IC3 as underlying verification engine. Our experimental evaluation demonstrates that the approach is competitive with the state of the art, solving several benchmarks that are out of reach for other tools.

show abstract

“…We will extend the specification to incorporate component behavior and more complex interactions, as well as more general properties. Finally, we are interested in generating certifying proofs for the safe DPAs, possibly exploiting the existing automatic generation of proofs for array-based transition systems [14].…”

Section: Discussionmentioning

confidence: 99%

Formal Specification and Verification of Dynamic Parametrized Architectures

Cimatti¹,

Stojic²,

Tonetta³

2018

Formal Methods

View full text Add to dashboard Cite

Abstract. We propose a novel approach to the formal specification and verification of dynamic architectures that are at the core of adaptive systems such as critical infrastructure protection. Key features include run-time reconfiguration based on adding and removing components and connections, resulting in systems with unbounded number of components. We provide a logic-based specification of a Dynamic Parametrized Architecture (DPA), where parameters represent the infinite-state space of possible configurations, and first-order formulas represent the sets of initial configurations and reconfiguration transitions. We encode information flow properties as reachability problems of such DPAs, define a translation into an array-based transition system, and use a Satisfiability Modulo Theories (SMT)-based model checker to tackle a number of case studies.

show abstract

Certificates for Parameterized Model Checking

Cited by 11 publications

References 24 publications

SMT-based verification of data-aware processes: a model-theoretic approach

SMT-based verification of data-aware processes: a model-theoretic approach

Universal Invariant Checking of Parametric Systems with Quantifier-free SMT Reasoning

Formal Specification and Verification of Dynamic Parametrized Architectures

Contact Info

Product

Resources

About