Testing Shared Memories
From MaRDI portal
Publication:4376172
DOI10.1137/S0097539794279614zbMath0885.68023MaRDI QIDQ4376172
Phillip B. Gibbons, Ephraim Korach
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (12)
Stateless model checking under a reads-value-from equivalence ⋮ On reducing linearizability to state reachability ⋮ Analyzing linearizability violations in the presence of read-modify-write operations ⋮ Quantifiability: a concurrent correctness condition modeled in vector space ⋮ Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability ⋮ On the complexity of linearizability ⋮ Computing $k$-Atomicity in Polynomial Time ⋮ Concurrent correctness in vector space ⋮ Deciding Robustness against Total Store Ordering ⋮ Unnamed Item ⋮ Fine-grained complexity of safety verification ⋮ On the Complexity of Bounded Context Switching.
This page was built for publication: Testing Shared Memories
