Modeling concurrency in parallel debugging

W. Hseush, G. E. Kaiser
1990 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming - PPOPP '90  
We propose a description language, Data Path Expressions (DPEs), for modeling the behavior of parallel programs. We have designed DPEs as a high-level debugging language, where the debugging paradigm is for the programmer to describe the expected program behavior and for the debugger to compare the actual program behavior during execution to detect program errors. We classify DPEs into five subclasses according to syntactic criteria, and characterize their semantics in tenns of a hierarchy of
more » ... of a hierarchy of extended Petri Net models. The characterization demonstrates the power of DPEs for modeling (true) concurrency. We also present predecessor automata as a mechanism for implementing the third subclass Qf DPEs, which expresses bounded parallelism. Predecessor automata extend fmite state automata to recognize or genemte partial ordering graphs as well as strings, and provide efficient event recognizers for parallel debugging. We briefly describe the application of DPEs to mce conditions, deadlock and starvation.
doi:10.1145/99163.99166 dblp:conf/ppopp/HseushK90 fatcat:lnrzohzl5bd2tk5cnvmczb34tu