On Execution-Based Formalization for Sequential Consistency Veriflcation
Ali Sezgin, Ganesh Lalitha Gopalakrishnan · 2005
The adequacy of execution based formalizations in modeling and verifying shared memory systems is discussed. It is argued that unclear sentence.... not comparable. We claim that the decidability problem of sequential consistency for flnite-state systems is an open problem, in contrast with the result of [1].