Sciweavers

338 search results - page 31 / 68
» Locally checkable proofs
Sort
View
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 9 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
ECAI
2010
Springer
13 years 9 months ago
Brothers in Arms? On AI Planning and Cellular Automata
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...
Jörg Hoffmann, Nazim Fatès, Héc...
CONCUR
2004
Springer
14 years 2 months ago
A Semantics for Concurrent Separation Logic
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...
Stephen D. Brookes
MDM
2010
Springer
193views Communications» more  MDM 2010»
14 years 1 months ago
Data-Based Agreement for Inter-vehicle Coordination
Abstract—Data-based agreement is increasingly used to implement traceable coordination across mobile entities such as adhoc networked (autonomous) vehicles. In our work, we focus...
Brahim Ayari, Abdelmajid Khelil, Kamel Saffar, Nee...
CADE
2000
Springer
14 years 1 months ago
Machine Instruction Syntax and Semantics in Higher Order Logic
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
Neophytos G. Michael, Andrew W. Appel