Uwe Assmann. How To Uniformly Specify Program Analysis and Transformation. In P. Fritzson, editor, Compiler Construction (CC). Springer, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....destroyed. Such systems are strongly conAEuent since their direct derivations are commutative [A#m96a] If the system terminates, it yields a unique result and the weaving process is deterministic as in the case of EARS weavers. Termination for additive graph rewrite systems has been proven in [A#m96b] When a system completes a subgraph of the host graph and does not add nodes to it, it terminates. Those systems are called exhaustive GRS (XGRS) For weaving, this means that the aspect additive rule system completes a subgraph in the component graph to which it does not add nodes. In ....

....additive or modifying, inheriting the same formal features. An example for such a code motion weaver is RG, which optimizes the control and data AEow aspect in a component [MKL97] Such systems resemble standard code motion optimizations in compilers since they move code within the component [A#m96b] Their join points correspond to code statements in the component graph. nn nn Fig. 6. Rules weaving intra componently. Here, the rule moves a node n to another place. This concludes our classication of GRS based AOP weavers. It is likely that more classes will be found, which dioeer in ....

[Article contains additional citation context not shown here]

Uwe A#mann. How To Uniformly Specify Program Analysis and Transformation. In P. A. Fritzson, editor, Compiler Construction (CC), volume 1060 of Lecture Notes in Computer Science, pages 121135, Heidelberg, 1996. Springer.

....to run the optimizations. However, they do not provide a method for exploiting mutually beneficial transformations: when cyclic interactions are found between optimizations, a linear order is still chosen, based on experimental results or on the perceived importance of the optimizations. Assmann [3, 4] has developed a technique for uniformly specifying analyses and transformations using graph rewrite rules which trigger based on pattern matching. An analysis is defined by rewrite rules that add edges to the graph, thus creating a relation which encodes the analysis results. Transformations are ....

Uwe Assmann. How to uniformly specify program analysis and transformations with graph rewrite systems. In Proceedings of the CC'96. 6'th International Conference on Compiler Construction, pages 121--135. Springer-Verlag, April 1996.

....sequel to the earlier work on Genesis, aiming to automate some of the analysis tasks that were there performed by hand. It is quite likely that similar analyses can be applied to other formal notations that were inspired by Genesis, for instance Assmann s approach based on graph rewrite rules [1]. The OPT METAFrame toolkit of Knoop, Steffen and their coworkers [3] is also very similar to our work, so we are hopeful that a suitable generalisation of the present results could be of use there as well. We do not address the problem of ordering transformations once a conflict has been ....

Uwe Assmann. How To Uniformly Specify Program Analysis and Transformation. In P. Fritzson, editor, Compiler Construction (CC). Springer, 1996.

....encouraging comments are found on the postcard, the better General Topics This is the language manual for OPTIMIX, the optimizer generator. OPTIMIX can be used to generate program analyses and transformations in C language. Its input language is based on Datalog and graph rewriting [Am94] Am95] [Am96b]. Especially two new classes of graph rewrite systems are used: edge addition rewrite systems (EARS) and exhaustive graph rewrite systems (XGRS) The development of OPTIMIX has partially been supported by the Esprit project COMPARE (No. 5399) The tool is not in the public domain; however, a free ....

....graph rewrite systems (XGRS) The development of OPTIMIX has partially been supported by the Esprit project COMPARE (No. 5399) The tool is not in the public domain; however, a free version can be ordered from the author. It is highly recommended that the user first reads the papers [Am94] Am95] [Am96b] [Am96a] Am96a] and [ are available with the OPTIMIX package. 1.1 Design procedure for an optimizer In order to generate optimizer parts with OPTIMIX we propose the following procedure [Am96b] 1. Write down all preconditions for a transformation, perhaps in text. 2. Define the data ....

[Article contains additional citation context not shown here]

Uwe Amann. How To Uniformly Specify Program Analysis and Transformation. In P. A. Fritzson, editor, Compiler Construction (CC), volume 1060 of Lecture Notes in Computer Science, pages 121--135, Heidelberg, 1996. Springer.

....comments are found on the postcard, the better General Topics This is the language manual for OPTIMIX, the optimizer generator. OPTIMIX can be used to generate program analyses and transformations in C language. Its input language is based on Datalog and graph rewriting [Am94] Am95] [Am96b]. Especially two new classes of graph rewrite systems are used: edge addition rewrite systems (EARS) and exhaustive graph rewrite systems (XGRS) The development of OPTIMIX has partially been supported by the Esprit project COMPARE (No. 5399) The tool is not in the public domain; however, a free ....

....rewrite systems (XGRS) The development of OPTIMIX has partially been supported by the Esprit project COMPARE (No. 5399) The tool is not in the public domain; however, a free version can be ordered from the author. It is highly recommended that the user first reads the papers [Am94] Am95] [Am96b] [Am96a] Am98] Am94] Am96a] and [Am98] are available with the OPTIMIX package. 1.1 Design procedure for an optimizer In order to generate optimizer parts with OPTIMIX we propose the following procedure [Am96b] 1. Write down all preconditions for a transformation, perhaps in text. 2. ....

[Article contains additional citation context not shown here]

Uwe Amann. How To Uniformly Specify Program Analysis and Transformation. In P. A. Fritzson, editor, Compiler Construction (CC), volume 1060 of Lecture Notes in Computer Science, pages 121--135, Heidelberg, 1996. Springer.

....be applied to three major problem classes of program rewriting: graph reachability problems, context sensitive pattern match problems, and mark transform problems. Compilation tasks and program optimizations should be specied abstractly and easily. This is possible with graph rewrite systems [Am##b]. To facilitate the construction of program transformers and optimizers, tools are desired which generate algorithms from graph rewrite specications. OPTIMIX is such a tool. The central idea of OPTIMIX is to regard all of the information in a compiler (the intermediate representation) as a set of ....

....ending with an intermediate graph which is handed over to the back end for code generation. Hence, OPTIMIX s specication language is based on relational graph rewriting. In particular, OPTIMIX supports edge addition rewrite systems (EARS) and exhaustive graph rewrite systems (XGRS) Am##] Am##a] [Am##b]. EARS only add mirObject r rhs lhs mirObject r mirObjectAddr mirObject mirAssign mirMult mirObjectAddr mirConstant mirContent mirAssign mirObjectAddr mirObject mirMult mirObjectAddr mirConstant mirContent obj obj addr kids kids kids kids kids kids kids addr obj obj ....

[Article contains additional citation context not shown here]

Uwe Amann. How To Uniformly Specify Program Analysis and Transformation. In P. A. Fritzson, editor, Compiler Construction (CC), volume #### of Lecture Notes in Computer Science, pages #######, Heidelberg, ####. Springer.

....be applied to three major problem classes of program rewriting: graph reachability problems, context sensitive pattern match problems, and mark transform problems. Compilation tasks and program optimizations should be specified abstractly and easily. This is possible with graph rewrite systems [1]. To facilitate the construction of program transformers and optimizers, tools are desired which generate algorithms from graph rewrite specifications. Optimix is such a tool. The central idea of Optimix is to regard all of the information in a compiler (the intermediate representation) as a ....

....graphs with edges while code transformation means to delete subgraphs and to attach new ones. Hence, Optimix s specification language is based on relational graph rewriting. In particular, Optimix supports edge addition rewrite systems (EARS) and exhaustive graph rewrite systems (XGRS) 2] 3] [1]. EARS only add edges to graphs. They can be used to construct graphs and to materialize implicit relations as explicit ones. EARS are equivalent to a subset of Datalog [4] 1 2 They are congruent, i.e. they terminate and always yield unique results [5] XGRS allow graph manipulations and may ....

[Article contains additional citation context not shown here]

Uwe Amann. How To Uniformly Specify Program Analysis and Transformation. In P. A. Fritzson, editor, Compiler Construction (CC), volume 1060 of Lecture Notes in Computer Science, pages 121--135, Heidelberg, 1996. Springer.

No context found.

Uwe Assmann. How To Uniformly Specify Program Analysis and Transformation. In P. Fritzson, editor, Compiler Construction (CC). Springer, 1996.

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