Efficient comparison of program slices

DOI10.1007/BF01261653zbMath0724.68014MaRDI QIDQ758192

Susan Horwitz, Thomas W. Reps

Publication date: 1991

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

intermediate program representationprogram dependence graphprogram slices

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20) General topics in the theory of software (68N01)

Cites Work

• Unnamed Item
• Unnamed Item
• Group-theoretic algorithms and graph isomorphism
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Program Slicing
• The program dependence graph and its use in optimization
• On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup

This page was built for publication: Efficient comparison of program slices