Abstraction for Concurrent Objects
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Filipovic, Ivana | ko |
| dc.contributor.author | O'Hearn, Peter | ko |
| dc.contributor.author | Rinetzky, Noam | ko |
| dc.contributor.author | Yang, Hongseok | ko |
| dc.date.accessioned | 2017-08-08T06:54:32Z | - |
| dc.date.available | 2017-08-08T06:54:32Z | - |
| dc.date.created | 2017-08-02 | - |
| dc.date.created | 2017-08-02 | - |
| dc.date.created | 2017-08-02 | - |
| dc.date.created | 2017-08-02 | - |
| dc.date.issued | 2010-12 | - |
| dc.identifier.citation | THEORETICAL COMPUTER SCIENCE, v.411, no.51-52, pp.4379 - 4398 | - |
| dc.identifier.issn | 0304-3975 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/225286 | - |
| dc.description.abstract | Concurrent data structures are usually designed to satisfy correctness conditions such as sequential consistency or 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. (C) 2010 Elsevier B.V. All rights reserved. | - |
| dc.language | English | - |
| dc.publisher | ELSEVIER SCIENCE BV | - |
| dc.title | Abstraction for Concurrent Objects | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000285526900003 | - |
| dc.identifier.scopusid | 2-s2.0-78649324033 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 411 | - |
| dc.citation.issue | 51-52 | - |
| dc.citation.beginningpage | 4379 | - |
| dc.citation.endingpage | 4398 | - |
| dc.citation.publicationname | THEORETICAL COMPUTER SCIENCE | - |
| dc.identifier.doi | 10.1016/j.tcs.2010.09.021 | - |
| dc.contributor.localauthor | Yang, Hongseok | - |
| dc.contributor.nonIdAuthor | Filipovic, Ivana | - |
| dc.contributor.nonIdAuthor | O'Hearn, Peter | - |
| dc.contributor.nonIdAuthor | Rinetzky, Noam | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | Linearizability | - |
| dc.subject.keywordAuthor | Sequential consistency | - |
| dc.subject.keywordAuthor | Observational equivalence | - |
| dc.subject.keywordAuthor | Observational refinement | - |
| dc.subject.keywordPlus | REFINEMENT | - |
| dc.subject.keywordPlus | MEMORY | - |
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 74 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.