| | |
Summary: Implementation Techniques for Efficient
Data-Flow Analysis of Large Programs
Darren C. Atkinson
Dept. of Computer Engineering
Santa Clara University
Santa Clara, CA 95053-0566 USA
atkinson@engr.scu.edu
William G. Griswold
Dept. of Computer Science and Engineering
University of California San Diego
La Jolla, CA 92093-0114 USA
wgg@cs.ucsd.edu
Abstract
Many software engineering tools such as program slicers
must perform data-flow analysis in order to extract nec-
essary information from the program source. These tools
typically borrow much of their implementation from opti-
mizing compilers. However, since these tools are expected
to analyze programs in their entirety, rather than functions
in isolation, the time and space performance of the data-
|
