Abstraction for Concurrent Objects

Authors:
Ivana Filipović;Peter O'Hearn;Noam Rinetzky;Hongseok Yang
Affiliations:
Queen Mary University of London, UK;Queen Mary University of London, UK;Queen Mary University of London, UK;Queen Mary University of London, UK
Venue:
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Year:
2009

Citing 8
Cited 13

Data refinement refined

Proc. of the European symposium on programming on ESOP 86
Prespecification in data refinement

Information Processing Letters
Abstract types have existential type

ACM Transactions on Programming Languages and Systems (TOPLAS)
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Representation independence, confinement and access control [extended abstract]

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Logic for Parametric Polymorphism

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs

IEEE Transactions on Computers
The Art of Multiprocessor Programming

The Art of Multiprocessor Programming

Experience with Model Checking Linearizability

Proceedings of the 16th International SPIN Workshop on Model Checking Software
Abstraction for concurrent objects

Theoretical Computer Science
A shape analysis for optimizing parallel graph programs

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A separation logic for refining concurrent objects

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Liveness-preserving atomicity abstraction

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Testing atomicity of composed concurrent operations

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
A simple abstraction for complex concurrent indexes

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
A rely-guarantee-based simulation for verifying concurrent program transformations

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatically proving linearizability

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Concurrent library correctness on the TSO memory model

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Library abstraction for C/C++ concurrency

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular reasoning about separation of concurrent data structures

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
A programming language perspective on transactional memory consistency

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concurrent data structures are usually designed to satisfy correctness conditions such as sequential consistency and linearizability. In this paper, we consider the following fundamental question: what guarantees are provided by these conditions for client programs? We formally show that these conditions can be characterized in terms of observational refinement. Our study also provides a new understanding of sequential consistency and linearizability in terms of abstraction of dependency between computation steps of client programs.