T. Takada, F. Ohata and K. Inoue: "DependenceCache Slicing: A Program Slicing Method Using Lightweight Dynamic Information", Proceedings of the 10th International Workshop on Program Comprehension (IWPC2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Java Program Analysis Projects in Osaka University.. - Yokomori, Ishio.. (Correct)
....which extracts all statements that possibly affect some set of variables in the program. The set of all extracted statements is called a slice. We have been extended the program slicing to DC slicing, using dynamic data dependence information to calculate accurate slices with lightweight costs [6]. In process of DC slice calculation, it is an important issue how to analyze dynamic data dependence. In the past research, such function have not been encapsulated in a single module. Actually, the function was implemented as a pre processor which inserts analysis operations in the target ....
T. Takada et al.:"Dependence-Cache Slicing: A Program Slicing Method Using Lightweight Dynamic Information ", Proceedings of IWPC2002.
Design and Implementation of Bytecode-based Java Slicing .. - Umemori, Konda.. Self-citation (Inoue) (Correct)
....a single execution path, and it can give narrower slices than static slices. However, the dynamic slicing requires a large amount of execution time, and the execution trace grows to an enormous size. We have proposed a technique called DC slicing which combined both the static and dynamic slicing [4, 15, 19]. Consider a variable v on a statement s and input variables set at execution is . The triple (X , s, v) is called a DC slicing criterion. DC Slice Computation Process] Computation process of a DC slice is as follows. Phase 1: Static Control Dependence Analysis We extract CD relations ....
T. Takada, F. Ohata and K. Inoue: "DependenceCache Slicing: A Program Slicing Method Using Lightweight Dynamic Information", Proceedings of the 10th International Workshop on Program Comprehension (IWPC2002.
Application of Aspect-Oriented Programming to Calculation .. - Ishio, Kusumoto, Inoue Self-citation (Inoue) (Correct)
....process, it is effective to observe program execution, and to use information about statements actually executed. Dependence Cache (DC) slicing has been proposed to use dynamic data dependence analysis and static control dependence analysis to calculate accurate slices with lightweight costs [2, 14]. Ohata et al. extends DC slicing method for Object Oriented languages [12] In process of DC slice calculation of Java, it is an important issue how to analyze dynamic data dependence. An analyzer may implement function that observes target program to track and to collect information about ....
....paths, includes paths which may be never executed. If we use program slicing for debugging and program understanding, it is effective to analyze detailed information about one program execution path with a specific input. Dependence Cache (DC) slicing has been proposed to realize such requirement [2, 12, 14]. In DC slice calculation, the data dependence analysis is performed during program execution, and the information of dynamically determined elements is collected. Control dependence is analyzed statically from source code since it needs much cost to analyze control dependence during program ....
[Article contains additional citation context not shown here]
T. Takada, F. Ohata, K. Inoue: "Dependence-Cache Slicing: A Program Slicing Method Using Lightweight Dynamic Information", Proceedings of the 10th International Workshop on Program Comprehension (IWPC2002.
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