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 language, this is true only if the translation process preserves observational equivalence. tigate the problem of fully abstract compilation, i.e., compilation that both preserves and reflects observational equivalence. In particular, we prove that typed closure conversion for the polymorphic -calculus with existential and recursive types is tract. Our proof uses operational techniques in the form of a step-indexed logical relation and construction of certain wrapper terms that "back-translate" from target values to source values. Although typed closure conversion has been assumed to be stract, we are not aware of any previous result that actually proves this. Categories and Subject Descriptors D.3.1 [Programming Languages]: Formal Definitions and Theory--Semantics General Terms Languages, Security equival...

• Type: Conference
• Year: 2008
• Where: ICFP
• Authors: Amal Ahmed, Matthias Blume
• Keywords: ICFP 2008, Language-based Security Relies, Observational Equivalence, Programming Languages, Typed Closure Conversion