Efficient comparison of program slices

DOI10.1007/BF01261653zbMATH Open0724.68014MaRDI QIDQ758192FDOQ758192

Authors: Susan Horwitz, Thomas Reps 

Publication date: 1991

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

Recommendations

• An efficient method for computing dynamic program slices
• A parallel algorithm for static program slicing
• On optimal slicing of parallel programs
• scientific article; zbMATH DE number 2087514
• Program Slicing
• A novel formal approach to program slicing

zbMATH Keywords

intermediate program representationprogram dependence graphprogram slices

Mathematics Subject Classification ID

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

Cites Work

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup

Cited In (7)

• Title not available (Why is that?)
• On the computational complexity of dynamic slicing problems for program schemas
• Title not available (Why is that?)
• Abstract similarity analysis
• Integrating different versions of programs with backward and forward slices
• An optimal algorithm for the construction of the system dependence graph
• An efficient method for computing dynamic program slices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758192)