Combining abstract interpretation and partial evaluation (brief overview)

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

Volumn 1302 LNCS, Issue , 1997, Pages 396-405

  Jones, Neil D ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MODEL CHECKING; PROGRAM INTERPRETERS;

ABSTRACT INTERPRETATIONS; CODE GENERATION; INPUT PROGRAMS; PARTIAL EVALUATION; PROGRAM TRANSFORMATIONS; TALK SHOWS; TO EFFECT;

STATIC ANALYSIS;

EID: 0002168627     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032761     Document Type: Conference Paper

References (14)

1. Samson Abramsky and Chris Hankin, editors. Abstract Interpretation of Declarative Languages. Ellis Horwood, 1987.
2. Charles Consel and Olivier Danvy, Partial evaluation of pattern matching in strings. Information Processing Letters, 30, pp. 79-86, January 1989.
3. Patrick Cousot and Radhia Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Fourth ACM Symposium on Principles on Programming Languages, pp. 238-252, New York: ACM Press, 1977.
4. Andrei P. Ershov. Mixed computation: Potential applications and problems for study. Theoretical Computer Science, 18, pp. 41-67, 1982.
5. Robert Glück and Andrei V. Klimov, Occam’s razor in metacomputation: the notion of a perfect process tree. In Static analysis Proceedings, eds. P. Cousot, M. Falaschi, G. File, G. Rauzy. Lecture Notes in Computer Science 724, pp. 112-123, Springer-Verlag, 1993.
6. C.V. Hall, Using Hindley-Milner type inference to optimise list representation. In ACM Conference on Lisp and Functional Programming, pp. 162-172, ACM Press, 1994.
7. Neil D. Jones, C.K. Gomard, P. Sestoft, Partial Evaluation and Automatic Program Generation, Prentice Hall International Series in Computer Science, 1993.
8. Neil D. Jones and Hemming Nielson, Abstract interpretation: a semantics-based tool for program analysis, 122 pages. In Handbook of Logic in Computer Science, Oxford University Press, 1995.
9. Neil D Jones and Steven S Muchnick, Complexity of flow analysis, inductive assertion synthesis, and a language due to Dijkstra, pages 380-393. In Program Flow Analysis: Theory and Applications, Prentice-Hall, 1981.
10. Neil D. Jones, Automatic program specialization: A re-examination from basic principles, in D. Bjørner, A.P. Ershov, and N.D. Jones (eds.), Partial Evaluation and Mixed Computation, pp. 225-282, Amsterdam: North-Holland, 1988.
11. N. D. Jones, The Essence of Program Transformation by Partial Evaluation and Driving, in Logic, Language and Computation, a Festschrift in honor of Satoru Takasu, edited by Masahiko Sato N. D. Jones, Masami Hagiya, pages 206-224, S-V, April 1994.
12. Donald E. Knuth, James H. Morris, and Vaughan R. Pratt, Fast pattern matching in strings, SIAM Journal of Computation, 6(2), pp. 323-350, 1977.
13. Shao, Z., J.H. Reppy, A.W. Appel, Unrolling lists. In ACM Conference on Lisp and Functional Programming, pp. 185-195, ACM Press, 1994.
14. V.F. Turchin, ‘The concept of a supercompiler,' ACM Transactions on Programming Languages and Systems, 8(3): 292-325, July 1986.