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
Book ChapterDOI
Beyond first-order satisfaction: fixed points, interpolants, automata and polynomials
TL;DR: Four initiatives from Microsoft Research that build upon Z3 and move beyond first-order satisfaction are summarized.
Book ChapterDOI
System verification through program verification
TL;DR: An automatable approach to verify that a system satisfies its requirements by verification of the program that controls the system by showing the applicability of the approach with a case study based on a real-world system.
Journal ArticleDOI
Verified symbolic execution with Kripke specification monads (and no meta-programming)
TL;DR: A novel, systematic approach for the construction and soundness proof of such a symbolic execution-based verifier is contributed, and the practical application of these techniques in Katamaran, a tool for verifying security guarantees offered by instruction set architectures (ISAs).
Journal ArticleDOI
überSpark: Practical, Provable, End-to-End Guarantees on Commodity Heterogenous Interconnected Computing Platforms
TL;DR: This paper describes the on-going research, presents überSpark, a system architecture that argues for structuring the CHIC stack around Universal Object Abstractions (üobjects), a fundamental system abstraction and building block towards practical and provable end-to-end guarantees.
Journal ArticleDOI
Experiments on self-applicability in the c-light verification system. part 2
TL;DR: The metageneration approach proposed by Moriconi and Schwartz allows us to build automatically a recursively defined generator from a Hoare logic and also ensures its consistency and completeness.
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.