R. Ballance and B. Maccabe. Program dependence graphs for the rest of us. Technical report, University of New Mexico, November 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....relationship does not hold (see Appendix A for details) Our Definition 12 clarifies the application of Podgurski and Clarke s (and other flow graph based) definitions of control dependence to the interprocedural setting. Various algorithms for calculating control dependences exist (e.g. [2, 3, 6, 8, 10, 17]) Some of these algorithms (e.g. 2, 10] operate on abstract syntax trees for individual procedures, and are therefore strictly intraprocedural. As presented, most other algorithms operate on control flow graphs. We have shown that when such algorithms are applied independently to control flow ....

....details) Our Definition 12 clarifies the application of Podgurski and Clarke s (and other flow graph based) definitions of control dependence to the interprocedural setting. Various algorithms for calculating control dependences exist (e.g. 2, 3, 6, 8, 10, 17] Some of these algorithms (e.g. [2, 10]) operate on abstract syntax trees for individual procedures, and are therefore strictly intraprocedural. As presented, most other algorithms operate on control flow graphs. We have shown that when such algorithms are applied independently to control flow graphs for individual procedures in ....

R. Ballance and B. Maccabe. Program dependence graphs for the rest of us. Technical report, University of New Mexico, November 1992.

....if clause is executed when predicate P is true. When P is true, control flows immediately to the enclosing loop header. When P is false, however, statements after S are executed. Thus, statements after S are control dependent upon P. The idea of follow regions is presented by Ballance and Maccabe[3] to account for such control dependencies. A follow region summarizes the control dependencies of statements occurring after a compound statement. For example, the code after S constitutes a region that follows S and is control dependent on P false. The use of follow regions applies to nested ....

R. Ballance and B. Maccabe, "Program dependence graphs for the rest of us," Technical Report, University of New Mexico, November 1992.

....relationship does not hold (see Appendix A for details) Our Definition 12 clarifies the application of Podgurski and Clarke s (and other flow graph based) definitions of control dependence to the interprocedural setting. Various algorithms for calculating control dependences exist (e.g. [2, 3, 6, 8, 10, 17]) Some of these algorithms (e.g. 2, 10] operate on abstract syntax trees for individual procedures, and are therefore strictly intraprocedural. As presented, most other algorithms operate on control flow graphs. We have shown that when such algorithms are applied independently to control flow ....

....details) Our Definition 12 clarifies the application of Podgurski and Clarke s (and other flow graph based) definitions of control dependence to the interprocedural setting. Various algorithms for calculating control dependences exist (e.g. 2, 3, 6, 8, 10, 17] Some of these algorithms (e.g. [2, 10]) operate on abstract syntax trees for individual procedures, and are therefore strictly intraprocedural. As presented, most other algorithms operate on control flow graphs. We have shown that when such algorithms are applied independently to control flow graphs for individual procedures in ....

R. Ballance and B. Maccabe. Program dependence graphs for the rest of us. Technical Report 92-10, University of New Mexico, November 1992.

....relationship does not hold (see Appendix A for details) Our Definition 12 clarifies the application of Podgurski and Clarke s (and other flow graph based) definitions of control dependence to the interprocedural setting. Various algorithms for calculating control dependences exist (e.g. [Ballance and Maccabe 1992; Bilardi and Pingali 1996; Cytron et al. 1991; Ferrante et al. 1987; Harrold and Rothermel 1996; Loyall and Mathisen 1993] Some of these algorithms (e.g. Ballance and Maccabe 1992; Harrold and Rothermel 1996] operate on abstract syntax trees for individual procedures, and are therefore, ....

....dependence to the interprocedural setting. Various algorithms for calculating control dependences exist (e.g. Ballance and Maccabe 1992; Bilardi and Pingali 1996; Cytron et al. 1991; Ferrante et al. 1987; Harrold and Rothermel 1996; Loyall and Mathisen 1993] Some of these algorithms (e.g. [Ballance and Maccabe 1992; Harrold and Rothermel 1996] operate on abstract syntax trees for individual procedures, and are therefore, strictly intraprocedural. As presented, most other algorithms operate on control flow graphs. We have shown that when such algorithms are applied independently to control flow graphs for ....

Ballance, R. and Maccabe, B. 1992. Program dependence graphs for the rest of us. Technical Report 92-10 (Nov.), University of New Mexico.

....relationship does not hold (see Appendix A for details) Our De nition 9 clari es the application of Podgurski and Clarke s (and other ow graph based) de nitions of control dependence to interprocedural control dependence. Various algorithms for calculating control dependencies exist (e.g. [3, 4, 6, 8, 9, 14]) Some of these algorithms (e.g. 3, 9] operate on abstract syntax trees for individual procedures, and are therefore strictly intraprocedural. As presented, most other algorithms operate on control ow graphs. We have shown that when such algorithms are applied independently to control ow ....

....Our De nition 9 clari es the application of Podgurski and Clarke s (and other ow graph based) de nitions of control dependence to interprocedural control dependence. Various algorithms for calculating control dependencies exist (e.g. 3, 4, 6, 8, 9, 14] Some of these algorithms (e.g. [3, 9]) operate on abstract syntax trees for individual procedures, and are therefore strictly intraprocedural. As presented, most other algorithms operate on control ow graphs. We have shown that when such algorithms are applied independently to control ow graphs for individual procedures in program ....

R. Ballance and B. Maccabe. Program dependence graphs for the rest of us. Technical report, University of New Mexico, November 1992.

....provides syntax directed construction of PDGs without first computing control flow or postdominance information, it requires less time and space than traditional approaches for constructing PDGs. Ballance and Maccabe also presented a syntax directed technique for computing control dependence [6]. Unlike their technique, our algorithm computes control dependencies correctly for control structures that contain exit statements or multiple transfers of control. Also, when possible, our algorithm identifies gotos that are used as structured exits, and computes control dependencies for such ....

....S2, such that the if clause is executed when predicate P2 is true. When P2 is true, control flows back to S1. However, when P2 is false, statements after the if else (S4 in the figure) are executed. Thus, statements after the if else statement are control dependent on P2. Ballance and Maccabe[6] present the concept of follow regions to account for such control dependencies. A follow region summarizes the control dependencies for statements that appear after a compound statement. For example, the code after if else statement S2 in Fragment A constitutes a region that follows the if else ....

[Article contains additional citation context not shown here]

R. Ballance and B. Maccabe, "Program dependence graphs for the rest of us," Technical Report, University of New Mexico, November 1992.

....from the AST (Chapter III) The star diagram shows that a simple cohesion metric such as enclosed in and same operation as can identify tightly cohesive statements. As others have shown, the parsed source code allows quick analysis for some dataflow and control flow [Cousot Cousot 77, Ballance Maccabe 92] The star diagram presents a case where the imprecise dataflow enables us to generate abstractions of the code that are meaningful to the programmer for the task of encapsulation. Focused Visualizations Support Restructuring Software contains multiple constraints and connections between ....

R. A. Ballance and A. B. Maccabe. Program dependence graphs for the rest of us. Technical Report CS92-10, Department of Computer Science, University of New Mexico, 1992.

....the syntactic semantic relationship does not hold [11] Our definition 9 clarifies the application of Podgurski and Clarke s (and other flow graph based) definitions of control dependence to interprocedural control dependence. Various algorithms for calculating control dependencies exist (e.g. [3, 4, 6, 8, 9, 15, 17]) Some of these algorithms (e.g. 3, 9] operate on abstract syntax trees for individual procedures, and are therefore strictly intraprocedural. As presented, most other algorithms operate on control flow graphs. We have shown that when such algorithms are applied independently to control flow ....

....Our definition 9 clarifies the application of Podgurski and Clarke s (and other flow graph based) definitions of control dependence to interprocedural control dependence. Various algorithms for calculating control dependencies exist (e.g. 3, 4, 6, 8, 9, 15, 17] Some of these algorithms (e.g. [3, 9]) operate on abstract syntax trees for individual procedures, and are therefore strictly intraprocedural. As presented, most other algorithms operate on control flow graphs. We have shown that when such algorithms are applied independently to control flow graphs for individual procedures in ....

R. Ballance and B. Maccabe. Program dependence graphs for the rest of us. Technical report, University of New Mexico, Nov. 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