Regularly annotated set constraints

John Kodumal, Alex Aiken
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
more » ... , including such diverse applications as interprocedural dataflow analysis, precise type-based flow analysis, and pushdown model checking.
doi:10.1145/1250734.1250772 dblp:conf/pldi/KodumalA07 fatcat:y7qi4vjt4jgpbn4jwj537rxgoi