B. Scholz, J. Bileberger, and T. Fahringer, Symbolic Pointer Analysis for Detecting Memory Leaks, ACM SIGPLAN Workshop on "Partial Evaluation and SemanticsBased Program Manipulation" (PEPM'00) (Boston). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Symbolic Data Flow Analysis for Detecting - Deadlocks In Ada Self-citation (Scholz Analysis) (Correct)
.... symbolic evaluation has been successfully applied to the reaching definitions problem [2] to worst case execution time analysis [1] to cache hit prediction [4] to alias analysis [3] to optimization problems of High Performance Fortran [12] and to pointer analysis for detecting memory leaks [17]. The underlying program representation for symbolic evaluation is the control flow graph (CFG) a directed labelled graph. Its nodes are basic blocks containing the program statements, whereas its edges represent transfers of control between basic blocks. Each edge of the CFG is assigned a ....
....for a given state i at a certain program point. For all nodes in the CFG, a set of symbolic equations is used to compute program contexts. The equation system is solved by an elimination algorithm for data flow analysis [16] 3 Symbolic Data Flow Equations for Tasking Programs In previous work [3, 17,4, 1] we have applied symbolic analysis for sequential programs. In order to analyze Ada programs with tasks we need a new form of analysis to cope with these notions of parallelism. To get a handle on the problem a new program representation, namely the tasking control flow graph (TCFG) is introduced ....
B. Scholz, J. Bileberger, and T. Fahringer, Symbolic Pointer Analysis for Detecting Memory Leaks, ACM SIGPLAN Workshop on "Partial Evaluation and SemanticsBased Program Manipulation" (PEPM'00) (Boston).
Symbolic Data Flow Analysis for Detecting Deadlocks.. - Blieberger.. (2000) (5 citations) Self-citation (Scholz Blieberger) (Correct)
.... symbolic evaluation has been successfully applied to the reaching definitions problem [2] to worst case execution time analysis [1] to cache hit prediction [4] to alias analysis [3] to optimization problems of High Performance Fortran [12] and to pointer analysis for detecting memory leaks [17]. The underlying program representation for symbolic evaluation is the control flow graph (CFG) a directed labelled graph. Its nodes are basic blocks containing the program statements, whereas its edges represent transfers of control between basic blocks. Each edge of the CFG is assigned a ....
....all nodes in the CFG, a set of symbolic equations is used to compute program contexts. The equation system is solved by an elimination algorithm for data flow analysis [16] Symbolic Deadlock Detection in Ada Tasking Programs 3 3 Symbolic Data Flow Equations for Tasking Programs In previous work [3, 17, 4, 1] we have applied symbolic analysis for sequential programs. In order to analyze Ada programs with tasks we need a new form of analysis to cope with these notions of parallelism. To get a handle on the problem a new program representation, namely the tasking control flow graph (TCFG) is introduced ....
B. Scholz, J. Blieberger, and T. Fahringer, Symbolic Pointer Analysis for Detecting Memory Leaks, ACM SIGPLAN Workshop on "Partial Evaluation and SemanticsBased Program Manipulation" (PEPM'00) (Boston).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC