A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
There is a tension in program analysis between precision and e ciency. In constraint-based program analysis, at one extreme methods based on uni cation of equality constraints over terms are very fast but often imprecise. At the other extreme, methods based on the resolution of inclusion constraints over set expressions are quite precise, but are often ine cient in practice. We describe a parameterized framework for constraint-based program analyses that allows the analysis designer to embeddoi:10.1007/bfb0032737 fatcat:kofma76kpfgvhabmgvebt42xli