| Susan Horwitz and Thomas Reps. The use of program dependence graphs in software engineering. In ICSE '92: Proceedings of the 14th international conference on Software engineering, pages 392--411, New York, NY, USA, 1992. ACM Press. |
....effects of advice, advanced program analysis might help. As a starting point, many algorithms in this context require a dedicated representation of programs. A standard data structure used in this context are Dependence Graphs (DGs) Their efficient construction has been a research topic for years [3], but especially for object oriented languages like Java it is still discussed. As AspectJ is an extension to Java, an aspect oriented DG (ADG) is supposed to extend a Java DG. An operational semantics for subsets of Java[13] and AspectJ advice, modeled as method call interception [5] is ....
Susan B. Horwitz and Thomas W. Reps. The use of program dependence graphs in software engineering. In Proceedings of the Fourteenth International Conference on Software Engineering, pages 392--411, 1992.
....two procedural, i.e. we must consider how to compute intraprocedural and interprocdural slice. The algorithm for computing intraprocedural slice is graph reachable algorithm. The algorithm for computing interprocedural slice is two phase graph reachable, introduced by Susan B. Horwitz and etc. [10, 11] and Karl J. Ottenstein etc. 19] respectively. In object oriented program, the basic construct is class, except for considering all kinds of dataflow and control flow dependence relationships, we should also consider all other dependence relationships, such as inheritance dependence relationship, ....
Susan B. Horwitz and Thomas W. Reps. The use of program dependence graphs in software engineering. In Proceedings of the Fourteenth International Conference on Software Engineering, Melbourne, Australia, May 1992.
....dependence relation as a graph. In related work, the program dependence graph (PDG) KKL 81, FOW87, HPR88] represents both data and strong control dependence in a single graph. The PDG has been used as an internal program representation to facilitate many software development activities [OO84, HR92] ProDAG provides separate interfaces to each of the dependence relations above to support their independent use for testing, debugging and maintenance. ProDAG represents a program dependence relation as a dependence graph (DG) in terms of a control flow graph (CFG) and a defuse graph (DUG) both ....
Susan Horwitz and Thomas Reps. The use of program dependence graphs in software engineering. In Proceedings of the Fourteenth International Conference on Software Engineering, pages 392--411. ACM Press, May 1992.
....to its end node. The Program Dependence Graph (PDG) 25] extends the CFG to include data dependence information in a unified internal program representation. PDG s are ubiquitous in the literature on automatic parallelization and in compiler optimization for sequential machines. Horwitz and Reps [38] describe how PDG s are used in software engineering to facilitate program slicing, program difference detection and program version integration. Finally, the System Dependence Graph (SDG) 38] is an extension of the PDG representation that accounts for interprocedural control flow. 2.7 ....
....on automatic parallelization and in compiler optimization for sequential machines. Horwitz and Reps [38] describe how PDG s are used in software engineering to facilitate program slicing, program difference detection and program version integration. Finally, the System Dependence Graph (SDG) [38] is an extension of the PDG representation that accounts for interprocedural control flow. 2.7 Classical Program Transformation As used in the literature [9, 23, 62, 63] the term program transformation originally referred to the evolution from a specification to a program through a series ....
Susan Horwitz and Thomas Reps. The use of program dependence graphs in software engineering. In Proceedings of the 14th International Conference on Software Engineering, pages 392--411, 1992. (cited on page 20)
....of combining control and data dependences in a single representation, and of using region nodes to summarize nodes with a common set of control dependences. These are essential characteristics of the PDG, and have been used by all other PDG researchers [AJLS92, BHB89, CF89, FM85, FMS88, GS87, HR92, NP94, OE92, Sar91, Sel89, aDAF90, Ste93] Differentiation of node types was introduced by Gupta and Soffa [GS89] and is used by [AJLS92,BHB89,GS87,Sar91] Order among siblings was introduced by Gupta and Soffa [GS89] and is also used by [AJLS92] Hierarchical summary of information other than ....
.... information [AJLS92] execution frequency [Sar91] and execution time [Sar91] The PDG has been used for code motion [AJLS92, BR91, BHB89, FOW87, GS89, OE92, Sar91] program partitioning [Sar91] code vectorization [BHB89] register allocation [NP94] program slicing and software engineering [HR92, OE92] and code translation for dataflow machines [BMO90] It has also been used to study program semantics [CF89, Sel89] since it is more suitable than the CFG for representing the program s semantics and essential control dependences. 3.6.1.2. Subclassification of Group Nodes The generalized ....
[Article contains additional citation context not shown here]
Susan Horwitz and Thomas Reps. The Use of Program Dependence Graphs in Software Engineering. In International Conference on Software Engineering, pages 392--411, 1992.
No context found.
Susan Horwitz and Thomas Reps. The use of program dependence graphs in software engineering. In ICSE '92: Proceedings of the 14th international conference on Software engineering, pages 392--411, New York, NY, USA, 1992. ACM Press.
No context found.
Susan Horowitz, Thomas Reps, "The Use of Program Dependence Graphs in Software Engineering " Proceedings of the 14th International Conference on Software Engineering, Melbourne, Australia, May 1992.
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