Extending memory consistency of finite prefixes to infinite computations

DOI10.1007/3-540-44685-0_28MaRDI QIDQ4791847zbMATH OpenFDO

Authors Marcelo Glusman, Shmuel Katz

Publication date 3 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2154/21540411.htm

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Verifying sequential consistency on shared-memory multiprocessor systems
• Computer Aided Verification
• Automatable verification of sequential consistency
• Characterization of a sequentially consistent memory and verification of a cache memory by abstraction
• Testing Shared Memories

Cited in

(1)

• On the definition of sequential consistency

This page was built for publication: Extending memory consistency of finite prefixes to infinite computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791847)