Embracing a mechanized formalization gap

10/25/2019
by   Antal Spector-Zabusky, et al.
0

If a code base is so big and complicated that complete mechanical verification is intractable, can we still apply and benefit from verification methods? We show that by allowing a deliberate mechanized formalization gap we can shrink and simplify the model until it is manageable, while still retaining a meaningful, declaratively documented connection to the original, unmodified source code. Concretely, we translate core parts of the Haskell compiler GHC into Coq, using hs-to-coq, and verify invariants related to the use of term variables.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2022

Giallar: Push-Button Verification for the Qiskit Quantum Compiler

This paper presents Giallar, a fully-automated verification toolkit for ...
research
01/25/2022

The Trusted Computing Base of the CompCert Verified Compiler

CompCert is the first realistic formally verified compiler: it provides ...
research
03/19/2018

Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code

Good tools can bring mechanical verification to programs written in main...
research
10/19/2021

The Creation of Puffin, the Automatic Uncertainty Compiler

An uncertainty compiler is a tool that automatically translates original...
research
08/23/2019

Contract-based verification of a realistic quantum compiler

In this paper, we present CertiQ, a mostly-automated verification framew...
research
10/10/2016

Verification of the Tree-Based Hierarchical Read-Copy Update in the Linux Kernel

Read-Copy Update (RCU) is a scalable, high-performance Linux-kernel sync...
research
06/03/2019

Gap-Measure Tests with Applications to Data Integrity Verification

In this paper we propose and examine gap statistics for assessing unifor...

Please sign up or login with your details

Forgot password? Click here to reset