Towards Efficient Verification of Parallel Applications with Mc SimGrid
Preprint
Abstract
Assessing the correctness of distributed and parallel applications is notoriously difficult due to the complexity of the concurrent behaviors and the difficulty to reproduce bugs. In this context, Dynamic Partial Order Reduction (DPOR) techniques have proved successful in exploiting concurrency to verify applications without exploring all their behaviors. However, they may lack of efficiency when tracking non-systematic bugs of real size applications. In this paper, we suggest two adaptations of the Optimal Dynamic Partial Order Reduction (ODPOR) algorithm with a particular focus on bug finding and explanation. The first adaptation is an out-of-order version called RFS ODPOR which avoids being stuck in uninteresting large parts of the state space. Once a bug is found, the second adaptation takes advantage of ODPOR principles to efficiently find the origins of the bug.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- A systematic literature review on counterexample explanationInformation and Software Technology, 2022
- Truly stateless, optimal dynamic partial order reductionProceedings of the ACM on Programming Languages, 2022
- Debugging of Behavioural Models using Counterexample AnalysisIEEE Transactions on Software Engineering, 2019
- Simulating MPI Applications: The SMPI ApproachIEEE Transactions on Parallel and Distributed Systems, 2017
- Versatile, scalable, and accurate simulation of distributed applications and platformsJournal of Parallel and Distributed Computing, 2014
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978