Our team has developed a model-based systems engineering environment that integrates
formal methods at all levels of system design. Our methodology and tools enable systems …

Garbage collectors relieve the programmer from manual memory management, but lead to
compiler-generated machine code that can behave differently (eg out-of-memory errors) …

Experienced developers of safety-critical and security-critical systems have long
emphasized the importance of applying the highest degree of scrutiny to a system's I/O …

Verified compilers such as CompCert and CakeML have become increasingly realistic over
the last few years, but their support for floating-point arithmetic has thus far been limited. In …

We introduce SCIO*, a formally secure compilation framework for statically verified programs
performing input-output (IO). The source language is an F* subset in which a verified …

The CakeML project has developed a proof-producing code generation mechanism for the
HOL4 theorem prover, a verified compiler for ML and, using these, a number of verified …

We add an efficient function for computation to the kernels of higher-order logic interactive
theorem provers. First, we develop and prove sound our approach for Candle. Candle is a …

In this paper we consider the so ware architecture of InnoChain, a distributed ledger system
(DLS) with 5 levels of formal veri cation, including a formally-veri ed underlying operating …

HOPE Verifying non-terminating programs with IO in F* Page 1 Verifying non-terminating
programs with IO in F* Cezar-Constantin Andrici, Théo Winterhalter, Cătălin Hriţcu, Exequiel …

In this paper we consider the software architecture of InnoChain, a distributed ledger system
(DLS) with 5 levels of formal verification, including a formally-verified underlying operating …