2300 search results - page 252 / 460 » Maximally Concurrent Programs |
166
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
The actor model has already proven itself as an interesting concurrency model that avoids issues such as deadlocks and race conditions by construction, and thus facilitates concur...
156
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
129
click to vote
ESOP
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. We propose a new formalisation of stability for Rely-Guarantee, in which an assertion's stability is encoded into its syntactic form. This allows two advances in mod...
153
click to vote
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
152
click to vote
IPPS
2007
IEEE
16 years 26 days ago
2007
IEEE
Model checking, logging, debugging, and checkpointing/recovery are great tools to identify bugs in small sequential programs. The direct application of these techniques to the dom...