Detecting MPI Zero Buffer Incompatibility by SMT Encoding

Huang, Yiyan; Mercer, Eric

doi:10.1007/978-3-319-17524-9_16

Cited by 9 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have already implemented the refinement in MPI-SV. The support of masterslave pattern demonstrates that MPI-SV outperforms the single path reasoning work [23,41].…”

Section: A3 Support Of Master-slave Patternmentioning

confidence: 96%

See 1 more Smart Citation

Combining symbolic execution and model checking to verify MPI programs

2018

Proceedings of the 40th International Conference on Software Engineering: Companion Proceeedings

View full text Add to dashboard Cite

Message passing is the standard paradigm of programming in highperformance computing. However, verifying Message Passing Interface (MPI) programs is challenging, due to the complex program features (such as non-determinism and non-blocking operations). In this work, we present MPI symbolic verifier (MPI-SV), the first symbolic execution based tool for automatically verifying MPI programs with non-blocking operations. MPI-SV combines symbolic execution and model checking in a synergistic way to tackle the challenges in MPI program verification. The synergy improves the scalability and enlarges the scope of verifiable properties. We have implemented MPI-SV 1 and evaluated it with 111 real-world MPI verification tasks. The pure symbolic execution-based technique successfully verifies 61 out of the 111 tasks (55%) within one hour, while in comparison, MPI-SV verifies 100 tasks (90%). On average, compared with pure symbolic execution, MPI-SV achieves 19x speedups on verifying the satisfaction of the critical property and 5x speedups on finding violations. CCS CONCEPTS• Software and its engineering → Software verification and validation;

show abstract

“…We have already implemented the refinement in MPI-SV. The support of masterslave pattern demonstrates that MPI-SV outperforms the single path reasoning work [23,41].…”

Section: A3 Support Of Master-slave Patternmentioning

confidence: 96%

“…MOPPER [23] encodes the deadlock detection problem under concrete inputs in a SAT equation. Similarly, Huang and Mercer [41] use an SMT formula to reason about a trace of an MPI program for deadlock detection. However, the SMT encoding is specific for the zero-buffer mode.…”

Section: Related Workmentioning

confidence: 99%