Amanote Research
Register
Sign In
Proving Correctness of Highly-Concurrent Linearisable Objects
doi 10.1145/1122971.1122992
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2006
Authors
Viktor Vafeiadis
Maurice Herlihy
Tony Hoare
Marc Shapiro
Publisher
ACM Press
Related search
A Methodology for Implementing Highly Concurrent Data Objects
Operating Systems Review (ACM)
Hardware
Computer Networks
Information Systems
Architecture
Communications
Proving the Correctness of Recursion-Based Automatic Program Transformations
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Axiomatic Characterization of Trace Reachability for Concurrent Objects
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Supporting Lock-Free Composition of Concurrent Data Objects
A Dynamic Class Construct for Asynchronous Concurrent Objects
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Highly Non-Concurrent Longest Paths in Lattices
Turkish Journal of Mathematics
Mathematics
General Correctness: A Unification of Partial and Total Correctness
Acta Informatica
Computer Networks
Software
Information Systems
Communications
Informational Properties of Infinite Numbers of Objects in Concurrent Discriminations by Monkeys
Animal Learning & Behavior
A Formal Specification of the Correctness Criteria for Concurrent Executions of a Transaction System in Real Time Databases.
Journal of Computer Science and Cybernetics
