TY - JOUR

T1 - Iterative-free program analysis

AU - Ogawa, Mizuhito

AU - Hu, Zhenjiang

AU - Sasano, Isao

PY - 2003/9

Y1 - 2003/9

N2 - Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed point is commonly computed through an iterative procedure that repeats tracing until convergence. This paper proposes a new method to analyze programs through recursive graph traversals instead of iterative procedures, based on the fact that most programs (without spaghetti GOTO) have well-structured control flow graphs, graphs with bounded tree width. Our main techniques are; an algebraic construction of a control flow graph, called SP Term, which enables control flow analysis to be defined in a natural recursive form, and the Optimization Theorem, which enables us to compute optimal solution by dynamic programming. We illustrate our method with two examples; dead code detection and register allocation. Different from the traditional standard iterative solution, our dead code detection is described as a simple combination of bottom-up and top-down traversals on SP Term. Register allocation is more interesting, as it further requires optimality of the result. We show how the Optimization Theorem on SP Terms works to find an optimal register allocation as a certain dynamic programming.

AB - Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed point is commonly computed through an iterative procedure that repeats tracing until convergence. This paper proposes a new method to analyze programs through recursive graph traversals instead of iterative procedures, based on the fact that most programs (without spaghetti GOTO) have well-structured control flow graphs, graphs with bounded tree width. Our main techniques are; an algebraic construction of a control flow graph, called SP Term, which enables control flow analysis to be defined in a natural recursive form, and the Optimization Theorem, which enables us to compute optimal solution by dynamic programming. We illustrate our method with two examples; dead code detection and register allocation. Different from the traditional standard iterative solution, our dead code detection is described as a simple combination of bottom-up and top-down traversals on SP Term. Register allocation is more interesting, as it further requires optimality of the result. We show how the Optimization Theorem on SP Terms works to find an optimal register allocation as a certain dynamic programming.

KW - Catamorphism

KW - Control flow graph

KW - Dynamic programming

KW - Program analysis

KW - Register allocation

KW - SP term

KW - Tree width

UR - http://www.scopus.com/inward/record.url?scp=1442337722&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1442337722&partnerID=8YFLogxK

U2 - 10.1145/944746.944716

DO - 10.1145/944746.944716

M3 - Conference article

AN - SCOPUS:1442337722

VL - 38

SP - 111

EP - 123

JO - SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

JF - SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

SN - 1523-2867

IS - 9

T2 - Proceedings of the 2003 ACM SIGPLAN International Conference on Functional Programming

Y2 - 25 August 2003 through 29 August 2003

ER -