Specification and Safety Verification of Parametric Hierarchical Distributed Systems

Bozga, Marius; Iosif, Radu

doi:10.1007/978-3-030-90636-8_6

Cited by 3 publications

(6 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By inspection of the formulae (1) and (2), one can show that checking the verification conditions is in 4EXPTIME, where 4 is the maximum quantifier alternation depth of these formulae. In practice, however, these checks are quite fast, as shown by the preliminary experiments performed on a similar encoding, reported in our previous work [2].…”

Section: Parametric Verification Using Structural Invariantsmentioning

confidence: 67%

“…Proving its soundness requires some tedious technical developments; nonetheless, its implementation does not suffer from the usual limitations due to state space complexity and the number of components. Experimental results show that the proposed verification method is scalable and allows proving safety in a number of non-trivial cases [2].…”

Section: Discussionmentioning

confidence: 99%

Section: Contributions Of This Workmentioning

confidence: 99%

“…The parameterized verification method presented in this paper relies on an idea reported in [2]. In addition to a complete development of the technical results, previously omitted for space reasons, here we apply the verification method to a specification language based on a resource logic, that resembles Separation Logic [3], instead of the recursive term algebra introduced in [2]. An extension of this resource logic has been recently developed for Hoare-style reasoning about the safety properties of programmed reconfiguration in distributed systems [4], to which the work presented here provides a push-button verification back-end.…”

Section: Contributions Of This Workmentioning

confidence: 99%

“…Verification of network grammars against safety properties requires the synthesis of network invariants [31], computed by rather costly fixpoint iterations [32] or by abstracting (forgetting the particular values of indices in) the composition of a small bounded number of instances [33]. Instead, our method uses lightweight structural invariants, that are synthesized with little computational effort and prove to be efficient in many practical examples [27,2].…”

Section: Path Automatamentioning

confidence: 99%

See 4 more Smart Citations

Verification of Component-based Systems with Recursive Architectures

Bozga¹,

Iosif²,

Sifakis³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We study a sound verification method for parametric component-based systems. The method uses a resource logic, a new formal specification language for distributed systems consisting of a finite yet unbounded number of components. The logic allows the description of architecture configurations coordinating instances of a finite number of types of components, by means of inductive definitions similar to the ones used to describe algebraic data types or recursive data structures. For parametric systems specified in this logic, we show that decision problems such as reaching deadlock or violating critical section are undecidable, in general. Despite this negative result, we provide for these decision problems practical semi-algorithms relying on the automatic synthesis of structural invariants allowing the proof of general safety properties. The invariants are defined using the WSκS fragment of the monadic second order logic, known to be decidable by a classical automata-logic connection, thus reducing a verification problem to checking satisfiability of a WSκS formula.

show abstract

Section: Parametric Verification Using Structural Invariantsmentioning

confidence: 67%

Section: Discussionmentioning

confidence: 99%

Section: Contributions Of This Workmentioning

confidence: 99%

Section: Contributions Of This Workmentioning

confidence: 99%

Section: Path Automatamentioning

confidence: 99%

See 3 more Smart Citations

Verification of Component-based Systems with Recursive Architectures

Bozga¹,

Iosif²,

Sifakis³

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

Verification of component-based systems with recursive architectures

Bozga¹,

Iosif²,

Sifakis³

2023

Theoretical Computer Science

View full text Add to dashboard Cite

On an Invariance Problem for Parameterized Concurrent Systems

Bozga¹,

Lucas²,

Iosif³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

We consider concurrent systems consisting of replicated finitestate processes that synchronize via joint interactions in a network with user-defined topology. The system is specified using a resource logic with a multiplicative connective and inductively defined predicates, reminiscent of Separation Logic [19]. The problem we consider is if a given formula in this logic defines an invariant, namely whether any model of the formula, following an arbitrary firing sequence of interactions, is transformed into another model of the same formula. This property, called havoc invariance, is quintessential in proving the correctness of reconfiguration programs that change the structure of the network at runtime. We show that the havoc invariance problem is many-one reducible to the entailment problem φ |= ψ, asking if any model of φ is also a model of ψ. Although, in general, havoc invariance is found to be undecidable, this reduction allows to prove that havoc invariance is in 2EXP, for a general fragment of the logic, with a 2EXP entailment problem.

show abstract

Specification and Safety Verification of Parametric Hierarchical Distributed Systems

Cited by 3 publications

References 22 publications

Verification of Component-based Systems with Recursive Architectures

Verification of Component-based Systems with Recursive Architectures

Verification of component-based systems with recursive architectures

On an Invariance Problem for Parameterized Concurrent Systems

Contact Info

Product

Resources

About