A policy iteration algorithm for computing fixed points in static analysis of programs

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 462-475

  Costan, A ^a   Gaubert, S ^b   Goubault, E ^c   Martel, M ^c   Putot, S ^c  

^a Polytehnica Bucarest ^*  (Romania)

^b INRIA ROCQUENCOURT   (France)

^c CEA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; PROBLEM SOLVING;

ABSTRACT INTERPRETATION; POLICY ITERATION ALGORITHM; SELF-MAPS; STATIC ANALYSIS;

ALGORITHMS;

EID: 26444530959     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_46     Document Type: Conference Paper

References (32)

1. F. Bourdoncle. Abstract interpretation by dynamic partitioning. Journal of Functional Programming, 2(4):407-435, 1992.
2. F. Bourdoncle. Efficient chaotic iteration strategies with widenings. Number 735, pages 128-141. Lecture Notes in Computer Science, Springer-Verlag, 1993.
3. B. Le Charlier and P. Van Hentenryck. A universal top-down fixpoint algorithm. Technical Report CS-92-25, Brown University, May 1992.
4. C. Clack and S. L. Peyton Jones. Strictness Analysis - A Practical Approach. In J.-P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, LNCS 201, pages 35-49. Springer, Berlin, sept 1985.
5. J. Cochet-Terrasson. Algorithmes d'itération sur les politiques pour les applications monotones contractantes. Thèse, École des Mines, Dec. 2001.
6. J. Cochet-Terrasson, S. Gaubert, and J. Gunawardena. A constructive fixed point theorem for min-max functions. Dynamics and Stability of Systems, 14(4):407-433, 1999.
7. J. Cochet-Terrasson, S. Gaubert, and J. Gunawardena. Policy iteration algorithms for monotone nonexpansive maps. Draft, 2001.
8. A. Costan. Analyse statique et itération sur les politiques. Technical report, CEA Saclay, report DTSI/SLA/03-575/AC, and Ecole Polytechnique, August 2003.
9. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points. Principles of Programming Languages 4, pages 238-252, 1977.
10. P. Cousot and R. Cousot. Comparison of the Galois connection and widening/narrowing approaches to abstract interpretation. JTASPEFL'91, Bordeaux. BIGRE, 74:107-110, October 1991.
11. D. Damian. Time stamps for fixed-point approximation. ENTCS, 45, 2001.
12. H. Eo and K. Yi. An improved differential fixpoint iteration method for program analysis. November 2002.
13. C. Fecht and H. Seidl. Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems, pages 90-104, 1998.
14. S. Gaubert and J. Gunawardena. The duality theorem for min-max functions. C. R. Acad. Sci. Paris., 326, Série I:43-48, 1998.
15. E. Goubault, M. Martel, and S. Putot. Asserting the precision of floating-point computations: A simple abstract interpreter. ESOP, LNCS 2305, 2002.
16. P. Granger. Analyse de congruences. PhD thesis, Ecole Polytechnique, 1990.
17. P. Granger. Static analysis of linear congruence equalities among variables of a program. In S. Abramsky and T. S. E. Maibaum, editors, TAPSOFT '91 (CAAP'91), LNCS 493, pages 169-192. Springer-Verlag, 1991.
18. J. Gunawardena. Min-max functions. Discrete Event Dynamic Systems, 4:377-406, 1994.
19. J. Gunawardena. From max-plus algebra to nonexpansive maps: a nonlinear theory for discrete event systems. Theoretical Computer Science, 293:141-167, 2003.
20. A. J. Hoffman and R. M. Karp. On nonterminating stochastic games. Management Sci., 12:359-370, 1966.
21. R. Howard. Dynamic Programming and Markov Processes. Wiley, 1960.
22. L. S. Hunt. Abstract Interpretation of Functional Languages: From Theory to Practice. Ph.D. thesis, Department of Computing, Imperial College, London, 1991.
23. M. Karr. Affine relationships between variables of a program. Acta Informatica, (6):133-151, 1976.
24. V. Kuncak and K. Rustan M. Leino. On computing the fixpoint of a set of boolean equations. Technical Report MSR-TR-2003-08, Microsoft Research, 2003.
25. L. Mauborgne. Binary decision graphs. In A. Cortesi and G. Filé, editors, Static Analyis Symposium SAS'99, LNCS 1694, pp 101-116. Springer-Verlag, 1999.
26. A. Miné. The octagon abstract domain in analysis, slicing and transformation. pages 310-319, October 2001.
27. R. A. O'Keefe. Finite fixed-point problems. In Jean-Louis Lassez, editor, ICLP '87, pages 729-743, Melbourne, Australia, May 1987. MIT Press.
28. P. and N. Halbwachs. Discovery of linear restraints among variables of a program.
29. M. L. Puterman. Markov decision processes: discrete stochastic dynamic programming. Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics. John Wiley & Sons Inc., New York, 1994.
30. S. Putot, E. Goubault, and M. Martel. Static analysis-based validation of floating-point computations. LNCS 2991. Springer-Verlag, 2003.
31. K. Ravi and F. Somenzi. Efficient fixpoint computation for invariant checking. In International Conference on Computer Design (ICCD '99), pages 467-475, Washington - Brussels - Tokyo, October 1999. IEEE.
32. A. Venet. Nonuniform alias analysis of recursive data structures and arrays. In SAS 2002, LNCS 2477, pages 36-51. Springer, 2002.