Initial experiences with a pattern-oriented parallel debugger
PADD '88 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The Ariadne debugger: scalable application of event-based abstraction
PADD '93 Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging
Event and state-based debugging in TAU: a prototype
SPDT '96 Proceedings of the SIGMETRICS symposium on Parallel and distributed tools
Model checking
Systematic macrostep debugging of message passing parallel programs
Future Generation Computer Systems - Special issue on distributed and parallel systems
The Temporal Rover and the ATG Rover
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Systematic Debugging of Parallel Programs in DIWIDE Based on Collective Breakpoints and Macrosteps
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
NOPE: A Nondeterministic Program Evaluator
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Correctness debugging of message passing programs using model verification techniques
PVM/MPI'07 Proceedings of the 14th European conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
| Hi-index | 0.00 |
We describe the use of temporal logic formulas as runtime assertions in a parallel debugging environment. The user asserts in a message passing program the expected system behavior by one or several such formulas. The debugger allows by "macro-stepping" to interactively elaborate the execution tree (i.e., the set of possible execution paths) which arises from the use of non-deterministic communication operations. In each macro-step, a temporal logic checker verifies that the once asserted temporal formulas are not violated by the current program state. Our approach thus introduces powerful runtime assertions into parallel and distributed debugging by incorporating ideas from the model checking of temporal formulas.