A work-in-progress language and compiler for verified low-level programming

This repository containts ongoing work on a low-level systems programming language. One piece of the puzzle is a verified compiler targeting RISC-V. The source language itself is also equipped with a simple program logic for proving correctness of the source programs. It is not ready yet, at least for most uses.

This project has similar goals as bedrock, but uses a different design. No code is shared between bedrock and bedrock2.

Current Features

The source language is a "C-like" language called ExprImp. It is an imperative language with expressions. Currently, the only data type is word (32-bit or 64-bit), and the memory is a partial map from words to bytes. "Records" are supported as a notation for memory access with an offset.

Work-in-progress features

The following features will be added soon: * Register allocation (spilling if more local variables are needed than registers are available)

Non-features

It is a design decision to not support the following features: * Function pointers * Recursive functions (we might add them later, but we always want to prove that we don't run out of stack space) * Non-terminating programs (except for the top-level event loop)

Build

You'll need Coq. We try to support the latest released version as well as master. If unsure which version to pick, it's best to check the build log of the continuous integration server.

In case you didn't clone with

--recursive

make clone_all

Then simply run

make

make -j

make -jN

N

-j

Project Overview

This repository is an umbrella repository integrating several sub-projects, allowing us to prove end-to-end theorems describing the I/O behavior of a pipelined processor executing a program written in the bedrock2 language, verified with our program logic, and compiled with our compiler.

There are the following sub-projects:

• coqutil: Coq library for tactics, basic definitions, sets, maps
• riscv-coq: RISC-V specification in Coq
• bedrock2/bedrock2: The bedrock2 language, a simple C-like programming language with a program logic and a few verified sample programs
• bedrock2/compiler: A very simple compiler from the bedrock2 language to bare metal, position independent RISC-V machine code
• kami: Provides a 4-stage pipelined RISC-V processor
• bedrock2/processor: Proves that the hardware-centric RISC-V specification of Kami matches the software-centric specification of riscv-coq
• bedrock2/end2end: Combines all the projects into an end-to-end theorem about a concrete program, the IoT lightbulb demo.

The Kami processor can be extracted to bluespec, which can be compiled to Verilog, and run on an FPGA.

The project dependency structure looks as follows (right depends on left):

         bedrock2
       /          \
coqutil            compiler
       \          /         \
         riscv-coq           end2end
                  \         /
                   processor
                  /
              kami

The IoT lightbulb demo

In the above picture, the FPGA at the bottom left is running the Kami processor, which executes a program proven correct using the bedrock2 program logic and compiled to bytes using the bedrock2 compiler. Through a set of blue wires (using SPI), the FPGA is connected to an ethernet card (which we do not verify), and through a red & black wire, it is connected to a power relay which can turn on and off a lightbulb.

Code Overview

Throughout the compiler, we use postcondition-style semantics, i.e. judgments of the form

exec c s P

c

s

P

Here's a list of files that might be interesting to step through in your IDE: * The postcondition style semantics of the bedrock2 language are in

bedrock2.Semantics

compiler.FlatImp

bedrock2.WeakestPrecondition

bedrock2Examples.swap

bedrock2.WeakestPreconditionProperties.sound_cmd

.
*

shows how to instantiate external calls (which are kept abstract throughout the compiler) with memory-mapped I/O (MMIO).
* To see how we connect the postcondition style to the traditional small-step semantics of Kami, you might want to start at

, then look at

, and

proves the assumptions made by

, by using a "low level invariant"

, defined in

, which says, "the current riscv state is a finite numer of steps away from a good state, where good state means a riscv state that is related to a bedrock2 state that can be observed at the end of an iteration of the toplevel event loop". Note that this "finite number of steps" might be different for each nondeterministic execution branch, so we can't just state it as

. Instead, we use

(that we write as ◊ in papers).
* The semantics of each riscv instruction is defined in terms of the primitives given in

.
* The function that executes a riscv instruction from the basic I extension is in

, but since it has been translated from Haskell and Coq's beautify option is [broken](https://github.com/coq/coq/issues/11129), the Coq code is not very readable, so you have to read [ExecuteI.hs](https://github.com/mit-plv/riscv-semantics/blob/master/src/Spec/ExecuteI.hs) form the Haskell spec instead, or to import the

and do

inside Coq to read it.
* To see how we instaniate this generic

monad into something that does postcondition style, you can look at

Compiler Overview

Here are the names of the languages and the compiler phases between them:

Syntax.cmd
  ↓ FlattenExpr
FlatImp.stmt string
  ↓ RegRename
FlatImp.stmt Z
  ↓ FlatToRiscv
list Instruction
  ↓ instrencode
list byte

The compiler provides two interfaces:

1) The "more traditional" interface:

Input: - list of bedrock2 functions - name of "main"

Output: - Compiled functions as list of instructions - Relative position of main function

Correctness theorem:

compiler.PipelineWithRename.compiler_correct

post

post

2) The event loop interface:

Input: - list of bedrock2 functions, name of "init" and "loop". This will result in the following program being compiled:

init();
while (true) {
   loop();
}

Output: - list of instructions to initialize the stack pointer, call

init()

loop()

loop()

Correctness theorem:

compiler.CompilerInvariant.compiler_invariant_proofs

inv

inv

inv

inv