Binding-time analysis in partial evaluation: One size does not fit all

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1755, Issue , 2000, Pages 80-92

  Christensen, Niels H ^a   Glück, Robert ^a   Laursen, Søren ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ADAPTIVE APPROACH; BINDING TIME ANALYSIS; FORTRAN 77; OFFLINE; PARTIAL EVALUATION;

ARTIFICIAL INTELLIGENCE;

EID: 32044460176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46562-6_7     Document Type: Conference Paper

References (24)

1. L. O. Andersen. C program specialization (revised version). DIKU Report 92/14, DIKU, University of Copenhagen, 1992.
2. L. O. Andersen. Binding-time analysis and the taming of C pointers. In Proc. Of ACM Symposium on Partial Evaluation and Semantics-Based Program Manipula-tion, PEPM'93, 1993.
3. L. O. Andersen. Program analysis and specialization for the C programming language. DIKU Report 94/19, Department of Computer Science, University of Copenhagen, 1994.
4. L. O. Andersen and C. K. Gomard. Speedup analysis in partial evaluation: preliminary results. In Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 1-7, San Francisco, California, 1992. Yale University, Dept. of Computer Science.
5. P. H. Andersen and C. K. Holst. Termination analysis for offline partial evaluation of a higher order functional language. In R. Cousot and D. Schmidt, editors, Static Analysis, volume 1145 of Lecture Notes in Computer Science, pages 67-82, Aachen, Germany, 1996. Springer-Verlag.
6. J. M. Ashley and C. Consel. Fixpoint computation for polyvariant static analyses of higher-order applicative programs. ACM TOPLAS, 16(5):1431-1448, 1994.
7. M. A. Bulyonkov. Polyvariant mixed computation for analyzer programs. Acta Informatica, 21:473-484, 1984.
8. M. A. Bulyonkov. Extracting polyvariant binding time analysis from polyvariant specializer. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 59-65, Copenhagen, Denmark, 1993. ACM Press.
9. M. A. Bulyonkov and D. V. Kochetov. Practical aspects of specialization of Algollike programs. In O. Danvy, R. Glück, and P. Thiemann, editors, Partial Evalua-tion. Proceedings, volume 1110 of Lecture Notes in Computer Science, pages 17-32, Dagstuhl Castle, Germany, 1996. Springer-Verlag.
10. N. H. Christensen and S. Laursen. Partial evaluation of an imperative language. DIKU Student Report 98-7-3, DIKU, Dept. of Computer Science, University of Copenhagen, 1998.
11. C. Consel. Polyvariant binding-time analysis for applicative languages. In ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based program Manip-ulation, pages 66-77. ACM Press, 1993.
12. C. Consel and F. Nöel. A general approach for run-time specialization and its application to C. In Conference Record of the Twenty Third Symposium on Prin-ciples of Programming Languages, pages 145-156, St. Petersburg Beach, Florida, 1996. ACM Press.
13. A. P. Ershov and V. E. Itkin. Correctness of mixed computation in Algol-like programs. In J. Gruska, editor, Mathematical Foundations of Computer Science 1977, volume 53 of Lecture Notes in Computer Science, pages 59-77, Tatranská Lomnica, 1977. Springer-Verlag.
14. A. J. Glenstrup and N. D. Jones. BTA algorithms to ensure termination of offline partial evaluation. In D. Bjørner, M. Broy, and I. V. Pottosin, editors, Perspectives of System Informatics. Proceedings, volume 1181 of Lecture Notes in Computer Science, pages 273-284, Novosibirsk, Russia, 1996. Springer-Verlag.
15. R. Glück and J. Jfirgensen. Fast binding-time analysis for multi-level specialization. In D. Bjørner, M. Broy, and I. V. Pottosin, editors, Perspectives of System Informatics. Proceedings, volume 1181 of Lecture Notes in Computer Science, pages 261-272, Novosibirsk, Russia, 1996. Springer-Verlag.
16. C. K. Gomard and N. D. Jones. Compiler generation by partial evaluation: a case study. Structured Programming, 12:123-144, 1991.
17. L. Hornof, C. Consel, and J. Noyffe. Effective specialization of realistic programs via use sensitivity. In P. Van Hentenryck, editor, Static Analysis. Proceedings, volume 1302 of Lecture Notes in Computer Science, pages 293-314, Paris, France, 1997. Springer-Verlag.
18. L. Hornof and J. Noyffe. Accurate binding-time analysis for imperative languages: flow, context, and return sensitivity. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 63-73, Amsterdam, The Netherlands, 1997. ACM Press.
19. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
20. N. D. Jones, P. Sestoft, and H. Sfindergaard. An experiment in partial evaluation: the generation of a compiler generator. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, volume 202 of Lecture Notes in Computer Science, pages 124-140. Springer-Verlag, 1985.
21. N. D. Jones, P. Sestoft, and H. Sfindergaard. Mix: a self-applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation, 2(1):9-50, 1989.
22. P. Kleinrubatscher, A. Kriegshaber, R. Zöchling, and R. Glück. Fortran program specialization. SIGPLAN Notices, 30(4):61-70, 1995.
23. B. Rytz and M. Gengler. A polyvariant binding time analysis. In Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 21-28, San Francisco, California, 1992. Yale University, Dept. of Computer Science.
24. P. Thiemann and M. Sperber. Polyvariant expansion and compiler generators. In D. Bjørner, M. Broy, and I. V. Pottosin, editors, Perspectives of System In-formatics. Proceedings, volume 1181, pages 285-296, Novosibirsk, Russia, 1996. Springer-Verlag.