Sciweavers

800 search results - page 55 / 160
» Programming Models for Concurrency and Real-Time
Sort
View
POPL
2005
ACM
16 years 1 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
CONCUR
2009
Springer
15 years 6 months ago
Concurrent Kleene Algebra
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange la...
C. A. R. Hoare, Bernhard Möller, Georg Struth...
PLDI
2012
ACM
13 years 3 months ago
Dynamic synthesis for relaxed memory models
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
Feng Liu, Nayden Nedev, Nedyalko Prisadnikov, Mart...
IEEEPACT
2009
IEEE
14 years 11 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...
CONCURRENCY
2000
99views more  CONCURRENCY 2000»
15 years 1 months ago
The Java memory model is fatally flawed
The Java memory model described in Chapter 17 of the Java Language Specification gives constraints on how threads interact through memory. This chapter is hard to interpret and po...
William Pugh