Dynamic dependence in term rewriting systems and its application to program slicing

Information and Software Technology

Volumn 40, Issue 11-12, 1998, Pages 609-636

  Field, John ^a   Tip, Frank ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Dependence analysis; Origin tracking; Program slicing; Term rewriting

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE SELECTION AND EVALUATION; PROGRAM DEBUGGING; THEOREM PROVING;

PROGRAM SLICING; TERM REWRITING SYSTEMS (TRS);

SOFTWARE ENGINEERING;

EID: 0032295096     PISSN: 09505849     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0950-5849(98)00087-1     Document Type: Article

References (32)

1. M. Abadi, B. Lampson, J.-J. Lévy, Analysis and caching of dependencies, in: Proc. of 1996 ACM SIGPLAN International Conference on Functional Programming (1996), pp. 83-91. ACM SIGPLAN Notices 31(6).
2. L. Aceto, B. Bloom, F. Vaandrager, Turning SOS rules into equations, in: Proc. IEEE Symp. on Logic in Computer Science, Santa Cruz, CA, June 1992, pp. 113-124.
3. A. Aho, J. Hopcroft, J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
4. H. Barendregt, M. van Eekelen, J. Glauert, J. Kennaway, M. Plasmeijer, M. Sleep, Term graph rewriting, in: Proc. PARLE Conference, Vol. II: Parallel Languages (Eindhoven, The Netherlands, 1987), Springer-Verlag, pp. 141-158. Lecture Notes in Computer Science 259.
5. J.A. Bergstra, T.B. Dinesh, J. Field, J. Heering, Toward a complete transformational toolkit for compilers. ACM Trans, on Programming Languages and Systems 5, 19 (September 1997), 639-684.
6. Y. Bertot, Occurrences in debugger specifications, in: Proc. ACM SIGPLAN '91 Conf. on Programming Language Design and Implementation, Toronto, June 1991, pp. 327-336.
7. Y. Bertot, Origin functions on λ-calculus and term rewriting systems, in: J.-C. Raoult (Ed.), Proc. Seventeenth CAAP (1992), vol. 581 of LNCS, Springer-Verlag, pp. 49-64.
8. R. Cartwright, M. Felleisen, The semantics of program dependence, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, Portland, OR, 1989, pp. 13-27.
9. A. van Deursen, P. Klint, F. Tip, Origin tracking, J. Symbolic Computation 15 (1993) 523-545.
10. T.B. Dinesh, F. Tip, A case study of a slicing-based approach for locating type errors, in: M.P.A. Sellink (Ed.), Proc. Second International Workshop on Theory and Practice of Algebraic Specifications (ASF + SDF'97) (Amsterdam, The Netherlands, September 1997), Electronic Workshops in Computing, Springer-Verlag.
11. T.B. Dinesh, F. Tip, A slicing-based approach for locating type errors, in: Proc. USENIX Conference on Domain-Specific Languages (DSL'97) Santa Barbara, CA, October 15-17 1997, pp. 77-88.
12. J. Ferrante, K.J. Ottenstein, J.D. Warren, The program dependence graph and its use in optimization, ACM Trans, on Programming Languages and Systems 9, 3 (July 1987) 319-349.
13. J. Field, On laziness and optimality in lambda interpreters: Tools for specification and analysis, in: Proc. Seventeenth ACM Symp. on Principles of Programming Languages, San Francisco, January 1990, pp. 1-15.
14. J. Field, G. Ramalingam, F. Tip, Parametric program slicing, in: Conference Record of the Twenty-Second ACM Symposium on Principles of Programming Languages, San Francisco, CA, 1995, pp. 379-392.
15. J. Field, F. Tip, Dynamic dependence in term rewriting systems and its application to program slicing, in: M. Hermenegildo, J. Penjam (Eds.), Proc. Sixth International Symposium on Programming Language Implementation and Logic Programming (September 1994), vol. 844, Springer-Verlag, pp. 415-431.
16. R. Fraer, Reasoning with executable specifications, in: P.D. Mosses, M. Nielsen, M.I. Schwartzbach (Eds.), Proc. Sixth International Joint Conference on Theory and Practice of Software Development (Aarhus, Denmark, May 1995), 1915 of LNCS, Springer-Verlag, pp. 531-545.
17. R. Fraer, Analyse de Programmes Annotés par des Assertions. PhD thesis, L'Université de Nice, Sophia Antipolis, November 1997. In French.
18. J. Hopcroft, R. Karp, An algorithm for testing the equivalence of finite automata. Tech. Rep. TR-71-114, Dept. of Computer Science, Cornell University, Ithaca, NY, 1971.
19. G. Kahn, Natural semantics, in: Fourth Annual Symp. on Theoretical Aspects of Computer Science (1987), vol. 247 of LNCS, Springer-Verlag, pp. 22-39.
20. J.R. Kennaway, J.W. Klop, M.R. Sleep, F.J. de Vries, On the adequacy of graph rewriting for simulating term rewriting, ACM Trans, on Programming Languages and Systems 16(3) (1994) 493-523.
21. J. Klop, Term rewriting systems, in: S. Abramsky, D. Gabbay, T. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2. Background: Computational Structures, Oxford University Press, 1992, pp. 1-116.
22. L. Maranget, Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems, in: Proc. Eighteenth ACM Symp. on Principles of Programming Languages, Orlando, FL, January 1991, pp. 255-269.
23. L. Maranget, La Stratégie Paresseuse. PhD thesis, Université de Paris VIII, 1992. (in French).
24. R. Milner, M. Tofte, R. Harper, The Definition of Standard ML, The MIT Press, Cambridge, MA, 1990.
25. K.J. Ottenstein, L.M. Ottenstein, The program dependence graph in a software development environment, in: Proc. ACM SIGPLAN/ SIGSOFT Symp. on Practical Programming Development Environments (April 1984), pp. 177-184. SIGPLAN Notices 19(5).
26. S.L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice Hall International, Englewood Cliffs, NJ, 1987.
27. F. Tip, Generation of Program Analysis Tools. PhD thesis, University of Amsterdam, 1995.
28. F. Tip, Generic techniques for source-level debugging and dynamic program slicing, in: P.D. Mosses, M. Nielsen, M.I. Schwartzbach (Eds.), Proc. Sixth International Joint Conference on Theory and Practice of Software Development (Aarhus, Denmark, May 1995), vol. 915 of LNCS, Springer-Verlag, pp. 516-530.
29. F. Tip, A survey of program slicing techniques, Journal of Programming Languages 3(3) (1995) 121-189.
30. G. Venkatesh, The semantic approach to program slicing, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, Toronto, June 1991, pp. 80-91.
31. P. Wadler, R. Hughes, Projections for strictness analysis, in: Proc. Conf. on Functional Programming and Computer Architecture (Portland, OR, September 1987), vol. 274 of LNCS, Springer-Verlag, pp. 385-406.
32. M. Weiser, Program slicing, IEEE Trans. on Software Engineering SE-10 4 (1989) 352-357.