Program Analysis Using Mixed Term and Set Constraints
- Manuel Fahndrich ,
- Alexander Aiken
Proceedings of the 4th International Static Analysis Symposium |
Published by Springer Verlag
Inclusion constraints over set-expressions provide a general formalism to express a large class of program analyses. Over the past two years, we have experimented with inclusion constraints to model dataflow in type-based analyses. One of our research goals is to determine how to structure and implement precise constraint-based analyses such that they scale to large programs.