modeling wildcard-free mpi programs for verification
We give several theorems that can be used to substantially reduce the state space that must be considered in applying finite-state verification techniques, such as model checking, to parallel programs written using a subset of MPI. We illustrate the utility of these theorems by applying them to a small but realistic example.
model mpi program verification space finite-state verification model checking parallel programming utility examples analysis concurrent systems deadlock message passing interface formal methods spin parallel computation