Time stamps for fixed-point approximation

Electronic Notes in Theoretical Computer Science

Volumn 45, Issue , 2001, Pages 65-76

  Damian, Daniel ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; SEMANTICS;

ABSTRACT INTERPRETATION; CONTROL-FLOW ANALYSIS; FIXED-POINT APPROXIMATION; FIXED-POINT COMPUTATION;

OBJECT ORIENTED PROGRAMMING;

EID: 18944402683     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80955-1     Document Type: Conference Paper

References (20)

1. Bourdoncle F., Efficient chaotic iteration strategies with widenings, in: Proceedings of the International Conference on Formal Methods in Programming and their Applications, Lecture Notes in Computer Science 735 (1993), pp. 128-141.
2. Charlier, B. L. and P. V. Hentenryck, A universal top-down fixpoint algorithm, Technical Report CS-92-25, Brown University, Providence, Rhode Island (1992).
3. Chen L.-L. and W. L. Harrison, An efficient approach to computing fixpoints for complex program analysis, in: Proceedings of the 8th ACM International Conference on Supercomputing (1994), pp. 98-106.
4. Chen L.-L., Harrison W.L., Yi K. Efficient computation of fixpoints that arise in complex program analysis. Journal of Programming Languages. 3:1995;31-68
5. Clack C. and S. L. Peyton Jones, Strictness analysis - a practical approach, in: J.-P. Jouannaud, editor, Proceedings of the Second International Conference on Functional Programming and Computer Architecture, number 201 in Lecture Notes in Computer Science (1985), pp. 35-49.
6. Cousot P. and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: R. Sethi, editor, Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages (1977), pp. 238-252.
7. Fecht C. and H. Seidl, An even faster solver for general systems of equations, in: R. Cousot and D. A. Schmidt, editors, Proceedings of 3rd Static Analysis Symposium, Lecture Notes in Computer Science 1145 (1996), pp. 189-204.
8. Fecht C. and H. Seidl, Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems, in: C. Hankin, editor, Proceedings of the 7th European Symposium on Programming, Lecture Notes in Computer Science 1381 (1998), pp. 90-104.
9. Hunt S., "Abstract Interpretation of Functional Languages: From Theory to Practice," Ph.D. thesis, Department of Computing, Imperial College of Science Technology and Medicine, London, UK (1991).
10. Jones N.D., Nielson F. Abstract interpretation: A semantics-based tool for program analysis. 4:1995;527-636 Oxford University Press
11. Jørgensen N. Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration. Charlier B.L. Static Analysis, number 864 in Lecture Notes in Computer Science. 1994;329-345
12. Kam J.B., Ullman J.D. Monotone data flow analysis frameworks. Acta Informatica. 7:1977;305-317
13. Nielson F., Nielson H.R., Hankin C. "Principles of Program Analysis" 1999;Springer-Verlag
14. O'Keefe, R. A., Finite fixed-point problems, in: J.-L. Lassez, editor, Logic Programming, Proceedings of the Fourth International Conference (1987), pp. 729-743.
15. Rosendahl M., Higher-order chaotic iteration sequences, in: M. Bruynooghe and J. Penjam, editors, Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming, number 714 in Lecture Notes in Computer Science (1993), pp. 332-345.
16. Sabry A. and M. Felleisen, Is continuation-passing useful for data flow analysis?, in: V. Sarkar, editor, Proceedings of the ACM SIGPLAN'94 Conference on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 29, No 6 (1994), pp. 1-12.
17. Sagiv S., Reps T.W., Horwitz S. Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science. 167:1996;131-170
18. Schmidt D.A. Natural-semantics-based abstract interpretation. Mycroft A. Static Analysis, number 983 in Lecture Notes in Computer Science. 1995;1-18
19. Shivers O., "Control-Flow Analysis of Higher-Order Languages," Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania (1991), Technical Report CMU-CS-91-145.
20. Young J. and P. Hudak, Finding fixpoints on function spaces, Technical Report YALEEU/DCS/RR-505, Yale University, New Haven, CT (1986).