17 search results - page 2 / 4 » A Simple Correctness Proof for Magic Transformation |
125
Voted
IWFM
1998
15 years 5 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...
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
137
Voted
GI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
146
Voted
LOPSTR
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
129
Voted
POPL
1995
ACM
15 years 7 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...