Sciweavers

1882 search results - page 41 / 377
» Transformational Programming and Forests
Sort
View
ICFP
2003
ACM
15 years 3 months ago
Reasoning about recursive procedures with parameters
In this paper we extend the model of program variables from the Refinement Calculus [2] in order to be able to reason more algebraically about recursive procedures with parameter...
Ralph-Johan Back, Viorel Preoteasa
POPL
2000
ACM
15 years 2 months ago
Semantics-Preserving Procedure Extraction
Procedure extraction is an important program transformation that can be used to make programs easier to understand and maintain, to facilitate code reuse, and to convert “monoli...
Raghavan Komondoor, Susan Horwitz
POPL
2004
ACM
15 years 10 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
CC
2010
Springer
172views System Software» more  CC 2010»
15 years 4 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
POPL
2005
ACM
15 years 10 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...