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
Book ChapterDOI

RustHorn: CHC-based Verification for Rust Programs (full version).

TL;DR: In this article, a translation of pointer-manipulating Rust programs into constrained Horn clauses (CHCs) is proposed, which clears away pointers and memories by leveraging ownership and proves its correctness.
Book ChapterDOI

Constructing Semantic Models of Programs with the Software Analysis Workbench

TL;DR: The structure of the SAW system is described and experimental results demonstrating the benefits of its implementation techniques are presented.
Journal ArticleDOI

Lessons Learned From Microkernel Verification -- Specification is the New Bottleneck

TL;DR: In this paper, the authors report on lessons learned for verification of large software systems based on the experience gained in microkernel verification in the Verisoft XT project and discuss a number of issues that impede widespread introduction of formal verification in software life-cycle process.

K: A semantic framework for programming languages and formal analysis tools

TL;DR: An overview of the K framework is given, following the lecture notes presented by the author at the Marktoberdorf Summer School in year 2016.
Book ChapterDOI

Revisiting Enumerative Instantiation

TL;DR: This paper revisits enumerative instantiation, a technique that considers instantiations based on exhaustive enumeration of ground terms, and presents a stronger Herbrand Theorem, better suited as a basis for the instantiation loop used in SMT solvers.
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.