scispace - formally typeset
Book ChapterDOI

VCC: A Practical System for Verifying Concurrent C

Reads0
Chats0
TLDR
This paper motivates VCC, describes the verification methodology, the architecture of VCC is described, and the experience using VCC to verify the Microsoft Hyper-V hypervisor is reported on.
Abstract
VCC is an industrial-strength verification environment for low-level concurrent system code written in C. VCC takes a program (annotated with function contracts, state assertions, and type invariants) and attempts to prove the correctness of these annotations. It includes tools for monitoring proof attempts and constructing partial counterexample executions for failed proofs. This paper motivates VCC, describes our verification methodology, describes the architecture of VCC, and reports on our experience using VCC to verify the Microsoft Hyper-V hypervisor.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Verifying RTuinOS using VCC: From approach to practice

TL;DR: This paper presents a C code correctness verification framework (CVF for short) which is based on an automatic theorem proving tool-VCC, and proposes a specification checking method to improve the correctness of verification specification codes.
ReportDOI

Design, Development, and Automated Verification of an Integrity-Protected Hypervisor

TL;DR: It is proved that any hypervisor satisfying the DRIVE properties and verification conditions has memory integrity, and a methodology for designing developing, and verifying hypervisors to ensure memory integrity is presented.
Journal ArticleDOI

LLVMVF: A Generic Approach for Verification of Multicore Software

TL;DR: This work presents a novel framework, called LLVM Verification Framework (LLVMVF), implemented in a purely functional language for verification of multicore software, and is believed to be the first verification framework using the LLVM bytecode representation for multicoreSoftware.
Journal ArticleDOI

Verification Condition Generation for Permission Logics with Abstraction Functions

TL;DR: This paper presents an encoding of abstract predicates and abstraction functions in the verification condition generator Boogie that is sound and handles recursion in a way that is suitable for automatic verification using SMT solvers.

Get rid of inline assembly through trustable verification-oriented lifting.

TL;DR: This work proposes TInA, an automated, generic, trustable and verification-oriented lifting technique turning inline assembly into semantically equivalent C code, in order to take advantage of existing C analyzers.
References
More filters
Book ChapterDOI

Z3: an efficient SMT solver

TL;DR: Z3 is a new and efficient SMT Solver freely available from Microsoft Research that is used in various software verification and analysis applications.
Book ChapterDOI

A Temporal Logic of Nested Calls and Returns

TL;DR: This work introduces a temporal logic of calls and returns (CaRet) for specification and algorithmic verification of correctness requirements of structured programs and presents a tableau construction that reduces the model checking problem to the emptiness problem for a Buchi pushdown system.
Proceedings ArticleDOI

Separation logic: a logic for shared mutable data structures

TL;DR: An extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure is developed, including extensions that permit unrestricted address arithmetic, dynamically allocated arrays, and recursive procedures.
Book ChapterDOI

Amortised Memory Analysis Using the Depth of Data Structures

TL;DR: A related system for bounding the stack space requirements is described which uses the depth of data structures, by expressing potential in terms of maxima as well as sums, by adding extra structure to typing contexts to describe the form of the bounds.