Decidability of Parameterized Verification

Bloem, Roderick; Jacobs, Swen; AyratKhalimov,; Konnov, Igor; SashaRubin,; HelmutVeith,; JosefWidder,

doi:10.2200/s00658ed1v01y201508dct013

Cited by 50 publications

(36 citation statements)

References 85 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Our logic is proved sufficient to model several complex architectures. This is important because parametric systems based on well-defined architectures satisfy most of their requirements [4,9].…”

Section: Parametric Component-based Systemsmentioning

confidence: 99%

“…Parametric systems represent a wide class of component-based systems including communication protocols and concurrent and distributed algorithms [1,9,17]. Parametric systems are constructed by a finite number of component types each consisting of an unknown number of instances [4,9]. We address the problem of modelling the ordering restrictions for the components' connections, an important aspect of several parametric architectures, including Publish/Subscribe and Request/Response [15,38].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Architecture Modelling of Parametric Component-Based Systems

Pittou

Rahonis²

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We study formal modelling of architectures applied on parametric component-based systems consisting of an unknown number of instances of each component. Architecture modelling is achieved by means of logics. We introduce an extended propositional interaction logic and investigate its first-order level which serves as a formal language for the interactions of parametric systems. Our logic effectively describes the execution order of interactions which is a main feature in several important architectures. We state the decidability of equivalence, satisfiability, and validity of first-order extended interaction logic formulas, and provide several examples of formulas describing well-known architectures.

show abstract

Section: Parametric Component-based Systemsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Architecture Modelling of Parametric Component-Based Systems

Pittou

Rahonis²

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…First, we should study architectures as parametric behavior transformers and develop basic results for checking their correctness. Existing results on parametric verification put emphasis on limitations (e) Self-organising architecture Figure 5: Classification of architectures [6,15]. The parametric verification of very simple parametric systems, even with finite-state components, is intractable.…”

Section: Architecture Complexity -Self-organizing Architecturesmentioning

confidence: 99%

System Design in the Era of IoT — Meeting the Autonomy Challenge

Sifakis

2018

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The advent of IoT is a great opportunity to reinvigorate Computing by focusing on autonomous system design. This certainly raises technology questions but, more importantly, it requires building new foundation that will systematically integrate the innovative results needed to face increasing environment and mission complexity.A key idea is to compensate the lack of human intervention by adaptive control. This is instrumental for system resilience: it allows both coping with uncertainty and managing mixed criticality services. Our proposal for knowledge-based design seeks a compromise: preserving rigorousness despite the fact that essential properties cannot be guaranteed at design time. It makes knowledge generation and application a primary concern and aims to fully and seamlessly incorporate the adaptive control paradigm in system architecture.

show abstract

“…The work in [Bloem et al 2015;Konnov et al 2017Konnov et al , 2015a addresses the problem of verifying liveness by using a restricted language, the formalism of Threshold Automata, for specifying distributed algorithms operating in a partially synchronous communication mode. This restriction allows them to derive decision procedures based on cutoff theorems, both for safety and liveness.…”

Section: Related Workmentioning

confidence: 99%

Reducing liveness to safety in first-order logic

Padon

Hoenicke

Losa

et al. 2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We develop a new technique for verifying temporal properties of infinite-state (distributed) systems. The main idea is to reduce the temporal verification problem to the problem of verifying the safety of infinite-state systems expressed in first-order logic. This allows to leverage existing techniques for safety verification to verify temporal properties of interesting distributed protocols, including some that have not been mechanically verified before. We model infinite-state systems using first-order logic, and use first-order temporal logic (FO-LTL) to specify temporal properties. This general formalism allows to naturally model distributed systems, while supporting both unbounded-parallelism (where the system is allowed to dynamically create processes), and infinite-state per process. The traditional approach for verifying temporal properties of infinite-state systems employs well-founded relations (e.g. using linear arithmetic ranking functions). In contrast, our approach is based the idea of fair cycle detection. In finite-state systems, temporal verification can always be reduced to fair cycle detection (a system contains a fair cycle if it revisits a state after satisfying all fairness constraints). However, with both infinitely many states and infinitely many fairness constraints, a straightforward reduction to fair cycle detection is unsound. To regain soundness, we augment the infinite-state transition system by a dynamically computed finite set, that exploits the locality of transitions. This set lets us define a form of fair cycle detection that is sound in the presence of both infinitely many states, and infinitely many fairness constraints. Our approach allows a new style of temporal verification that does not explicitly involve ranking functions. This fits well with pure first-order verification which does not explicitly reason about numerical values. In particular, it can be used with effectively propositional first-order logic (EPR), in which case checking verification conditions is decidable. We applied our technique to verify temporal properties of several interesting protocols. To the best of our knowledge, we have obtained the first mechanized liveness proof for both TLB Shootdown, and Stoppable Paxos. CCS Concepts: • Theory of computation → Logic and verification; Modal and temporal logics; • Software and its engineering → Formal methods;

show abstract

Decidability of Parameterized Verification

Cited by 50 publications

References 85 publications

Architecture Modelling of Parametric Component-Based Systems

Architecture Modelling of Parametric Component-Based Systems

System Design in the Era of IoT — Meeting the Autonomy Challenge

Reducing liveness to safety in first-order logic

Contact Info

Product

Resources

About