Sciweavers

2300 search results - page 71 / 460
» Maximally Concurrent Programs
Sort
View
ASPLOS
2010
ACM
14 years 4 months ago
ConMem: detecting severe concurrency bugs through an effect-oriented approach
Multicore technology is making concurrent programs increasingly pervasive. Unfortunately, it is difficult to deliver reliable concurrent programs, because of the huge and non-det...
Wei Zhang, Chong Sun, Shan Lu
DFT
2003
IEEE
246views VLSI» more  DFT 2003»
14 years 3 months ago
Low Cost Convolutional Code Based Concurrent Error Detection in FSMs
We discuss the use of convolutional codes to perform concurrent error detection (CED) in finite state machines (FSMs). We examine a previously proposed methodology, we identify i...
Konstantinos Rokas, Yiorgos Makris, Dimitris Gizop...
FOSSACS
2004
Springer
14 years 3 months ago
Angelic Semantics of Fine-Grained Concurrency
We introduce a game model for an Algol-like programming language with primitives for parallel composition and synchronization on semaphores. The semantics is based on a simplifie...
Dan R. Ghica, Andrzej S. Murawski
PLDI
2012
ACM
12 years 14 days ago
Reagents: expressing and composing fine-grained concurrency
Efficient communication and synchronization is crucial for finegrained parallelism. Libraries providing such features, while indispensable, are difficult to write, and often ca...
Aaron Turon
ESOP
2004
Springer
14 years 3 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn