Efficient chaotic iteration strategies with widenings

1. Alfred V. Aho, Ravi Sethi and Jeffrey D. Ullman: “Compilers — Principles, Techniques and Tools”, Addison-Wesley Publishing Company (1986)

   Google Scholar 

2. François Bourdoncle: “Interprocedural Abstract Interpretation of Block Structured Languages with Nested Procedures, Aliasing and Recursivity”, Proc. of the International Workshop PLILP'90, Lecture Notes in Computer Science 456, Springer-Verlag (1990)

   Google Scholar 

3. François Bourdoncle: “Abstract Interpretation By Dynamic Partitioning”, Journal of Functional Programming, Vol. 2, No. 4 (1992)

   Google Scholar 

4. François Bourdoncle: “Sémantiques des langages impératifs d'ordre supérieur et interprétation abstraite”, Ph.D. dissertation, Ecole Polytechnique (1992)

   Google Scholar 

5. François Bourdoncle: “Abstract Debugging of Higher-Order Imperative Languages”, Proc. of SIGPLAN '93 Conference on Programming Language Design and Implementation (1993)

   Google Scholar 

6. Michael Burke: “An Interval-Based Approach to Exhaustive and Incremental Interprocedural Data-Flow Analysis”, ACM Transactions on Programming Languages and Systems, Vol. 12, Num. 3 (1990) 341–395

   Google Scholar 

7. Patrick and Radhia Cousot: “Abstract Interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints”, Proc. of the 4th ACM Symp. on POPL (1977) 238–252

   Google Scholar 

8. Patrick Cousot: “Asynchronous iterative methods for solving a fixpoint system of monotone equations”, Research Report IMAG-RR-88, Université Scientifique et Médicale de Grenoble (1977)

   Google Scholar 

9. Patrick Cousot and Nicolas Halbwachs: “Automatic discovery of linear constraints among variables of a program”, Proc. of the 5th ACM Symp. on POPL (1978) 84–97

   Google Scholar 

10. Patrick Cousot: “Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis. Analyse sémantique de programmes”, Ph.D. dissertation, Université Scientifique et Médicale de Grenoble (1978)

    Google Scholar 

11. Patrick Cousot: “Semantic foundations of program analysis”, in Muchnick and Jones Eds., Program Flow Analysis, Theory and Applications, Prentice-Hall (1981) 303–343

    Google Scholar 

12. Alain Deutsch: “On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications”, Proc. of the 17th ACM Symp. on POPL (1990)

    Google Scholar 

13. Alain Deutsch: “A Storeless Model of Aliasing and its Abstractions using Finite Representations of Right-Regular Equivalence Relations”, Proc. of the IEEE' 92 International Conference on Computer Languages, IEEE Press (1992)

    Google Scholar 

14. Michael. R. Garey and David S. Johnson: “Computers and Intractability: A Guide to the Theory of NP-completeness”, W.H. Freeman and Company (1979)

    Google Scholar 

15. Philippe Granger: “Static analysis of arithmetical congruences”, International Journal of Computer Mathematics (1989) 165–190

    Google Scholar 

16. Larry G. Jones: “Efficient Evaluation of Circular Attribute Grammars”, ACM Transactions on Programming Languages and Systems, Vol. 12, Num. 3 (1990) 429–462

    Google Scholar 

17. B. Le Charlier, K. Musumbu and P. Van Hentenryck: “A generic abstract interpretation algorithm and its complexity analysis”, in K. Furukawa editors, Proc. of the Eight International Conference on Logic Programming, MIT Press (1991) 64–78

    Google Scholar 

18. B. Le Charlier and P. Van Hentenryck: “A universal top-down fixpoint algorithm”, Technical Report 92-1, Institute of Computer Science, University of Namur, Belgium (1992)

    Google Scholar 

19. R.A. O'Keefe: “Finite fixed-point problems”, in J.-L. Lassez editor, Proc. of the Fourth International Conference of Logic Programming, MIT Press (1987) 729–743

    Google Scholar 

20. R.E. Tarjan: “Depth-first search and linear graph algorithms”, SIAM J. Comput., 1 (1972) 146–160

    Google Scholar 

21. R.E. Tarjan: “An Improved Algorithm for Hierarchical Clustering Using Strong Components”, Information Processing Letters 17, Elsevier Science Publishers B.V. (1983) 37–41

    Google Scholar 

Download references