정의: In concurrent programming, an operation is linearizable if it consists of an ordered list of invocation and response events, that may be extended by adding response events such that:The extended list can be re-expressed as a sequential history. That sequential history is a subset of the original unextended list.
| 핵심 연구 분야 | Verification |
|---|---|
| 주요 연도 | 2020년 |
| 주요 연관 키워드 | linearizability |
| 좋아요 수 | 0 |