Sciweavers

338 search results - page 26 / 68
» Locally checkable proofs
Sort
View
ENTCS
2002
78views more  ENTCS 2002»
13 years 9 months ago
Theoretical Foundations of Value Withdrawal Explanations for Domain Reduction
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
LICS
2010
IEEE
13 years 7 months ago
A Sound and Complete Calculus for Finite Stream Circuits
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
Stefan Milius
MICS
2008
63views more  MICS 2008»
13 years 9 months ago
Unambiguous Automata
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second o...
Marie-Pierre Béal, Eugen Czeizler, Jarkko K...
PODC
2010
ACM
14 years 1 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
ADCM
2010
90views more  ADCM 2010»
13 years 9 months ago
Local reconstruction for sampling in shift-invariant spaces
The local reconstruction from samples is one of most desirable properties for many applications in signal processing, but it has not been given as much attention. In this paper, we...
Qiyu Sun