An indexed model of recursive types for foundational proof-carrying code

407 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

RustBelt: securing the foundations of the rust programming language (2017, methodology): “…to the Foundational Proof-Carrying Code project [Ahmed et al. 2010; Appel 2001] and the development of łstep-indexedž logical relations [Ahmed 2004; Appel and McAllester 2001] which arose from that project, we now know how to scale the semantic approach to languages with semantically complex…”
Foundational proof-carrying code (2001, methodology): “Our paper [4] proves all these theorems and shows the extension of the result to types and values on von Neumann machines.”
Iris from the ground up: A modular foundation for higher-order concurrent separation logic (2018, unknown): “Hence, while verifying e, we need not consider the possibility that another piece of code in the program might “interfere” with e 1 As in, e.g., Appel et al.’s work on foundational proof-carrying code (Appel, 2001; Appel & McAllester, 2001) and later on the Verified Software Toolchain (Appel, 2014).”
Proof carrying code (2015, background): “[12] A code consumer must be convinced that the code provided by the (often untrusted) code producer has some (previously agreed upon) set of properties that makes it safe to be executed at the code consumer.”