We present a new method for solving the fixed point equations that appear in the static analysis of programs by abstract interpretation. We introduce and analyze a policy iteration algorithm for monotone self-maps of complete lattices. We apply this algorithm to the particular case of lattices arising in the interval abstraction of values of variables. We demonstrate the improvements in terms of speed and precision over existing techniques based on Kleene iteration, including traditional widening/narrowing acceleration mecanisms. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Costan, A., Gaubert, S., Goubault, E., Martel, M., & Putot, S. (2005). A policy iteration algorithm for computing fixed points in static analysis of programs. In Lecture Notes in Computer Science (Vol. 3576, pp. 462–475). Springer Verlag. https://doi.org/10.1007/11513988_46
Mendeley helps you to discover research relevant for your work.