Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving

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

doi:10.1007/978-3-319-33693-0_22

Cited by 13 publications

(18 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consider, e.g.,, the dining philosophers with a butler solution; removing the butler leaves a deadlock prone subsystem. [3] takes the SDD approach and improves its accuracy by checking for mutual reachability of pairs of local states, and also eliminating local states and pairs of local states, where action enablement can be verified locally. These checks are formulated as a Boolean formula which is then sent to a SAT solver.…”

Section: Related Work Discussion and Further Workmentioning

confidence: 99%

“…Our resource allocation system subsumes the token based Milner scheduler [25] which is essentially a token ring with precisely one token present [3].…”

Section: Experimentationmentioning

confidence: 99%

“…Hence these criteria could fail to resolve deadlock freedom for theoretical reasons, as well as for lack of computational resources. The reason for this incompleteness is that existing criteria all characterize deadlock by the occurrence of a wait-for cycle, e.g., as stated by [3], discussion of related work:…”

Section: Introductionmentioning

confidence: 99%

“…A local deadlock occurs when a subsystem is deadlocked while the rest of the system can execute. Other criteria in the literature [2,3,13,17,21,23,24,29] guarantee only global deadlock freedom.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Global and Local Deadlock Freedom in BIP

Attie

Bensalem

Bozga

et al. 2017

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

We present a criterion for checking local and global deadlock freedom of finite state systems expressed in BIP: a component-based framework for constructing complex distributed systems. Our criterion is evaluated by model-checking a set of subsystems of the overall large system. If satisfied in small subsystems, it implies deadlock-freedom of the overall system. If not satisfied, then we re-evaluate over larger subsystems, which improves the accuracy of the check. When the subsystem being checked becomes the entire system, our criterion becomes complete for deadlock-freedom. Hence our criterion only fails to decide deadlock freedom because of computational limitations: state-space explosion sets in when the subsystems become too large. Our method thus combines the possibility of fast response together with theoretical completeness. Other criteria for deadlock freedom, in contrast, are incomplete in principle, and so may fail to decide deadlock freedom even if unlimited computational resources are available. Also, our criterion certifies freedom from local deadlock, in which a subsystem is deadlocked while the rest of the system executes. Other criteria only certify freedom from global deadlock. We present experimental results for dining philosophers and for a multi-token-based resource allocation system, which subsumes several data arbiters and schedulers, including Milner’s token-based scheduler.

show abstract

Section: Related Work Discussion and Further Workmentioning

confidence: 99%

“…Our resource allocation system subsumes the token based Milner scheduler [25] which is essentially a token ring with precisely one token present [3].…”

Section: Experimentationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Global and Local Deadlock Freedom in BIP

Attie

Bensalem

Bozga

et al. 2017

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

show abstract

“…Another classical and extremely relevant property in concurrent systems is 289 deadlock freedom. Approaches to local and compositional deadlock analysis 290 have gained significant attention in the literature, including, for instance [2,8].…”

mentioning

confidence: 99%

Compositional and local livelock analysis for CSP

Filho

Oliveira

Sampaio

et al. 2018

Information Processing Letters

View full text Add to dashboard Cite

Highlights• Livelock freedom analysis for CSP can scale using local and compositional techniques.• The approach avoids the traditional explicit state-space exploration of the system. • The strategy is based on a local analysis of the shortest event sequences (traces) that represent a recursive behaviour in the CSP model. • We provide evidence of the efficiency of the proposed approach. AbstractThe success of component-based techniques for software construction relies on trust in the emergent behaviour of the compositions. Here, we propose an efficient correct-by-construction technique for building livelock-free CSP models. Its verification conditions are based on a local analysis of the shortest event sequences (traces) that represent a recursive behaviour in the CSP model. This affords significant gains in performance in model checking. We evaluate our strategy based on models of the Milner's scheduler and the dining philosophers.or to report an inconclusive result. This approach is implemented in SLAP [9]. 13 We present a technique based on a local analysis, in which we can iden-14 tify livelock situations when compositions are being performed, predicting, by 15 construction, global property based on known local properties of the compo-16 nents [1]. Our strategy aims at reducing complexity for verifying the absence 17 of divergence, especially comparing with the approach in [9]. We illustrate our 18 technique based on models of the Milner's scheduler and the dining philosophers, 19 and show that it outperforms both FDR4 and SLAP. In cases in which livelock 20 Email address: madiel@ppgsc.ufrn.br (M. S. Conserva Filho)

show abstract

Philosophers May Dine - Definitively!

Taha

Wolff

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving

Cited by 13 publications

References 13 publications

Global and Local Deadlock Freedom in BIP

Global and Local Deadlock Freedom in BIP

Compositional and local livelock analysis for CSP

Philosophers May Dine - Definitively!

Contact Info

Product

Resources

About