Efficient comparison of program slices

Acta Informatica

Volumn 28, Issue 8, 1991, Pages 713-732

  Horwitz, Susan ^a   Reps, Thomas ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - PROGRAMMING THEORY; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

PROGRAM DEPENDENCE GRAPHS; PROGRAM SLICES;

COMPUTER PROGRAMMING;

EID: 0026261209     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/BF01261653     Document Type: Article

References (19)

1. An efficient method of computing static single assignment form
2. The program dependence graph and its use in optimization
3. On the adequacy of program dependence graphs for representing programs
4. Integrating non-interfering versions of programs
5. Identifying the semantic and textual differences between two versions of a program. Proceedings of the SIGPLAN 90 Conference on Programming Language Design and Implementation
6. Interprocedural slicing using dependence graphs
7. On the number of operations simultaneously executable in FORTRAN-like programs and their resulting speed-up
8. Isomorphism of bounded valence can be tested in polynomial time
9. The program dependence graph in a software development environment. Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments
10. Program slicing