Structural Properties of Post-Dominator Trees

Authors:
T. Y. Chen;Y. Y. Cheung
Affiliations:
-;-
Venue:
ASWEC '97 Proceedings of the Australian Software Engineering Conference
Year:
1997

Citing 6
Cited 0

The program dependence graph and its use in optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Interprocedural slicing using dependence graphs

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Dynamic program slicing

Information Processing Letters
Dynamic program slicing

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Interprocedural Dynamic Slicing Applied to Interprocedural Data How Testing

ICSM '93 Proceedings of the Conference on Software Maintenance

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concepts of post dominators and post dominator trees are extensively used in code optimisation (J. Ferrante et al., 1987), program slicing (H. Agrawal and J.R. Horgan, 1990) and test suite reduction (R. Gupta and M.L. Soffa, 1093). The paper studies some characteristics of post dominator trees. These results can form the basis for the development of a more efficient construction algorithm of post dominator tree.