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)
68Q60: Specification and verification (program logics, model checking, etc.)
68M07: Mathematical problems of computer architecture
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Related Items
Computing $k$-Atomicity in Polynomial Time, Unnamed Item, On the Complexity of Bounded Context Switching., Fine-grained complexity of safety verification, Quantifiability: a concurrent correctness condition modeled in vector space, 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, On the complexity of linearizability, Concurrent correctness in vector space, Deciding Robustness against Total Store Ordering