225 search results - page 23 / 45 » From sequential programs to concurrent threads |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
JLP
2011
12 years 10 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
PPOPP
2005
ACM
14 years 1 months ago
2005
ACM
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
CC
2010
Springer
14 years 2 months ago
2010
Springer
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Rely-guarantee is a well-established approach to reasoning about concurrent programs that use parallel composition. However, parallel composition is not how concurrency i...