100 search results - page 5 / 20 » Event-based Composition of Concurrent Programs |
POPL
1995
ACM
15 years 1 months ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
LOGCOM
2007
14 years 9 months ago
2007
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
118
click to vote
HASKELL
2009
ACM
15 years 4 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. As a resul...
EMSOFT
2009
Springer
15 years 4 months ago
2009
Springer
Concurrent programming languages are growing in importance with the advent of multi-core systems. However, concurrent programs suffer from problems, such as data races and deadloc...