Computing Reachable States of Parallel Programs


A concurrency history graph is a representation of the reachable states of a parallel program A new abstraction for representing the state of a parallel program is presented This new abstraction is more general than previous work by the authors At the same time the new abstraction makes it possible to produce concurrency history graphs that require much… (More)
DOI: 10.1145/122759.122766


2 Figures and Tables