A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs

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 arisi...

Full description

Saved in:
Bibliographic Details
Published inComputer Aided Verification pp. 462 - 475
Main Authors Costan, A., Gaubert, S., Goubault, E., Martel, M., Putot, S.
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Abstract Domain
Abstract Interpretation
Applied sciences
Complete Lattice
Computer science; control theory; systems
Elementary Operation
Exact sciences and technology
Policy Iteration
Software
Software engineering
Fix point
Static analysis
Kleene algebra
Abstract interpretation
Program analysis
Abstraction
Modeling
Narrowing(logics)
Lattice
Program verification
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783540272311
3540272313
ISSN:0302-9743
1611-3349
DOI:10.1007/11513988_46