338 search results - page 61 / 68 » Locally checkable proofs |
POPL
2009
ACM
14 years 10 months ago
2009
ACM
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
STOC
2010
ACM
14 years 6 months ago
2010
ACM
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
WMCSA
2009
IEEE
14 years 4 months ago
2009
IEEE
The increasing reliance of users on wireless networks for Internet connectivity has posed two significant challenges for mobile networking research. The first challenge is to pr...