Verification by Network Decomposition

Clarke, Edmund M.; Talupur, Muralidhar; Touili, Tayssir; Veith, Helmut

doi:10.1007/978-3-540-28644-8_18

Cited by 63 publications

(76 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Intuitively, dining philosophers requires us to trace indexed processes along a computation, e.g., ∀i. G (hungry i → (F eating i )), and thus to employ indexed temporal logics for specifications [7,11,12,14].…”

Section: Threshold-guarded Distributed Algorithmsmentioning

confidence: 99%

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms

John

Konnov

Schmid

et al. 2013

Model Checking Software

Self Cite

View full text Add to dashboard Cite

Abstract. Fault-tolerant distributed algorithms are central for building reliable, spatially distributed systems. In order to ensure that these algorithms actually make systems more reliable, we must ensure that these algorithms are actually correct. Unfortunately, model checking state-ofthe-art fault-tolerant distributed algorithms (such as Paxos) is currently out of reach except for very small systems. In order to be eventually able to automatically verify such fault-tolerant distributed algorithms also in larger systems, several problems have to be addressed. In this paper, we consider modeling and verification of fault-tolerant algorithms that basically only contain threshold guards to control the flow of the algorithm. As threshold guards are widely used in fault-tolerant distributed algorithms (and also in Paxos) efficient methods to handle them bring us closer to the above mentioned goal. As case study we use the reliable broadcasting algorithm by Srikanth and Toueg that tolerates even Byzantine faults. We show how one can model this basic fault-tolerant distributed algorithm in Promela such that safety and liveness properties can be efficiently verified in Spin. We provide experimental data also for other distributed algorithms.

show abstract

Section: Threshold-guarded Distributed Algorithmsmentioning

confidence: 99%

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms

John

Konnov

Schmid

et al. 2013

Model Checking Software

Self Cite

View full text Add to dashboard Cite

show abstract

“…As previously discussed, this work draws on and generalizes the work in [36] on pairwise rendezvous on cliques, the work in [24] on disjunctive guards on cliques, and the work in [2,16,28] on token-passing systems. There are very few published complexity lower-bounds for PMCP (notable exceptions are [30,48]), and to the best of our knowledge, our lower bounds on the sizes of cutoffs are the first proven non-trivial lower bounds for these types of systems.…”

Section: Discussion and Related Workmentioning

confidence: 99%

“…Often, it is proved decidable by a reduction to model checking finitely many finite-state systems [2,16,24,28,36]. In many of these cases it is even possible to reduce the problem of whether a parameterized system satisfies a temporal specification for any number of processes to the same problem for systems with at most c processes.…”

Section: Introductionmentioning

confidence: 99%

“…In many of these cases it is even possible to reduce the problem of whether a parameterized system satisfies a temporal specification for any number of processes to the same problem for systems with at most c processes. In fact, it is usually of interest to find such a number c that works for every specification formula of a given temporal logic [2,10,16,26,28]. Such a number is known as a cutoff for the given parameterized system.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Parameterized model checking of rendezvous systems

et al. 2017

Self Cite

View full text Add to dashboard Cite

Parameterized model checking is the problem of deciding if a given formula holds irrespective of the number of participating processes. A standard approach for solving the parameterized model checking problem is to reduce it to model checking finitely many finite-state systems. This work considers the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable formulas and graph operations. First, we settle the exact computational complexity of the parameterized model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases where model checking the parameterized system can be reduced to model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the parameterized system is equivalent to a single finite-state system (more precisely a Büchi word automaton), and establish tight bounds on the sizes of such automata.

show abstract

“…Many approaches to this problem have been developed over the years, including the use of symbolic automata-based techniques, network invariants, predicate abstraction or system symmetry (see an excellent overview in [CTTV04]). Methods that are most closely related to our work are based on abstraction (for example, an extension of Murφ uses abstraction for replicated identical components [ID96]).…”

Section: Related Workmentioning

confidence: 99%

A model checking-based approach for security policy verification of mobile systems

2011

View full text Add to dashboard Cite

This article describes an approach for the automated verification of mobile systems. Mobile systems are characterized by the explicit notion of location (e.g., sites where they run) and the ability to execute at different locations, yielding a number of security issues. To this aim, we formalize mobile systems as Labeled Kripke Structures, encapsulating the notion of location net that describes the hierarchical nesting of the threads constituting the system. Then, we formalize a generic security-policy specification language that includes rules for expressing and manipulating the code location. In contrast to many other approaches, our technique supports both access control and information flow specification. We developed a prototype framework for model checking of mobile systems. It works directly on the program code (in contrast to most traditional process-algebraic approaches that can model only limited details of mobile systems) and uses abstraction-refinement techniques, based also on location abstractions, to manage the program state space. We experimented with a number of mobile code benchmarks by verifying various security policies. The experimental results demonstrate the validity of the proposed mobile system modeling and policy specification formalisms and highlight the advantages of the model checking-based approach, which combines the validation of security properties with other checks, such as the validation of buffer overflows.

show abstract

Verification by Network Decomposition

Cited by 63 publications

References 24 publications

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms

Parameterized model checking of rendezvous systems

A model checking-based approach for security policy verification of mobile systems

Contact Info

Product

Resources

About