Abstract | ||
---|---|---|
The program dependence graph (PDG) represents data and control dependences between statements in a program. The PDG is a useful intermediate representation for compiler code optimizations, because compiler code optimizations mostly rely on data and control dependence information. However, the validity of optimization methods based on PDGs has not been well studied. In order to justify optimization based on PDGs, it is necessary to introduce a formal semantics of PDGs. This paper presents an operational semantics of PDGs corresponding to programs which have an unstructured control flow. Our PDG semantics is equivalent to sequential program semantics in the sense that a CFG and the corresponding PDG perform the same computation. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1007/978-3-540-77505-8_22 | ASIAN |
Keywords | Field | DocType |
program dependence graph,unstructured control flow,control dependence,compiler code,control dependence information,unstructured program,program semantics,corresponding pdg,operational semantics,pdg semantics,formal semantics,control flow,code optimization,intermediate representation | Graph,Operational semantics,Program Dependence Graph,Programming language,Computer science,Control flow,Theoretical computer science,Compiler,Intermediate language,Semantics,Computation | Conference |
Volume | ISSN | ISBN |
4435 | 0302-9743 | 3-540-77504-8 |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Souhei Ito | 1 | 2 | 1.05 |
Shigeki Hagihara | 2 | 78 | 12.33 |
Naoki Yonezaki | 3 | 107 | 20.02 |