54 search results - page 1 / 11 » Automatically proving the correctness of compiler optimizati... |
183
Voted
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
241
Voted
POPL
2002
ACM
16 years 6 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
175
Voted
PLDI
2009
ACM
16 years 18 days ago
2009
ACM
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization are equivalent. Traditionally, translation validat...
157
Voted
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
283
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...