Testing Shared Memories

DOI10.1137/S0097539794279614zbMath0885.68023MaRDI QIDQ4376172

Ephraim Korach, Phillip B. Gibbons

Publication date: 10 February 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

NP-completeness; testing; multiprocessors; linearizability; shared memory; sequential consistency

Mathematics Subject Classification ID

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

On reducing linearizability to state reachability, Deciding Robustness against Total Store Ordering