Verifying Parallel Programs with MPI-Spin

Authors:
Stephen F. Siegel
Affiliations:
Verified Software Laboratory, Department of Computer and Information Sciences, University of Delaware, Newark, DE 19716, USA
Venue:
Proceedings of the 14th European PVM/MPI User's Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Year:
2007

Citing 0
Cited 4

BSP-WHY: an intermediate language for deductive verification of BSP programs

Proceedings of the fourth international workshop on High-level parallel programming and applications
Formal analysis of message passing

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
A model-extraction approach to verifying concurrent C programs with CADP

Science of Computer Programming
Using model checking to analyze the system behavior of the LHC production grid

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Standard testing and debugging techniques are notoriously ineffective when applied to parallel programs, due to the numerous sources of nondeterminism arising from parallelism. MPI-Spin, an extension of the model checker Spin for verifying and debugging MPI-based parallel programs, overcomes many of the limitations associated with the standard techniques. By exploring all possible executions of an MPI program, MPI-Spin can conclude, for example, that a program cannot deadlock on any execution. If the program can deadlock, MPI-Spin can exhibit a trace showing exactly how the program fails, greatly facilitating debugging.