Abstraction for concurrent objects

TL;DR: This work has successfully developed a practical concurrent OS kernel and verified its (contextual) functional correctness in Coq, and is the first proof of functional correctness of a complete, general-purpose concurrent OS kernels with fine-grained locking.

TL;DR: TaDA is presented, a program logic that combines the benefits of abstract atomicity and abstract disjointness and the introduction of atomic triples, which offer an expressive approach to specifying program modules.

TL;DR: A new semantic model is proposed, based on Kripke logical relations, that supports direct proofs of contextual refinement in the setting of a type-safe high-level language and provides a simple way of expressing the "local life stories" of individual pieces of an FCD's hidden state by means of protocols that the threads concurrently accessing that state must follow.

TL;DR: A novel technique based on modular testing of client code in the presence of an adversarial environment is presented, which uses commutativity specifications to drastically reduce the number of executions explored to detect a bug.

TL;DR: In this article, the design and implementation of concurrency control and recovery mechanisms for transaction management in centralized and distributed database systems is described. But this can lead to interference between queries and updates.

TL;DR: This paper defines linearizability, compares it to other correctness conditions, presents and demonstrates a method for proving the correctness of implementations, and shows how to reason about concurrent objects, given they are linearizable.

TL;DR: Many large sequential computers execute operations in a different order than is specified by the program, and a correct execution by each processor does not guarantee the correct execution of the entire program.

TL;DR: Several efficiently recognizable subclasses of the class of senahzable histories are introduced and it is shown how these results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems.