Optimal Dynamic Partial Order Reduction with Observers

Aronis, Stavros; Jönsson, Bengt; Lång, Magnus; Sagonas, Konstantinos

doi:10.1007/978-3-319-89963-3_14

Cited by 33 publications

(40 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We use our implementation to assess (i) the coarseness of the VH B partitioning in practice, and (ii) the efficiency of VC-DPOR to explore such partitionings. To this end, we compare these two metrics with existing state-of-the-art explicit DPOR algorithms, namely, the Source-DPOR [Abdulla et al 2014], Optimal-DPOR [Abdulla et al 2014], Optimal-DPOR with observers [Aronis et al 2018], as well as DC-DPOR [Chalupa et al 2017]. Our results show a significant reduction in the size of the partitioning compared to the partitionings explored by existing techniques, which also typically leads to smaller running times.…”

Section: Challenges and Our Contributionsmentioning

confidence: 99%

“…We also refer to ?? for a comparison of VH B and our algorithm VC-DPOR which explores the VH B partitioning with other related works, in particular with the works of [Abdulla et al 2014], [Huang 2015], [Chalupa et al 2017], [Albert et al 2017] and [Aronis et al 2018].…”

Section: The Value-happens-before Equivalencementioning

confidence: 99%

“…The overall efficiency of the algorithm is a product of the two above, and there is usually a trade-off between the two, as coarser partitionings typically make the problem of moving between different classes of the partitioning computationally harder.Beyond the Mazurkiewicz equivalence. Lately, there has been a considerable effort into going beyond Mazurkiewicz equivalence, by developing algorithms that explore partitionings of the trace space induced by equivalence relations that are coarser than Mazurkiewicz [Albert et al 2017;Aronis et al 2018;Chalupa et al 2017;Huang 2015]. Such approaches can be broadly classified as oraclebased methods that rely on NP-hard oracles such as SMT-solvers to guide the exploration, and explicit methods which avoid such computationally expensive oracles.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Value-centric dynamic partial order reduction

Chatterjee

Pavlogiannis

Toman

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

The verification of concurrent programs remains an open challenge, as thread interaction has to be accounted for, which leads to state-space explosion. Stateless model checking battles this problem by exploring traces rather than states of the program. As there are exponentially many traces, dynamic partial-order reduction (DPOR) techniques are used to partition the trace space into equivalence classes, and explore a few representatives from each class. The standard equivalence that underlies most DPOR techniques is the happens-before equivalence, however recent works have spawned a vivid interest towards coarser equivalences. The efficiency of such approaches is a product of two parameters: (i) the size of the partitioning induced by the equivalence, and (ii) the time spent by the exploration algorithm in each class of the partitioning.In this work, we present a new equivalence, called value-happens-before and show that it has two appealing features. First, value-happens-before is always at least as coarse as the happens-before equivalence, and can be even exponentially coarser. Second, the value-happens-before partitioning is efficiently explorable when the number of threads is bounded. We present an algorithm called value-centric DPOR (VC-DPOR), which explores the underlying partitioning using polynomial time per class. Finally, we perform an experimental evaluation of VC-DPOR on various benchmarks, and compare it against other state-of-the-art approaches. Our results show that value-happens-before typically induces a significant reduction in the size of the underlying partitioning, which leads to a considerable reduction in the running time for exploring the whole partitioning.is related to the state-space explosion, and second, is related to the number of interleavings. Below we describe the main techniques to address these problems.Stateless model checking. Model checkers typically store a large number of global states, and cannot handle realistic concurrent programs. The standard solution that is adopted to battle this problem on concurrent programs is stateless model checking [Godefroid 1996]. Stateless model-checking methods typically explore traces rather than states of the analyzed program, and only have to store a small number of traces. In such techniques, model checking is achieved by a scheduler, which drives the program execution based on the current interaction between the threads. The depth-first nature of the search enables it to be both systematic and memory-efficient. Stateless model-checking techniques have been employed successfully in several well-established tools, e.g., VeriSoft [Godefroid 1997[Godefroid , 2005 and CHESS [Madan Musuvathi 2007].Partial-order Reduction (POR). While stateless model checking deals with the state-space issue, one key challenge that remains is exploring efficiently the exponential number of interleavings, which results from non-deterministic interprocess communication. There exist various techniques for reducing the number of explored interleavings, such as de...

show abstract

Section: Challenges and Our Contributionsmentioning

confidence: 99%

Section: The Value-happens-before Equivalencementioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Value-centric dynamic partial order reduction

Chatterjee

Pavlogiannis

Toman

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…It remains as future work to study this integration. Related to DCDPOR, [16] extends optimal DPOR with observers. For the previous example, [16] needs to explore five executions: r.p.q and r.q.p, are equivalent because p and q do not have any observer.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

“…Related to DCDPOR, [16] extends optimal DPOR with observers. For the previous example, [16] needs to explore five executions: r.p.q and r.q.p, are equivalent because p and q do not have any observer. Another improvement orthogonal to ours is to inspect dependencies over chains of events, as in [17,19].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Constrained Dynamic Partial Order Reduction

Albert

Gómez-Zamalloa

Isabel

et al. 2018

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. The cornerstone of dynamic partial order reduction (DPOR) is the notion of independence that is used to decide whether each pair of concurrent events p and t are in a race and thus both p · t and t · p must be explored. We present constrained dynamic partial order reduction (CDPOR), an extension of the DPOR framework which is able to avoid redundant explorations based on the notion of conditional independence-the execution of p and t commutes only when certain independence constraints (ICs) are satisfied. ICs can be declared by the programmer, but importantly, we present a novel SMT-based approach to automatically synthesize ICs in a static pre-analysis. A unique feature of our approach is that we have succeeded to exploit ICs within the state-of-the-art DPOR algorithm, achieving exponential reductions over existing implementations.

show abstract

Formal Methods for Industrial Critical Systems

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

show abstract

Optimal Dynamic Partial Order Reduction with Observers

Cited by 33 publications

References 17 publications

Value-centric dynamic partial order reduction

Value-centric dynamic partial order reduction

Constrained Dynamic Partial Order Reduction

Formal Methods for Industrial Critical Systems

Contact Info

Product

Resources

About