Efficient comparison of program slices

This publication has 13 references indexed in Scilit:

• Identifying the semantic and textual differences between two versions of a program
  ACM SIGPLAN Notices, 1990
• Interprocedural slicing using dependence graphs
  ACM Transactions on Programming Languages and Systems, 1990
• Integrating noninterfering versions of programs
  ACM Transactions on Programming Languages and Systems, 1989
• An efficient method of computing static single assignment form
  Published by Association for Computing Machinery (ACM) ,1989
• On the adequacy of program dependence graphs for representing programs
  Published by Association for Computing Machinery (ACM) ,1988
• The program dependence graph and its use in optimization
  ACM Transactions on Programming Languages and Systems, 1987
• The program dependence graph in a software development environment
  ACM SIGPLAN Notices, 1984
• Isomorphism of graphs of bounded valence can be tested in polynomial time
  Journal of Computer and System Sciences, 1982
• Group-Theoretic Algorithms and Graph Isomorphism
  Lecture Notes in Computer Science, 1982
• On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup
  IEEE Transactions on Computers, 1972