Strictness analysis—a practical approach
Proc. of a conference on Functional programming languages and computer architecture
Static analysis of linear congruence equalities among variables of a program
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Asserting the Precision of Floating-Point Computations: A Simple Abstract Interpreter
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Nonuniform Alias Analysis of Recursive Data Structures and Arrays
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
From max-plus algebra to nonexpansive mappings: a nonlinear theory for discrete event systems
Theoretical Computer Science
Efficient Fixpoint Computation for Invariant Checking
ICCD '99 Proceedings of the 1999 IEEE International Conference on Computer Design
A Universal Top-Down Fixpoint Algorithm
A Universal Top-Down Fixpoint Algorithm
How to solve large scale deterministic games with mean payoff by policy iteration
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Precise Interval Analysis vs. Parity Games
FM '08 Proceedings of the 15th international symposium on Formal Methods
Max-plus Algebraic Tools for Discrete Event Systems, Static Analysis, and Zero-Sum Games
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
A minimalistic look at widening operators
Higher-Order and Symbolic Computation
Static analysis by policy iteration on relational domains
ESOP'07 Proceedings of the 16th European conference on Programming
Precise fixpoint computation through strategy iteration
ESOP'07 Proceedings of the 16th European conference on Programming
Computing game values for crash games
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Static analysis of the accuracy in control systems: principles and experiments
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
Some Experience on the Software Engineering of Abstract Interpretation Tools
Electronic Notes in Theoretical Computer Science (ENTCS)
Static Analysis by Abstract Interpretation: A Mathematical Programming Approach
Electronic Notes in Theoretical Computer Science (ENTCS)
Computing relaxed abstract semantics w.r.t. quadratic zones precisely
SAS'10 Proceedings of the 17th international conference on Static analysis
Solving systems of rational equations through strategy iteration
ACM Transactions on Programming Languages and Systems (TOPLAS)
Improving strategies via SMT solving
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Policy iteration within logico-numerical abstract domains
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Widening with thresholds for programs with complex control graphs
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Template-Based unbounded time verification of affine hybrid automata
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Abstract interpretation meets convex optimization
Journal of Symbolic Computation
Tropical linear-fractional programming and parametric mean payoff games
Journal of Symbolic Computation
Acceleration of the abstract fixpoint computation in numerical program analysis
Journal of Symbolic Computation
Under-approximations of computations in real numbers based on generalized affine arithmetic
SAS'07 Proceedings of the 14th international conference on Static Analysis
Accelerated data-flow analysis
SAS'07 Proceedings of the 14th international conference on Static Analysis
SAS'07 Proceedings of the 14th international conference on Static Analysis
Program analysis using symbolic ranges
SAS'07 Proceedings of the 14th international conference on Static Analysis
Precise relational invariants through strategy iteration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Proving Termination by Policy Iteration
Electronic Notes in Theoretical Computer Science (ENTCS)
When the decreasing sequence fails
SAS'12 Proceedings of the 19th international conference on Static Analysis
| Hi-index | 0.00 |
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.