Combining Symbolic Execution and Model Checking to Verify MPI Programs

Yu, Hengbiao; Chen, Zhenbang; Fu, Xianjin; Wang, Ji; Su, Zhendong; Dong, Wei; Huang, Chun

doi:10.48550/arxiv.1803.06300

Cited by 1 publication

(4 citation statements)

References 71 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have proved the symbolic execution method is correct for reachability properties [58]. Due to the space limit, the proof can be referred to [91].…”

Section: Blocking-driven Symbolic Executionmentioning

confidence: 96%

“…We define each process as a CSM with an unbounded receiving FIFO queue. For the sake of space limit, the formal semantics can be referred to [91].…”

Section: Mpi Syntax and Motivating Examplementioning

confidence: 99%

“…The proof's main idea is to prove that CSP ideal is equal to the model defined by the formal MPI semantics [91] w.r.t. the failure divergence semantics.…”

Section: Soundness and Completenessmentioning

confidence: 99%

“…Then, based on Theorem 4.1, we can prove that CSP st at ic is consistent with the MPI semantics. Please refer to [91] for the detailed proofs for these two theorems.…”

Section: Soundness and Completenessmentioning

confidence: 99%

See 3 more Smart Citations

Combining symbolic execution and model checking to verify MPI programs

2018

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

Self Cite

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 proved the symbolic execution method is correct for reachability properties [58]. Due to the space limit, the proof can be referred to [91].…”

Section: Blocking-driven Symbolic Executionmentioning

confidence: 96%

“…We define each process as a CSM with an unbounded receiving FIFO queue. For the sake of space limit, the formal semantics can be referred to [91].…”

Section: Mpi Syntax and Motivating Examplementioning

confidence: 99%

“…The proof's main idea is to prove that CSP ideal is equal to the model defined by the formal MPI semantics [91] w.r.t. the failure divergence semantics.…”

Section: Soundness and Completenessmentioning

confidence: 99%

“…Then, based on Theorem 4.1, we can prove that CSP st at ic is consistent with the MPI semantics. Please refer to [91] for the detailed proofs for these two theorems.…”

Section: Soundness and Completenessmentioning

confidence: 99%

See 2 more Smart Citations

Combining symbolic execution and model checking to verify MPI programs

2018

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

Self Cite

View full text Add to dashboard Cite

show abstract

Combining Symbolic Execution and Model Checking to Verify MPI Programs

Cited by 1 publication

References 71 publications

Combining symbolic execution and model checking to verify MPI programs

Combining symbolic execution and model checking to verify MPI programs

Contact Info

Product

Resources

About