Tighter Reachability Criteria for Deadlock-Freedom Analysis

Antonino, Pedro; Gibson−Robinson, Thomas; Roscoe, A. W.

doi:10.1007/978-3-319-48989-6_3

Cited by 8 publications

(21 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For deadlock, there are works aimed at CSP that involve adherence to deadlock-free patters [2,3], with a focus on the analysis of cyclic networks of processes. Recent improvements on local deadlock analysis for CSP are reported in [1], but this work also presents an incomplete strategy. As already mentioned, we are not aware of any other approach to compositional analysis of determinism, so our work is an original contribution in this direction.…”

Section: Resultsmentioning

confidence: 99%

“…When nondeterminism is indicated, we may have found a source of nondeterminism or it may be an inconclusive result. Local approaches to the analysis of classical concurrency properties tend to give up completeness in favour of efficiency gains; see [1][2][3], for deadlock analysis, and [4], for livelock analysis.…”

Section: Examplementioning

confidence: 99%

“…Deadlock and livelock have been investigated in depth, and there are very efficient tools available [1][2][3][4][5]8]. Determinism has been less studied.…”

Section: Introductionmentioning

confidence: 99%

“…Local analysis has been adopted in verification of deadlock [1][2][3] and livelock [4]. Here, we present a local strategy for the verification of determinism in models written using a subset of CSP that includes most of its basic operators, with some restrictions on how they can be used in compositions.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Local Analysis of Determinism for CSP

Otoni

Cavalcanti

Sampaio

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Nondeterminism is an inevitable constituent of any theory that describes concurrency. For the validation and verification of concurrent systems, it is essential to investigate the presence or absence of nondeterminism, just as much as deadlock or livelock. CSP is a well established process algebra; the main tool for practical use of CSP, the model checker FDR, checks determinism using a global analysis. We propose a local analysis, in order to improve performance and scalability. Our strategy is to use a compositional approach where we start from basic deterministic processes and check whether any of the composition operators introduce nondeterminism. We present the algorithms used in our strategy and experiments that show the efficiency of our approach.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Examplementioning

confidence: 99%

“…Deadlock and livelock have been investigated in depth, and there are very efficient tools available [1][2][3][4][5]8]. Determinism has been less studied.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Local Analysis of Determinism for CSP

Otoni

Cavalcanti

Sampaio

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…2. We point out that we have studied a number of ways to effectively combine the sort of local-analysis-based approximations presented in this work with techniques deriving global invariants [AGRR16b,AGRR17a,AGRR17b] and intend to cover these in sequels to this paper.…”

mentioning

confidence: 99%

Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

2019

Self Cite

View full text Add to dashboard Cite

This work develops a type of local analysis that can prove concurrent systems deadlock free. As opposed to examining the overall behaviour of a system, local analysis consists of examining the behaviour of small parts of the system to yield a given property. We analyse pairs of interacting components to approximate system reachability and propose a new sound but incomplete/approximate framework that checks deadlock and local-deadlock freedom. By replacing exact reachability by this approximation, it looks for deadlock (or local-deadlock) candidates, namely, blocked (locally-blocked) system states that lie within our approximation. This characterisation improves on the precision of current approximate techniques. In particular, it can tackle non-hereditary deadlock-free systems, namely, deadlock-free systems that have a deadlocking subsystem. These are neglected by most approximate techniques. Furthermore, we demonstrate how SAT checkers can be used to efficiently implement our framework, which, typically, scales better than current techniques for deadlock-freedom analysis. This is demonstrated by a series of practical experiments.

show abstract