Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings

DOI10.1007/978-3-540-70545-1_9zbMath1155.68358OpenAlexW2149871224MaRDI QIDQ3512483

Ganesh Gopalakrishnan, Sarvani Vakkalanka, Robert M. Kirby

Publication date: 15 July 2008

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70545-1_9

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Dynamic symbolic verification of MPI programs ⋮ A Mathematical Model of Parallel Programs and an Approach Based on it to Verification of MPI Programs

Uses Software

• veriSoft
• SPIN
• ISP
• MARMOT
• ConTest

Cites Work

• Time, clocks, and the ordering of events in a distributed system
• Framework for testing multi‐threaded Java programs
• Dynamic partial-order reduction for model checking software
• Model Checking Software
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings