21 search results - page 3 / 5 » A Formal Reduction for Lock-Free Parallel Algorithms |
LICS
1994
IEEE
14 years 20 days ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
PODC
2012
ACM
11 years 11 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
AAAI
1993
13 years 10 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
PPOPP
2010
ACM
14 years 5 months ago
2010
ACM
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
ICDCS
2008
IEEE
14 years 3 months ago
2008
IEEE
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...