Program analysis using mixed term and set constraints [chapter]

Manuel Fähndrich, Alexander Aiken
1997 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 embed
more » ... ms and set expressions within each other. Constraints over these mixed expressions are partially between equality and inclusion, which enables an entire spectrum of program analyses with varying degrees of precision and e ciency to be expressed. We also show that there are interesting analyses that take advantage of this mixture. In particular, we report on the design and implementation of an uncaught exception analysis for core ML. Our results show that the analysis approaches the e ciency of algorithm W.
doi:10.1007/bfb0032737 fatcat:kofma76kpfgvhabmgvebt42xli