Side-effecting constraint systems were originally introduced for the analysis of multi-threaded code [22]. In this paper, we show how this formalism provides a unified framework for realizing efficient interprocedural analyses where the amount of context-sensitivity can be tweaked and where the context-sensitive analyses of local properties can be combined with flow-insensitive analyses of global properties, e.g., about the heap. Side-effecting constraint systems thus form the ideal basis for building general-purpose infrastructures for static analysis. One such infrastructure is the analyzer generator GOBLINT, which we used to practically evaluate this approach on real-world examples. © Springer-Verlag Berlin Heidelberg 2012.
CITATION STYLE
Apinis, K., Seidl, H., & Vojdani, V. (2012). Side-effecting constraint systems: A swiss army knife for program analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7705 LNCS, pp. 157–172). https://doi.org/10.1007/978-3-642-35182-2_12
Mendeley helps you to discover research relevant for your work.