Abstract | ||
---|---|---|
Formal dynamic analysis of MPI programs is critically important since conventional testing tools for message passing programs do not cover the space of possible nondeterministic communication matches, thus may miss bugs in the unexamined execution scenarios. While modern dynamic verification techniques guarantee the coverage of non-deterministic communication matches, they do so indiscriminately, inviting exponential interleaving explosion. Though the general problem is difficult to solve, we show that a specialized dynamic analysis method can be developed for dramatically reducing the number of interleavings when looking for certain safety properties such as deadlocks. Our MAAPED (Messaging Application Analysis with Predictive Error Discovery) tool collects a single program trace and predicts deadlock presence in other (unexplored) traces of an MPI program for the same input. MAAPED hinges on initially computing the potential alternate matches for non-deterministic communication operations and then analyzes such matches which may lead to a deadlock. The results collected are encouraging. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/SC.Companion.2012.233 | SC Companion |
Keywords | Field | DocType |
message passing programs,formal dynamic analysis,mpi programs,application program interfaces,program testing,messaging application analysis with predictive error discovery,nondeterministic communication operation,specialized dynamic analysis method,dynamic verification techniques,predictive dynamic analysis tool,nondeterministic communication match,deadlock presence,maaped hinge,program debugging,mpi program,non-deterministic communication,dynamic verification,maaped,bugs,testing tools,mpi applications,deadlock presence prediction,mpi,message passing,exponential interleaving explosion,non-deterministic communication operation,program verification,single program trace,deterministic communication,system monitoring,modern dynamic verification technique | Nondeterministic algorithm,Computer science,Deadlock,Parallel computing,System monitoring,Program trace,Program testing,Message passing,Dynamic program analysis,Interleaving,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-4673-6218-4 | 0 | 0.34 |
References | Authors | |
6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Subodh Sharma | 1 | 70 | 5.99 |
Ganesh Gopalakrishnan | 2 | 1619 | 130.11 |
Greg Bronevetsky | 3 | 949 | 44.91 |