FunTAL: reasonably mixing a functional language with assembly

Patterson, Daniel; Perconti, Jamie; Dimoulas, Christos; Ahmed, Amal

doi:10.1145/3140587.3062347

Cited by 5 publications

(2 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another line of work based is multi-language semantics [14][15][16][17] where a language combining all source, intermediate and target language is used to formalize the semantics and compiler correctness is stated using contextual equivalence or logical relations.…”

Section: Modular Verification Of Compilers For Higher-order Languagesmentioning

confidence: 99%

A Bottom-Up Approach to a Unified Semantic Interface for Verified Compositional Compilation

Zhang¹,

Wang²,

Koenig³

et al. 2023

Preprint

View full text Add to dashboard Cite

Verified compositional compilation (VCC) is a notion of modular verification of compilers that supports compilation of heterogeneous programs. The key to achieve VCC is to design a semantic interface that enables composition of correctness theorems for compiling individual modules. Most of the existing techniques for VCC fix a semantic interface from the very beginning and force it down to every single compiler pass. This requires significant changes to the existing framework and makes it difficult to understand the relationship between conditions enforced by the semantic interface and the actual requirements of compiler passes. A different approach is to design appropriate semantic interfaces for individual compiler passes and combine them into a unified interface which faithfully reflects the requirements of underlying compiler passes. However, this requires vertically composable simulation relations, which were traditionally considered very difficult to construct even with extensive changes to compiler verification frameworks.We propose a solution to construction of unified semantic interfaces for VCC with a bottom-up approach. Our starting point is CompCertO, an extension of CompCert-the state-of-the-art verified compiler-that supports VCC but lacks a unified interface. We discover that a CompCert Kripke Logical Relation (CKLR) in CompCertO provides a uniform notion of memory protection for evolving memory states across modules and is transitively composable. Based on this uniform and composable CKLR, we then merge the simulation relations for all the compiler pass in CompCertO (except for three value analysis passes) into a unified interface. We demonstrate the conciseness and effectiveness of this unified interface by applying it to verify the compositional compilation of a non-trivial heterogeneous program with mutual recursion.

show abstract

Section: Modular Verification Of Compilers For Higher-order Languagesmentioning

confidence: 99%

A Bottom-Up Approach to a Unified Semantic Interface for Verified Compositional Compilation

Zhang¹,

Wang²,

Koenig³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Secure linking To ensure safe interaction with low-level code, typed assembly languages [19] and multi-language semantics [29] have been used by Patterson et al [42]. Their technique restricts the low-level language not with runtime enforcement of memory isolation like in some architectures [17,50,55,56,57,58] and in our Mach model, but instead with a static type system.…”

Section: Related Workmentioning

confidence: 99%

SecurePtrs: Proving Secure Compilation with Data-Flow Back-Translation and Turn-Taking Simulation

El-Korashy¹,

Blanco²,

Thibault³

et al. 2021

Preprint

View full text Add to dashboard Cite

Proving secure compilation of partial programs typically requires back-translating a target attack against the compiled program to an attack against the source program. To prove this back-translation step, one can syntactically translate the target attacker to a source one-i.e., syntax-directed backtranslation-or show that the interaction traces of the target attacker can also be produced by source attackers-i.e., tracedirected back-translation.Syntax-directed back-translation is not suitable when the target attacker uses unstructured control flow that the source language cannot directly represent. Trace-directed back-translation works with such syntactic dissimilarity because only the external interactions of the target attacker have to be mimicked in the source, not its internal control flow. Revealing only external interactions is, however, inconvenient when sharing memory via unforgeable pointers, since information about stashed pointers to shared memory gets lost. This made prior proofs complex, since the generated attacker had to stash all reachable pointers.In this work, we introduce more informative data-flow traces, which allow us to combine the best of syntax-directed and trace-directed back-translation. Our data-flow back-translation is simple, handles both syntactic dissimilarity and memory sharing well, and we have proved it correct in Coq.We, moreover, develop a novel turn-taking simulation relation and use it to prove a recomposition lemma, which is key to reusing compiler correctness in such secure compilation proofs. We are the first to mechanize such a recomposition lemma in a proof assistant in the presence of memory sharing.We put these two key innovations to use in a secure compilation proof for a code generation compiler pass between a safe source language with pointers and components, and a target language with unstructured control flow.

show abstract

On the Multi-Language Construction

Buro

Mastroeni

2019

Programming Languages and Systems

View full text Add to dashboard Cite

Modern software is no more developed in a single programming language. Instead, programmers tend to exploit cross-language interoperability mechanisms to combine code stemming from different languages, and thus yielding fully-fledged multi-language programs. Whilst this approach enables developers to benefit from the strengths of each single-language, on the other hand it complicates the semantics of such programs. Indeed, the resulting multi-language does not meet any of the semantics of the combined languages. In this paper, we broaden the boundary functions-based approachà la Matthews and Findler to propose an algebraic framework that provides a constructive mathematical notion of multi-language able to determine its semantics. The aim of this work is to overcome the lack of a formal method (resp., model) to design (resp., represent) a multi-language, regardless of the inherent nature of the underlying languages. We show that our construction ensures the uniqueness of the semantic function (i.e., the multi-language semantics induced by the combined languages) by proving the initiality of the term model (i.e., the abstract syntax of the multi-language) in its category.

show abstract

FunTAL: reasonably mixing a functional language with assembly

Cited by 5 publications

References 29 publications

A Bottom-Up Approach to a Unified Semantic Interface for Verified Compositional Compilation

A Bottom-Up Approach to a Unified Semantic Interface for Verified Compositional Compilation

SecurePtrs: Proving Secure Compilation with Data-Flow Back-Translation and Turn-Taking Simulation

On the Multi-Language Construction

Contact Info

Product

Resources

About