Semantic program dependence graphs
| dc.contributor.advisor | Felleisen, Matthias | |
| dc.contributor.advisor | Cartwright, Robert S. | |
| dc.creator | Parsons, Rebecca Jane | |
| dc.date.accessioned | 2009-06-04T00:41:14Z | |
| dc.date.available | 2009-06-04T00:41:14Z | |
| dc.date.issued | 1992 | |
| dc.description.abstract | Semantic program dependence graphs, or semantic pdgs, are an attractive intermediate program representation for use in advanced optimizing and parallelizing compilers. The semantic pdg, which is based on the program dependence graph, has a compositional semantics that provides an elegant characterization of the types of dependences that arise in imperative programming languages. In addition, the semantic pdg has a simple operational semantics which serves as the basis of an equational calculus reasoning about semantic pdgs. Finally, the algorithms for creating the semantic pdg are efficient enough to allow the use of this program representation in actual compilers. The semantic pdg is the result of a study, using denotational semantics, into the notions of data and control dependence in imperative programming languages. Semantic pdgs include a new component, the valve node, which ensures the data flow character of the semantic pdg, even in the presence of conditional assignments, and provides the control information necessary to perform many important program optimizations. The valve node is a natural result of the derivation step that addresses the data dependence relation. The semantic pdg utilizes the new concept of a partial array to allow for optimizations of array accesses while maintaining the mathematical elegance of the data flow semantics of the pdg. The semantic pdg is not only an elegant representation from a mathematical perspective, but it is also a useful representation from a practical perspective. This structure is particularly well-suited for use in optimizing and parallelizing compilers since it explicates the important relationships among the different statements in a program. We have developed a program representation that is powerful enough to represent the behavior of a program, that provides the information needed to optimize the program, and that has a precise mathematical description. The development of the semantic pdg reconciles the often contradictory requirements of mathematical elegance and practicality. | |
| dc.format.extent | 214 p. | en_US |
| dc.format.mimetype | application/pdf | |
| dc.identifier.callno | Thesis Comp. Sci. 1992 Parsons | |
| dc.identifier.citation | Parsons, Rebecca Jane. "Semantic program dependence graphs." (1992) Diss., Rice University. <a href="https://hdl.handle.net/1911/16541">https://hdl.handle.net/1911/16541</a>. | |
| dc.identifier.uri | https://hdl.handle.net/1911/16541 | |
| dc.language.iso | eng | |
| dc.rights | Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. | |
| dc.subject | Computer science | |
| dc.title | Semantic program dependence graphs | |
| dc.type | Thesis | |
| dc.type.material | Text | |
| thesis.degree.department | Computer Science | |
| thesis.degree.discipline | Engineering | |
| thesis.degree.grantor | Rice University | |
| thesis.degree.level | Doctoral | |
| thesis.degree.name | Doctor of Philosophy |
Files
Original bundle
1 - 1 of 1