Book ChapterDOI
Invariants, modularity, and rights
Ernie Cohen,Eyad Alkassar,Vladimir Boyarinov,Markus Dahlweid,Ulan Degenbaev,Mark Hillebrand,Bruno Langenstein,Dirk Leinenbach,Michal Moskal,Steven Obua,Wolfgang J. Paul,Hristo Pentchev,Elena Petrova,Thomas Santen,Norbert Schirmer,Sabine Schmaltz,Wolfram Schulte,Andrey Shadrin,Stephan Tobies,Alexandra Tsyban,Sergey Tverdyshev +20 more
- Vol. 5947, pp 43-55
TLDR
This paper argues that rights to access the state are really just sugar for knowledge that certain updates preserve certain invariants, and extends program assertions to include not just knowledge about the state, but rights toaccess the state.Abstract:
The quest for modular concurrency reasoning has led to recent proposals that extend program assertions to include not just knowledge about the state, but rights to access the state. We argue that these rights are really just sugar for knowledge that certain updates preserve certain invariants.read more
Citations
More filters
Proceedings ArticleDOI
Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning
Ralf Jung,David Swasey,Filip Sieczkowski,Kasper Svendsen,Aaron Turon,Lars Birkedal,Derek Dreyer +6 more
TL;DR: Iris, a concurrent separation logic with a simple premise: monoids and invariants are all you need, supports the encoding of *logically atomic specifications*, i.e., Hoare-style specs that permit the client of an operation to treat the operation essentially as if it were atomic, even if it is not.
Book ChapterDOI
A data driven approach for algebraic loop invariants
TL;DR: It is shown how Guess-and-Check can be extended to generate arbitrary boolean combinations of linear equalities as invariants, which enables the technique to generate expressive invariants to be consumed by tools that cannot handle non-linear arithmetic.
Book ChapterDOI
Introduction to linked data and its lifecycle on the web
TL;DR: This article presents an overview of the Linked Data lifecycle and discusses individual approaches as well as the state-of-the-art with regard to extraction, authoring, linking, enrichment as wellAs quality of Linked data.
Book ChapterDOI
Model transformation by-example: a survey of the first wave
TL;DR: This chapter gives an overview on the emerging concepts, techniques, and approaches in this young by-example area which follow the same fundamental idea as query by- Example and programming by- example approaches.
Book ChapterDOI
Verification as Learning Geometric Concepts
TL;DR: It is shown that invariants in program verification can be regarded as geometric concepts in machine learning, and the learning algorithm is extended to obtain a sound procedure that can generate proofs containing invariants that are arbitrary boolean combinations of polynomial inequalities.
References
More filters
Book ChapterDOI
Disjunctive Tautologies as Synchronisation Schemes
Vincent Danos,Jean-Louis Krivine +1 more
TL;DR: In the ambient logic of classical second order propositional calculus, the specification problem for a family of excluded middle like tautologies is solved and these are shown to be realized by sequential simulations of specific communication schemes for which they provide a safe typing mechanism.
Book ChapterDOI
Computational Adequacy in an Elementary Topos
TL;DR: It is proved that computational adequacy holds if and only if the topos is 1-consistent (i.e. its internal logic validates only true Σ\(^{\rm 0}_{\rm 1}\)-sentences).
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
TL;DR: 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.
Journal ArticleDOI
Resources, concurrency, and local reasoning
TL;DR: This paper shows how a resource-oriented logic, separation logic, can be used to reason about the usage of resources in concurrent programs.