Sciweavers

1882 search results - page 22 / 377
» Transformational Programming and Forests
Sort
View
POPL
2004
ACM
14 years 8 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
LOPSTR
1994
Springer
14 years 17 days ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
DAGSTUHL
1996
13 years 9 months ago
A Comparative Revisitation of Some Program Transformation Techniques
We revisit the main techniques of program transformation which are used in partial evaluation, mixed computation, supercompilation, generalized partial computation, rule-based prog...
Alberto Pettorossi, Maurizio Proietti
WCRE
1993
IEEE
14 years 18 days ago
A Practical Program Transformation System for Reverse Engineering
Program transformation systems provide one means of formally deriving a program from its speci cation. The main advantage of this development method is that the executable program...
M. Ward, K. Bennett
PLDI
2011
ACM
12 years 11 months ago
Systematic editing: generating program transformations from an example
Software modifications are often systematic—they consist of similar, but not identical, program changes to multiple contexts. Existing tools for systematic program transformati...
Na Meng, Miryung Kim, Kathryn S. McKinley