Lemma Functions for Frama-C: C Programs as Proofs

11/14/2018
by   Grigoriy Volkov, et al.
0

This paper describes the development of an auto-active verification technique in the Frama-C framework. We outline the lemma functions method and present the corresponding ACSL extension, its implementation in Frama-C, and evaluation on a set of string-manipulating functions from the Linux kernel. We illustrate the benefits our approach can bring concerning the effort required to prove lemmas, compared to the approach based on interactive provers such as Coq. Current limitations of the method and its implementation are discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2018

Generalized Polylogarithms in Maple

This paper describes generalized polylogarithms, multiple polylogarithms...
research
06/14/2023

Verification of NP-hardness Reduction Functions for Exact Lattice Problems

This paper describes the formal verification of NP-hardness reduction fu...
research
05/15/2020

Monads and "do" notation in the Wolfram Language

This paper describes a categorical interpretation of the Wolfram Languag...
research
09/03/2018

Deductive Verification of Unmodified Linux Kernel Library Functions

This paper presents results from the development and evaluation of a ded...
research
01/16/2023

DietTopp: A first implementation and evaluation of a simplified bandwidth measurement method

This paper describes the active available bandwidth measurement tool Die...
research
10/01/2019

Extraction of Efficient Programs in IΣ_1-arithmetic

Clausal Language (CL) is a declarative programming and verifying system ...

Please sign up or login with your details

Forgot password? Click here to reset