Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs

Attie, Paul C.; Chockler, Hana

doi:10.1007/978-3-540-30579-8_30

Cited by 21 publications

(19 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We generalize previous works [2][3][4] by removing the requirement that interaction between processes be expressed pairwise, and also by applying to BIP [6], a framework from which efficient distributed code can be generated. In contrast, the model of concurrency in [2][3][4] requires shared memory read-modify-write operations with a large grain of atomicity.…”

Section: Introductionmentioning

confidence: 99%

An Abstract Framework for Deadlock Prevention in BIP

Attie

Bensalem

Bozga

et al. 2013

Formal Techniques for Distributed Systems

Self Cite

View full text Add to dashboard Cite

Abstract. We present a sound but incomplete criterion for checking deadlock freedom of finite state systems expressed in BIP: a componentbased framework for the construction of complex distributed systems. Since deciding deadlock-freedom for finite-state concurrent systems is PSPACE-complete, our criterion gives up completeness in return for tractability of evaluation. Our criterion can be evaluated by modelchecking subsystems of the overall large system. The size of these subsystems depends only on the local topology of direct interaction between components, and not on the number of components in the overall system. We present two experiments, in which our method compares favorably with existing approaches. For example, in verifying deadlock freedom of dining philosphers, our method shows linear increase in computation time with the number of philosophers, whereas other methods (even those that use abstraction) show super-linear increase, due to state-explosion.

show abstract

Section: Introductionmentioning

confidence: 99%

An Abstract Framework for Deadlock Prevention in BIP

Attie

Bensalem

Bozga

et al. 2013

Formal Techniques for Distributed Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [7] one can find a condition that ensures the deadlock-freedom of a component based system consisting of two components. In [4] a condition for deadlock-freedom in a strictly interleaving setting of processes that communicate over shared variables is presented. Interface automata [10] have been introduced as a means to specify component interfaces with behavioral types.…”

Section: Discussion and Related Workmentioning

confidence: 99%

An Approach to Modelling and Verification of Component Based Systems

Gößler

Graf

Majster-Cederbaum

et al. 2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…A A respectively liveness without A A is at least as hard. One way to deal with the complexity issue for properties is to establish conditions that ensure a desired property and can be tested more easily, see for example [22,18,19,26]. In this paper we want to explain how one can systematically use such conditions to obtain results in the case of failure of A .…”

Section: Testing Robustnessmentioning

confidence: 99%

Robustness in Interaction Systems

Majster-Cederbaum

Martens

2007

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.We treat the effect of absence/failure of ports or components on properties of component-based systems. We do so in the framework of interaction systems, a formalism for component-based systems that strictly separates the issues of local behavior and interaction, for which ideas to establish properties of systems were developed. We propose how to adapt these ideas to analyze how the properties behave under absence or failure of certain components or merely some ports of components. We demonstrate our approach for the properties local and global deadlockfreedom as well as liveness and local progress.

show abstract

Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs

Cited by 21 publications

References 17 publications

An Abstract Framework for Deadlock Prevention in BIP

An Abstract Framework for Deadlock Prevention in BIP

An Approach to Modelling and Verification of Component Based Systems

Robustness in Interaction Systems

Contact Info

Product

Resources

About