A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Despite of the well-known state-explosion problem, certain simple but important data-flow analysis problems known as gen/kill problems can be solved efficiently and completely for parallel programs with a shared state [7, 6, 2, 3, 13] . This paper shows that, in all probability, these surprising results cannot be generalized to significantly larger classes of data-flow analysis problems. More specifically, we study the complexity of detecting copy constants in parallel programs, a problem thatdoi:10.1007/3-540-44693-1_43 fatcat:35x4aaeuxjbincrud4iemih26m