Sciweavers

32 search results - page 3 / 7
» Proof Obligations Preserving Compilation
Sort
View
PLDI
2003
ACM
15 years 5 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
ICFP
2008
ACM
15 years 11 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
PLDI
2010
ACM
15 years 3 months ago
Bringing Extensibility to Verified Compilers
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...
Zachary Tatlock, Sorin Lerner
TOPLAS
2002
116views more  TOPLAS 2002»
14 years 11 months ago
Type-preserving compilation of Featherweight Java
We present an efficient encoding of core Java constructs in a simple, implementable typed intermediate language. The encoding, after type erasure, has the same operational behavio...
Christopher League, Zhong Shao, Valery Trifonov
IC3
2009
14 years 9 months ago
Verification of Liveness Properties in Distributed Systems
Abstract. This paper presents liveness properties that need to be preserved by Event-B models of distributed systems. Event-B is a formal technique for development of models of dis...
Divakar Yadav, Michael Butler