Sciweavers

14 search results - page 3 / 3
» FIFO anomaly is unbounded
Sort
View
MFCS
1994
Springer
13 years 9 months ago
A Proof System for Asynchronously Communicating Deterministic Processes
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
Frank S. de Boer, M. van Hulst
ICALP
2003
Springer
13 years 10 months ago
Quantitative Analysis of Probabilistic Lossy Channel Systems
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
Alexander Moshe Rabinovich
POPL
2010
ACM
14 years 2 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
NJC
2000
169views more  NJC 2000»
13 years 5 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann