Sciweavers

244 search results - page 4 / 49
» Generative Operational Semantics for Relaxed Memory Models
Sort
View
TPHOL
2007
IEEE
14 years 4 months ago
Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
Tom Ridge
CAV
2010
Springer
187views Hardware» more  CAV 2010»
14 years 1 months ago
Fences in Weak Memory Models
We present a class of relaxed memory models, defined in Coq, parameterised by the chosen permitted local reorderings of reads and writes, and the visibility of inter- and intra-pr...
Jade Alglave, Luc Maranget, Susmit Sarkar, Peter S...
POPL
2009
ACM
14 years 10 months ago
The semantics of x86-CC multiprocessor machine code
Multiprocessors are now dominant, but real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, t...
Susmit Sarkar, Peter Sewell, Francesco Zappa Narde...
SPAA
2010
ACM
14 years 2 months ago
Transactions in the jungle
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
Rachid Guerraoui, Thomas A. Henzinger, Michal Kapa...
CAV
2010
Springer
179views Hardware» more  CAV 2010»
14 years 1 months ago
Generating Litmus Tests for Contrasting Memory Consistency Models
Well-defined memory consistency models are necessary for writing correct parallel software. Developing and understanding formal specifications of hardware memory models is a chal...
Sela Mador-Haim, Rajeev Alur, Milo M. K. Martin