22 search results - page 1 / 5 » Operational Reasoning for Concurrent Caml Programs and Weak ... |
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
ISOLA
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Memory models of shared memory concurrent programs define the values a read of a shared memory location is allowed to see. Such memory models are typically weaker than t...
POPL
2009
ACM
14 years 5 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
ECOOP
2010
Springer
13 years 9 months ago
2010
Springer
ncy Abstractions on x86-TSO Scott Owens University of Cambridge Abstract. With the rise of multi-core processors, shared-memory concurrency has become a widespread feature of compu...
ESOP
2012
Springer
12 years 16 days ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only appropriate for sequentially consistent mem...