For large programs, static analysis can be one of the most time-consuming phases of the whole compilation process. We propose a new paradigm for the implementation of static analyses that is inspired by partial evaluation techniques. Our paradigm does not reduce the complexity of these analyses, but it allows an efficient implementation. We illustrate this paradigm by its application to the problem of control flow analysis of functional programs. We show that the analysis can be sped up by a factor of 2 over the usual abstract interpretation method.
CITATION STYLE
Boucher, D., & Feeley, M. (1996). Abstract compilation: A new implementation paradigm for static analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1060, pp. 192–207). Springer Verlag. https://doi.org/10.1007/3-540-61053-7_62
Mendeley helps you to discover research relevant for your work.