Conference paper
Isolating failure-inducing thread schedules
Jong-Deok Choi, Andreas Zeller
ISSTA 2002
In this paper, we present an algorithm that constructs sparse evaluation graphs for forward or backward monotone data flow problems. The sparse graph combines information as early as possible, yet directly connects nodes that generate and use information. This allows problems from the large, general class of monotone data flow problems to err joy the advantages of solutions based on Static Single Assignment (SSA) form.
Jong-Deok Choi, Andreas Zeller
ISSTA 2002
Robert O'Callahan, Jong-Deok Choi
PPoPP 2003
Ron Cytron, Jeanne Ferrante, et al.
POPL 1989
Michael Burke, Ron Cytron, et al.
The Journal of Supercomputing