P. Cousot and R. Cousot. Systematic design of program transformation frameworks by abstract interpretation. In Proc. Symposium on Principles of Programming Languages, pages 178--190, Portland, Oregon, January 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....have a substantial impact on the time to run an optimization. The best solution would be to prove the compiler sound, meaning that for any input program, the compiler always produces an equivalent output program. Optimizations, and sometimes even complete compilers, have been proven sound by hand [1, 2, 15, 13, 8, 23, 3, 11]. However, manually proving large parts of a compiler sound requires a lot of e#ort and theoretical skill on the part of the compiler writer. In addition, these proofs are usually done for optimizations as written on paper, and bugs may still arise when the algorithms are implemented from the ....

....language were augmented with pointers) or optimizations like PRE would instead require writing more complicated guards, and some optimizations we support may not be expressible by Lacey. As mentioned in the introduction, much other work has been done on manually proving optimizations correct [13, 15, 1, 2, 8, 23, 3]. Transformations have also been proven correct mechanically, but not automatically: the transformation is proven sound using an interactive theorem prover, which requires user involvement. For example, Young [34] has proven a code generator correct using the Boyer Moore theorem prover enhanced ....

Patrick Cousot and Radhia Cousot. Systematic design of program transformation frameworks by abstract interpretation. In Conference Record of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland OR, January 2002.

....UML to various mathematical domains) Recently, this tool is being extended to support the multilevel aspects of the VPM approach. Further research is primarily aiming at to provide automated verification facilities for arbitrary model transformations within VPM. Our idea (following conceptually [9], which is a recent semantic framework for capturing All previous papers of the authors are accessible from http: www.inf.mit.bme.hu. 33 transformations of programming languages) is to reason about the behavioral consistency of two models (let us call them source and target) taken possibly ....

P. Cousot and R. Cousot. Systematic design of program transformation frameworks by abstract interpretation. In Conference Record of the Twentyninth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 178--190. ACM Press, New York, NY, Portland, Oregon, 2002.

....throughout the transformation. The authors believe that this may turn out to be a significant and useful departure from traditional program transformation. This is reminiscent of the recent trend in abstract interpretation research away from applications to analysis and towards manipulation [8]. 6.1 Ease of Handling Semantically Complex Constructs: the switch Statement The transformation function R (C) produces a statement or statement sequence C from a statement of statement sequence C. C is identical to C except that all occurrences of the break statement have been replaced ....

COUSOT, P., AND COUSOT, R. Systematic design of program transformation frameworks by abstract interpretation. ACM SIGPLAN Notices 31, 1 (Jan. 2002), 178--190.

....X, 26] is simplied into #. The global analysis of the program then consists in computing lfp so that the xpoints for the parts are computed in a completely known context or environment. Very often, F s is obtained by abstract interpretation of F (see [30] for a formalization of such transformations as abstract interpretations) A frequently used variant of this idea consists in rst using a preliminary global analysis of the whole program P [P 1 , P n ] with a rough imprecise abstraction to collect some global information on the program in ....

P. Cousot and R. Cousot. Systematic Design of Program Transformation Frameworks by Abstract Interpretation. In 29 POPL, 178190, Portland, 2002. ACM Press.

....pp 1 where t t pp 1 if postrt pp 1 s A p A p 1 and t pp 1 XpSA p 1 q otherwise. If A is taken in computer language representable abstract domains, the transformed transition system xS, t , F, Ey corresponds to a transformed program, which is a simple form of program monitoring [24]. The automatic analysis of the above factorial program leads to the following result [25, 26] The temporal operator lQ denotes the set of sequences of states such that all states satisfy Q, denotes the set of sequences containing at least one state satisfying Q and the predicate at p ....

Cousot, P., Cousot, R.: Systematic design of program transformation frameworks. In: 29 POPL, Portland, USA, ACM Press (2002) 178--190

No context found.

P. Cousot and R. Cousot. Systematic design of program transformation frameworks by abstract interpretation. In Proc. Symposium on Principles of Programming Languages, pages 178--190, Portland, Oregon, January 2002.

No context found.

Patrick Cousot and Radhia Cousot. Systematic design of program transformation frameworks by abstract interpretation. In Conference Record of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland OR, January 2002.

No context found.

P. Cousot and R. Cousot. Systematic design of program transformation frameworks by abstract interpretation. In Conference Record of the Twentyninth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 178--190, Portland, Oregon, January 2002. ACM Press, New York.

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