Book ChapterDOI
VCC: A Practical System for Verifying Concurrent C
Ernie Cohen,Markus Dahlweid,Mark Hillebrand,Dirk Leinenbach,Michal Moskal,Thomas Santen,Wolfram Schulte,Stephan Tobies +7 more
- Vol. 5674, pp 23-42
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
Citations
More filters
Secure Virtualization with Formal Methods
TL;DR: A new semi-automatic procedure, S2W, is presented, which uses a combination of abstraction and bounded model checking and allows for the verification of safety properties of large or unbounded arrays, and a set of heuristics for creating an abstract model and computing a bound on the reachability diameter of its state space.
Proceedings Article
Deductive Evaluation: Implicit Code Verification With Low User Burden
TL;DR: A framework for symbolically evaluating C code using a deductive approach that discovers and proves program properties and applies Floyd-Hoare verification principles in its treatment of loops, with a library of iteration schemes serving to derive loop invariants.
Journal ArticleDOI
Verified Model Checking for Conjunctive Positive Logic
TL;DR: In this paper, a proof system for the model checking problem of the fragment of first-order logic known as conjunctive positive logic (CPL) is presented, which is equivalent to the quantified constraint satisfaction problem (QCSP).
Book ChapterDOI
Formal Verification of a Java Component Using the RESOLVE Framework.
TL;DR: In this article, the authors use the RESOLVE specification and reasoning framework to formally verify the functional correctness of a Java implementation of a BDD component, but in a disciplined way and layered on a component catalog expressly designed to support modular reasoning.
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.