Safety for branching time semantics

Abstract. The compositional verification approach of Graf & Steffen aims at avoiding state space explosion for individual processes of a concurrent system. It relies on interfaces that express the behavioural constraints imposed on each process by synchronization with the other processes, thus preventing the exploration of states and transitions that would not be reachable in the global state space. Krimm & Mounier, and Cheung & Kramer proposed two techniques to generate such interfaces automatically. In this paper, we propose a refined interface generation technique, in which the interface of a process is derived automatically from the examination of (a subset of) concurrent processes. This technique is applicable to formalisms in which concurrent processes are composed either using synchronization vectors or process algebra parallel composition operators (including those of Ccs, Csp, μCrl, Lotos, and E-Lotos), for which we developed a tool. Several experiments indicate state space reductions by more than two orders of magnitude for the largest processes.

Section: By Definition Of Semi-composition Q[k] T[k] − − → Q [K] Belmentioning

confidence: 94%

Section: Definition 4 (Semi-composition) Letmentioning

confidence: 99%

Refined Interfaces for Compositional Verification

Lang

2006

“…Safety properties can be represented by prefix closed finite automata on finite words [28,7]. We assume such a representation A S and proceed as follows:…”

Section: Verifying Safety Propertiesmentioning

confidence: 99%

“…Indeed, model checking can handle arbitrary temporal formulas which can represent both safety and liveness properties. Nevertheless, it has been noticed that restricting model-checking like techniques to safety properties can lead to better verification algorithms [7,8,9]. Intuitively, this can be understood by the fact that safety properties can be checked by only considering the finite behaviors of a system whereas liveness properties are only meaningful for infinite behaviors.…”

Section: Introductionmentioning

confidence: 99%

Using partial orders for the efficient verification of deadlock freedom and safety properties

Godefroid

Wolper

1992

This paper presents an algorithm for detecting deadlocks in concurrent finite-state systems without incurring most of the state explosion due to the modeling of concurrency by interleaving. For systems that have a high level of concurrency our algorithm can be much more efficient than the classical exploration of the whole state space. Finally, we show that our algorithm can also be used for verifying arbitrary safety properties.

“…This temporal logic is suitable for expressing safety properties (cf. [4]) in terms of sequences of method invocations, such as security policies restricting access to given resources by means of API method calls (cf. [19]).…”

Section: Introductionmentioning

confidence: 99%

Reducing Behavioural to Structural Properties of Programs with Procedures

Gurov

Huisman

2008

There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a program graph rather than in terms of its unfoldings is a useful strategy for making analyses more tractable. The present paper presents a characterisation of behavioural program properties through sets of structural properties by means of a translation. The characterisation is given in the context of a program model based on control flow graphs of sequential programs with procedures, and properties expressed in a fragment of the modal µ-calculus with boxes and greatest fixed-points only. The property translation is based on a tableau construction that conceptually amounts to symbolic execution of the behavioural formula, collecting structural constraints along the way. By keeping track of the subformulae that have been examined, recursion in the structural constraints can be identified and captured by fixed-point formulae. The tableau construction terminates, and the characterisation is exact, i.e. the translation is sound and complete. A prototype implementation has been developed. We discuss several applications of the characterisation, in particular sound and complete compositional verification for behavioural properties based on maximal models.