-
solc-verify: A Modular Verifier for Solidity Smart Contracts
We present solc-verify, a source-level verification tool for Ethereum sm...
read it
-
Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code
Good tools can bring mechanical verification to programs written in main...
read it
-
Contract-based verification of a realistic quantum compiler
In this paper, we present CertiQ, a mostly-automated verification framew...
read it
-
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...
read it
-
Deductive Verification of Unmodified Linux Kernel Library Functions
This paper presents results from the development and evaluation of a ded...
read it
-
Structured Generative Models of Natural Source Code
We study the problem of building generative models of natural source cod...
read it
-
Gap-Measure Tests with Applications to Data Integrity Verification
In this paper we propose and examine gap statistics for assessing unifor...
read it
Embracing a mechanized formalization gap
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
Comments
There are no comments yet.