Computing Amorphous Program Slices Using Dependence Graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

David W. Binkley. Computing Amorphous Program Slices Using Dependence Graphs. In SAC. pages 519-525, 1999. [doi]

The following publications are possibly variants of this publication:

Amorphous procedure extractionHarman, M., Binkley, D., Singh, R., Hierons, R.M.. In Source Code Analysis and Manipulation, 2004. Fourth IEEE International Workshop on. 2004: [doi]

Formalizing executable dynamic and forward slicingBinkley, D., Danicic, S., Gyimothy, T., Harman, M., Kiss, A., Ouarbya, L.. In Source Code Analysis and Manipulation, 2004. Fourth IEEE International Workshop on. 2004: [doi]

Amorphous program slicingMark Harman, David W. Binkley, Sebastian Danicic. jss, 68(1):45-64, 2003. [doi]

runs on WebDSL