A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Regularly annotated set constraints
2007
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation - PLDI '07
A general class of program analyses can be characterized as a combination of context-free and regular language reachability. We define regularly annotated set constraints, a constraint formalism that captures this class of analysis problems. We give a constraint resolution algorithm and show experimentally that an implementation of our approach is both efficient and scalable. Our results considerably extend the class of reachability problems expressible naturally in a single constraint
doi:10.1145/1250734.1250772
dblp:conf/pldi/KodumalA07
fatcat:y7qi4vjt4jgpbn4jwj537rxgoi