Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Precise executable interprocedural slices

Precise executable interprocedural slices Precise Executable Interprocedural DAVID BINKLEY Loyola College Slices The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, program integration, and software maintenance. A slice of a program is taken with respect to a program point p and a variable x; the slice consists of all slice is statements of the program that might affect the value of x at point p. An interprocedural a slice of an entire program, where the slice crosses the boundaries of procedure calls. Weiser ™s original interprocedural-slicing algorithm produces imprecise slices that are executable programs. A recent algorithm developed by Horwitz, Reps, and Binkley produces more precise (smaller) slices by more accurately identifying those statements that might affect the values of x at point p. These slices, however, are not executable. An extension to their algorithm that produces more precise executable interprocedural slices is described together with a proof of correctness for the new algorithm. Languages]: Categories and Subject Descriptors: D.3.3 [Programming structures; procedures, functions, and subroutines; and Features ”control Languages]: General Processors ”compilers; optimization Language D.3.4 Constructs [Programming Terms: Algorithms, Design Control dependence, data dependence, program dependence Additional Key Words and Phrases: graph, http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Letters on Programming Languages and Systems (LOPLAS) Association for Computing Machinery

Precise executable interprocedural slices

Download PDF
15 pages

Loading next page...
 
/lp/association-for-computing-machinery/precise-executable-interprocedural-slices-6k9niT8z4N
Publisher
Association for Computing Machinery
Copyright
Copyright © 1993 by ACM Inc.
ISSN
1057-4514
DOI
10.1145/176454.176473
Publisher site
See Article on Publisher Site

Abstract

Precise Executable Interprocedural DAVID BINKLEY Loyola College Slices The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, program integration, and software maintenance. A slice of a program is taken with respect to a program point p and a variable x; the slice consists of all slice is statements of the program that might affect the value of x at point p. An interprocedural a slice of an entire program, where the slice crosses the boundaries of procedure calls. Weiser ™s original interprocedural-slicing algorithm produces imprecise slices that are executable programs. A recent algorithm developed by Horwitz, Reps, and Binkley produces more precise (smaller) slices by more accurately identifying those statements that might affect the values of x at point p. These slices, however, are not executable. An extension to their algorithm that produces more precise executable interprocedural slices is described together with a proof of correctness for the new algorithm. Languages]: Categories and Subject Descriptors: D.3.3 [Programming structures; procedures, functions, and subroutines; and Features ”control Languages]: General Processors ”compilers; optimization Language D.3.4 Constructs [Programming Terms: Algorithms, Design Control dependence, data dependence, program dependence Additional Key Words and Phrases: graph,

Journal

ACM Letters on Programming Languages and Systems (LOPLAS) – Association for Computing Machinery

Published: Mar 1, 1993

There are no references for this article.