Deriving analysers by folding/unfolding of natural semantics and a case study: Slicing

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

Volumn 1503 LNCS, Issue , 1998, Pages 115-133

  Gouranton, Valérie ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DEFORESTATION; LOGIC PROGRAMMING; SEMANTICS;

ABSTRACT INTERPRETATIONS; BACKWARD SLICING; FOLD/UNFOLD; NATURAL SEMANTICS; PROGRAM TRANSFORMATIONS; RECURSIVE DEFINITIONS; SEMANTIC FUNCTIONS;

STATIC ANALYSIS;

EID: 84905026196     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49727-7_7     Document Type: Conference Paper

References (30)

1. S. Abramsky. Abstract interpretation, logical relations and Kan extensions. Journal of Logic and Computation, 1:5-40, 1990. 130, 130, 130
2. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24:44-67, 1977. 129
3. W.N. Chin. Automatic methods for program transformation. PhD thesis, Imperial College, 1990. 129
4. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, pages 238-252, 1977. 130, 131
5. J. Darlington. A synthesis of several sorting algorithms. Acta Informatica, 11:1-30, 1978. 129
6. J. Darlington and R. M. Burstall. A system which automatically improves programs. Acta Informatica, 6:41-60, 1976. 129
7. T. Despeyroux. Typol: a formalism to implement natural semantics. Technical Report 94, INRIA, France, 1988. 115
8. J. Field, G. Ramalingam, and F. Tip. Parametric program slicing. In POPL, pages 379-392, 1995. 129
9. A. Gill, J. Launchbury, and S.L. Peyton Jones. A short cut to deforestation. In FPCA, pages 223-232, 1993. 129
10. V. Gouranton. D érivation d'analyseurs dynamiques et statiques à partir de spécifications opérationnelles. PhD thesis, Université de Rennes, France, 1997. 116, 122, 130, 131, 131
11. V. Gouranton. Deriving analysers by folding/unfolding of natural semantics and a case study: slicing. Technical Report 3413, INRIA, France, 1998. 127
12. V. Gouranton and D. Le Métayer. Dynamic slicing: a generic analysis based on a natural semantics format. Technical Report 3375, INRIA, France, 1998. 115, 130, 131, 131, 131
13. H. Ibraheem and D. A. Schmidt. Adapting big-step semantics to small-step style: coinductive interpretations and "higher-order" derivations. In Second Workshop on Higher-Order Techniques in Operational Semantics (HOOTS2), 1997. 132
14. G. Kahn. Natural semantics. In STACS 87, number 247 in Lecture Notes in Computer Science, pages 22-39. Springer-Verlag, 1987. 115
15. B. Le Charlier, K. Musumbu, and P. Van Hentenryck. A generic interpretation algorithm and its complexity analysis. In ICLP, pages 64-78, 1991. 118, 129, 129
16. D. Miller and G. Nadathur. Higher-order logic programming. In ILPC, volume 225 of LNCS, pages 448-462, 1986. 117
17. H. Riis Nielson and F. Nielson. Semantics With Applications. John Wiley & Sons, 1992. 131
18. T. Reps and T. Turnidge. Program specialization via program slicing. In International Seminar on Partial Evaluation, 1996. 122
19. T. Reps and W. Yang. The semantics of program slicing. Technical Report 777, University of Wisconsin, Madison, 1988. 129
20. D. Sands. Proving the correctness of recursion-based automatic program transformations. In TAPSOFT. Springer-Verlag, 1995. 127
21. D. Sands. Total correctness by local improvement in the transformation of functional programs. TOPLAS, 18:175-234, 1996. 127
22. D.A. Schmidt. Abstract interpretation of small-step semantics. In 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages. LNCS, 1996. 132
23. S. Schoenig and M. Ducassé. A backward slicing algorithm for prolog. In SAS, number 1145 in LNCS, pages 317-331. Springer-Verlag, 1996. 122, 129, 130
24. B. Steffen. Generating data flow analysis algorithms from modal specifications. Science of Computer Science, 21(2):115-139, 1993. 129
25. F. Tip. A survey of program slicing techniques. Journal of Programming Languages, 3:121-189, 1995. 122
26. G.A. Venkatesh. A framework for construction and evaluation of high-level specifications for program analysis techniques. In PLDI, volume 24, pages 1-12, 1989. 129, 129
27. G.A. Venkatesh. The semantics approach to program slicing. In PLDI, pages 107-119, 1991. 129
28. P. Wadler. Deforestation: transforming programs to eliminate trees. Theoretical Computer Science, 73:231-248, 1990. 127, 129
29. M. Weiser. Program slicing. IEEE Transactions on Software Engineering, 4:352-357, 1984. 122
30. K. Yi and W. L. Harrison III. Automatic generation and management of interpro-cedural program analyses. In POPL, pages 246-259, 1993. 129, 129