2000 search results - page 5 / 400 » Program Transformation and Proof Transformation |
LOPSTR
1994
Springer
13 years 11 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
SAC
2008
ACM
13 years 6 months ago
2008
ACM
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
CSL
2004
Springer
14 years 23 days ago
2004
Springer
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
We have verified several versions of the CPS transformation in Isabelle/HOL. In our verification we adopted first-order abstract syntax with variable names so that the formalizati...
POPL
1995
ACM
13 years 11 months ago
1995
ACM
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...