A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 462-475
- https://doi.org/10.1007/11513988_46
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Efficient chaotic iteration strategies with wideningsPublished by Springer Nature ,2006
- From max-plus algebra to nonexpansive mappings: a nonlinear theory for discrete event systemsTheoretical Computer Science, 2003
- Asserting the Precision of Floating-Point Computations: A Simple Abstract InterpreterPublished by Springer Nature ,2002
- A constructive fixed point theorem for min-max functionsDynamics and Stability of Systems, 1999
- The duality theorem for min-max functionsComptes Rendus de l'Académie des Sciences - Series I - Mathematics, 1998
- Min-max functionsDiscrete Event Dynamic Systems, 1994
- Abstract interpretation by dynamic partitioningJournal of Functional Programming, 1992
- Static analysis of linear congruence equalities among variables of a programPublished by Springer Nature ,1991
- Strictness analysis — a practical approachPublished by Springer Nature ,1985
- On Nonterminating Stochastic GamesManagement Science, 1966