Testing distributed systems for correctness requires a formal definition of what 'correct' means. Linearizability is introduced as a strong consistency model where every operation appears to execute atomically at some point between its invocation and response. While linearizability checking is NP-complete (reducible from subset
Sort: