@book{3e8ebeadb46d453bb7ba1db8b2d08f06,
title = "Verifying Sequentially Consistent Memory",
abstract = "In distributed shared memory architectures, memory usually obeys weaker constraints than that of ordinary memory in (cache-less) single processor systems. One popular weakening is that of sequential consistency. Proving that a memory is sequentialy consistent does not easily fit the standard refinement and verification strategies. This paper takes a sequential consistent memory-the lazy caching protocol-and verifies it using a number of verification approaches. In almost all cases, existing approaches have to be generalized first.",
author = "Ed Brinksma and Jim Davies and Rob Gerth and Susanne Graf and Wil Janssen and Bengt Jonsson and Shmuel Katz and Gavin Lowe and Mannes Poel and Amir Pnueli and Camilla Rump and Job Zwiers",
year = "1994",
language = "English",
series = "Computing Science Report",
publisher = "Technische Universiteit Eindhoven, Wiskunde \& Informatica",
number = "94/44",
}