For many years, the generally accepted methods for solving global data flow analysis problems (GDFAPs) have relied on the bit vector paradigm [Alle 70] [Kenn 81]. In these algorithms, the information for each variable...
详细信息
The program summary graph is an effective data structure for solving the flow-sensitive summary problems KILL and USE. By summarizing local control flow with reaching information and exploiting bit-vector techniques f...
详细信息
We present an efficient array data flow analysis based global communication optimizer which manages the analysis cost by partitioning the dataflow problems into subproblems and solving the subproblems one at a time i...
详细信息
Global analysis and optimization techniques presuppose local dataflow information about the effects of program statements on the values associated wRh names For procedure calls this information is not immediately ava...
详细信息
The ever increasing need to ensure that code is reliably, efficiently and safely constructed has fueled the evolution of popular static binary code analysis tools. In identifying potential coding flaws in binaries, to...
详细信息
With the wide application of new power services, the continuous strengthening of plant network coordination and interaction, resulting in a large extension of data network, network security protection is more difficul...
详细信息
data flow analysis is a time-consuming part of the optimization process. As transformations are made in a multiple pass global optimizer, the dataflow information must be updated to reflect these changes. Various app...
详细信息
The performance of scientific programs on superscalar processors can be significantly degraded by memory references that frequently arise due to load and store operations associated with array references. Therefore, r...
详细信息
In [18] a three level model was presented to establish a concept of completeness or optimality for data flow analysis algorithms in the framework of abstract interpretation [2]. The notion of observational equivalence...
详细信息
暂无评论