Atomicity refinement and trace reduction theorems

Gribomont, E. Pascal

doi:10.1007/3-540-61474-5_79

Cited by 5 publications

(3 citation statements)

References 27 publications

(24 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lipton's reduction was refined multiple times [39,21,7,6,45]. Flanagan et al [11,15] and Qadeer et al [14,16,13] have most recently developed transactions and found various applications.…”

Section: Related Workmentioning

confidence: 99%

Stubborn Transaction Reduction

Laarman

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The exponential explosion of parallel interleavings remains a fundamental challenge to model checking of concurrent programs. Both partial-order reduction (POR) and transaction reduction (TR) decrease the number of interleavings in a concurrent system. Unlike POR, transactions also reduce the number of intermediate states. Modern POR techniques, on the other hand, offer more dynamic ways of identifying commutative behavior, a crucial task for obtaining good reductions. We show that transaction reduction can use the same dynamic commutativity as found in stubborn set POR. We also compare reductions obtained by POR and TR, demonstrating with several examples that these techniques complement each other. With an implementation of the dynamic transactions in the model checker LTSmin, we compare its effectiveness with the original static TR and two POR approaches. Several inputs, including realistic case studies, demonstrate that the new dynamic TR can surpass POR in practice. α1

show abstract

“…Lipton's reduction was refined multiple times [39,21,7,6,45]. Flanagan et al [11,15] and Qadeer et al [14,16,13] have most recently developed transactions and found various applications.…”

Section: Related Workmentioning

confidence: 99%

Stubborn Transaction Reduction

Laarman

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Lipton's reduction was refined multiple times [31,20,13,11,40]. It has recently been applied in the context of compositional verification [39].…”

Section: Related Workmentioning

confidence: 99%

Dynamic Reductions for Model Checking Concurrent Software

Günther

Laarman

Sokolova

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Symbolic model checking of parallel programs stands and falls with effective methods of dealing with the explosion of interleavings. We propose a dynamic reduction technique to avoid unnecessary interleavings. By extending Lipton's original work with a notion of bisimilarity, we accommodate dynamic transactions, and thereby reduce dependence on the accuracy of static analysis, which is a severe bottleneck in other reduction techniques. The combination of symbolic model checking and dynamic reduction techniques has proven to be challenging in the past. Our generic reduction theorem nonetheless enables us to derive an efficient symbolic encoding, which we implemented for IC3 and BMC. The experiments demonstrate the power of dynamic reduction on several case studies and a large set of SVCOMP benchmarks.

show abstract

“…These works have been extended by Doeppner, Schneider, Cohen and Lamport for different formalisms or different properties [Doe77,LS89,Gri96,CL98]. More recently, Freund, Qadeer and Flanagan [FQ03b,FQ03c,FQ03a] leveraged the Lipton's theory to detect transactions in multithreaded programs (and consider these transactions as atomic in the verification process).…”

Section: Introductionmentioning

confidence: 99%

New Efficient Petri Nets Reductions for Parallel Programs Verification

Haddad

Pradat-Peyre

2006

Parallel Process. Lett.

View full text Add to dashboard Cite

Structural model abstraction is a powerful technique for reducing the complexity of a state based enumeration analysis. We present in this paper new efficient Petri nets reductions. First, we define "behavioural" reductions (i.e. based on conditions related to the language of the net) which preserve a fundamental property of a net (i.e. liveness) and any formula of the (action-based) linear time logic that does not observe reduced transitions of the net. We show how to replace these conditions by structural or algebraical ones leading to reductions that can be efficiently checked and applied whereas enlarging the application spectrum of the previous reductions. At last, we illustrate our method on a significant and typical example of a synchronisation pattern of parallel programs.

show abstract

Atomicity refinement and trace reduction theorems

Cited by 5 publications

References 27 publications

Stubborn Transaction Reduction

Stubborn Transaction Reduction

Dynamic Reductions for Model Checking Concurrent Software

New Efficient Petri Nets Reductions for Parallel Programs Verification

Contact Info

Product

Resources

About