Publication: Automated and modular refinement reasoning for concurrent programs
Loading...
Program
KU-Authors
Organization Authors
Co-Authors
Hawblitzel, Chris
Petrank, Erez
Qadeer, Shaz
Date
Language
Embargo Status
N/A
Journal Title
Journal ISSN
Volume Title
Alternative Title
Abstract
We present CIVL, a language and verifier for concurrent programs based on automated and modular refinement reasoning. CIVL supports reasoning about a concurrent program at many levels of abstraction. Atomic actions in a high-level description are refined to fine-grain and optimized lower-level implementations. A novel combination of automata theoretic and logic-based checks is used to verify refinement. Modular specifications and proof annotations, such as location invariants and procedure pre- and post-conditions, are specified separately, independently at each level in terms of the variables visible at that level. We have implemented CIVL as an extension to the BOOGIE language and verifier. We have used CIVL to refine a realistic concurrent garbage collection algorithm from a simple high-level specification down to a highly-concurrent implementation described in terms of individual memory accesses.
Source
Publisher
Springer Nature
Citation
item.page.haspartof
Source
Computer Aided Verification, Cav 2015, Pt II
item.page.ispartofseries
item.page.edition
DOI
10.1007/978-3-319-21668-3_26
item.page.datauri
item.page.link
Rights
N/A
Copyrights Note
Rights and licensing
N/A
