2000 search results - page 4 / 400 » Program Transformation and Proof Transformation |
IWFM
1998
13 years 8 months ago
1998
The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...
PROVSEC
2007
Springer
14 years 1 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
ENTCS
2007
13 years 7 months ago
2007
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
JLP
2008
13 years 7 months ago
2008
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented...
ICFP
2000
ACM
13 years 11 months ago
2000
ACM
We show that a non-duplicating transformation into Continuation-Passing Style (CPS) has no effect on control-flow analysis, a positive effect on binding-time analysis for tradi...