21 search results - page 3 / 5 » A Formal Reduction for Lock-Free Parallel Algorithms |
114
Voted
LICS
1994
IEEE
15 years 5 months 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 ...
140
click to vote
PODC
2012
ACM
13 years 3 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...
102
Voted
AAAI
1993
15 years 2 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...
126
Voted
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
124
Voted
ICDCS
2008
IEEE
15 years 7 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...