Sciweavers

826 search results - page 74 / 166
» Resolving Concurrent Interactions
Sort
View
POPL
2005
ACM
16 years 3 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
141
Voted
TARK
2009
Springer
15 years 10 months ago
An epistemic characterization of zero knowledge
Halpern, Moses and Tuttle presented a definition of interactive proofs using a notion they called practical knowledge, but left open the question of finding an epistemic formula...
Joseph Y. Halpern, Rafael Pass, Vasumathi Raman
129
Voted
COORDINATION
2007
Springer
15 years 9 months ago
Generalized Committed Choice
We present a generalized committed choice construct for concurrent programs that interact with a shared store. The generalized committed choice (GCC) allows multiple computations ...
Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
130
Voted
ICCV
2011
IEEE
14 years 3 months ago
A robust pipeline for rapid feature-based pre-alignment of dense range scans
Aiming at reaching an interactive and simplified usage of high-resolution 3D acquisition systems, this paper presents a fast and automated technique for pre-alignment of dense ra...
Francesco Bonarrigo, Alberto Signoroni, Riccardo L...