Implementation techniques for efficient data-flow analysis of large programs
Implementation techniques for efficient data-flow analysis of large programs
复制标题
大型程序高效数据流分析的实现技术
DOI：
10.1109/icsm.2001.972711
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
W. Griswold
中科院分区：
文献类型：
--
作者：
Darren C. Atkinson;W. Griswold
许多软件工程工具（例如程序切片机）必须执行数据流分析，以便从程序源中提取必要的信息。这些工具通常会从优化编译器中借用大部分实施。但是，由于这些工具有望整体分析程序，而不是孤立地分析程序，因此数据流分析的时间和空间性能是主要问题。我们提出了减少对大型程序进行数据流分析所需的时间和空间的技术。我们已经使用这些技术来为C程序实施高效的程序切片工具，并计算了具有超过100,000行代码的程序片。
Many software engineering tools such as program slicers must perform data-flow analysis in order to extract necessary information from the program source. These tools typically borrow much of their implementation from optimizing 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 dataflow analyses are of major concern. We present techniques that reduce the time and space required to perform dataflow analysis of large programs. We have used these techniques to implement an efficient program slicing tool for C programs and have computed slices of programs with more than 100,000 lines of code.