‹Programming› 2022
Mon 11 - Thu 14 April 2022
Thu 14 Apr 2022 07:15 - 07:40 at Virtual Space - ‹Programming› Online Thursday Chair(s): Jeremy Gibbons

Context: It is common for programming languages that their reference implementation is implemented in the language itself. This requires a “bootstrap”: the executable form of a previous version of the implementation is provided along with the sources, to be able to run the implementation itself. Those bootstrap files are opaque binaries; they could contain bugs, or even malicious changes that could reproduce themselves when running the source version of the language implementation – this is called the “trusting trust attack”. A collective project called Bootstrappable was launched in 2016 to remove those bootstraps, providing alternative build paths that do not rely on opaque binaries.

Inquiry: Debootstrapping generally combines a mix of two approaches. The “archaeological” approach works by locating old versions of systems, or legacy alternative implementations, that do not need the bootstrap, and by preserving or restoring the ability to run them. The “tailored” approach re-implements a new, non-bootstrapped implementation of the system to debootstrap. Currently, the “tailored” approach is dominant for low-level system components (C, coreutils), and the “archaeological” approach is dominant among the few higher-level languages that were debootstrapped.

Approach: We advocate for the benefits of “tailored” debootstrapping implementations of high-level languages. The new implementation needs not be production-ready, it suffices that it is able to run the reference implementation correctly. We argue that this is feasible with a reasonable development effort, with several side benefits besides debootstrapping.

Knowledge: We propose a specific design of composing/stacking several implementations: a reference interpreter for the language of interest, implemented in a small subset of the language, and a compiler for this small subset (in another language). Developing a reference interpreter is valuable independently of debootstrapping: it may help clarify the language semantics, and can be reused for other purposes such as differential testing of the other implementations.

Grounding: We present Camlboot, our project to debootstrap the OCaml compiler, version 4.07. Once we converged on this final design, the last version of Camlboot took about two human-months of implementation effort, demonstrating feasibility. Using diverse double-compilation, we were able to prove the absence of trusting trust attack in the existing bootstrap of the standard OCaml implementation.

Importance: To our knowledge, this document is the first scholarly discussion of “tailored” debootstrapping for high-level programming languages. Debootstrapping is an interesting problem which recently grew an active community of free software contributors, but so far the interactions with the programming-language research community have been minimal. We share our experience on Camlboot, trying to highlight aspects that are of interest to other language designers and implementors; we hope to foster stronger ties between the Bootstrappable project and relevant academic communities. In particular, the debootstrapping experience has been an interesting reflection on OCaml design and implementation, and we hope that other language implementors would find it equally valuable.

Thu 14 Apr

Displayed time zone: Lisbon change

06:00 - 09:00
‹Programming› Online ThursdayResearch Papers / at Virtual Space
Chair(s): Jeremy Gibbons Department of Computer Science, University of Oxford
06:00
25m
Talk
Day 4 Opening | N Things I Hate About \nu*
James Noble Creative Research & Programming
06:25
25m
Research paper
Topology-level Reactivity in Distributed Reactive Programs: Reactive Acquaintance Management using Proximity SetsVol. 6
Research Papers
Sam Van den Vonder Vrije Universiteit Brussel, Thierry Renaux Vrije Universiteit Brussel, Wolfgang De Meuter Vrije Universiteit Brussel
Link to publication DOI
06:50
25m
Research paper
Sham: A DSL for Fast DSLsVol. 6
Research Papers
Rajan Walia Indiana University, Chung-chieh Shan Indiana University, USA, Sam Tobin-Hochstadt Indiana University
Link to publication
07:15
25m
Research paper
Debootstrapping without archeology: Stacked implementations in CamlbootVol. 6
Research Papers
Nathanaëlle Courant INRIA, Julien Lepiller Yale University, Gabriel Scherer INRIA Saclay
07:40
25m
Other
Conference Closing
G: Ademar Aguiar FEUP, Universidade do Porto, G: Shigeru Chiba The University of Tokyo