Static Slicing of Rewrite Systems

Electronic Notes in Theoretical Computer Science

Volumn 177, Issue 1, 2007, Pages 123-136

  Cheda, Diego ^a   Silva, Josep ^a   Vidal, Germán ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Program slicing; rewrite systems

Indexed keywords

APPROXIMATION THEORY; CODES (SYMBOLS); DATA REDUCTION; DATA STRUCTURES; PROGRAM DEBUGGING; SOFTWARE ENGINEERING;

PROGRAM SLICING; REWRITE SYSTEMS;

COMPUTER PROGRAMMING;

EID: 34248658257     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.01.010     Document Type: Article

References (13)

1. Alpuente M., Falaschi M., Ramis M.J., and Vidal G. Narrowing Approximations as an Optimization for Equational Logic Programs. In: Penjam J., and Bruynooghe M. (Eds). Proc. of PLILP'93. Tallinn (Estonia). LNCS 714 (1993), (Springer 391-409
2. Arts T., and Giesl J. Termination of term rewriting using dependency pairs. Theoretical Computer Science 236 1-2 (2000) 133-178
3. Baader F., and Nipkow T. Term Rewriting and All That (1998), Cambridge University Press
4. Ferrante J., Ottenstein K.J., and Warren J.D. The Program Dependence Graph and Its Use in Optimization. ACM Transactions on Programming Languages and Systems 9 3 (1987) 319-349
5. Field J., and Tip F. Dynamic Dependence in Term Rewriting Systems and its Application to Program Slicing. Information and Software Technology 40 11-12 (1998) 609-634
6. Kuck D.J., Kuhn R.H., Padua D.A., Leasure B., and Wolfe M. Dependence Graphs and Compiler Optimization. Proc. of the 8th Symp. on the Principles of Programming Languages (POPL'81). SIGPLAN Notices (1981) 207-218
7. Liu Y.A., and Stoller S.D. Eliminating Dead Code on Recursive Data. Science of Computer Programming 47 (2003) 221-242
8. Ochoa C., Silva J., and Vidal G. Dynamic Slicing Based on Redex Trails. Proc. of the ACM SIGPLAN 2004 Symposium on Partial Evaluation and Program Manipulation. (PEPM'04) (2004), ACM Press 123-134
9. Ochoa C., Silva J., and Vidal G. Lighweight Program Specialization via Dynamic Slicing. Workshop on Curry and Functional Logic Programming. (WCFLP 2005) (2005), ACM Press 1-7
10. Rodrigues N., and Barbosa L.S. Component Identification Through Program Slicing. Proc. of Formal Aspects of Component Software (FACS 2005). ENTCS (2005), Elsevier
11. Slagle J.R. Automated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity. Journal of the ACM 21 4 (1974) 622-642
12. Tip F. A Survey of Program Slicing Techniques. Journal of Programming Languages 3 (1995) 121-189
13. Weiser M.D. Program Slicing. IEEE Transactions on Software Engineering 10 4 (1984) 352-357