Abstraction for concurrent objects
From MaRDI portal
Publication:615951
DOI10.1016/j.tcs.2010.09.021zbMath1209.68156MaRDI QIDQ615951
Hongseok Yang, Ivana Filipović, Noam Rinetzky, Peter W. O'Hearn
Publication date: 7 January 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.021
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fully abstract may testing semantics for concurrent objects
- Prespecification in data refinement
- LCF considered as a programming language
- Proof of correctness of data representations
- A unified theory of shared memory consistency
- Abstraction for Concurrent Objects
- The serializability of concurrent database updates
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Representation independence, confinement and access control [extended abstract]
- CONCUR 2004 - Concurrency Theory
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science