1226 search results - page 30 / 246 » Proofs, Programs and Abstract Complexity |
122
click to vote
TCC
2009
Springer
16 years 2 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
APLAS
2008
ACM
15 years 4 months ago
2008
ACM
Abstract. Parallel programming is rapidly gaining importance as a vector to develop high performance applications that exploit the improved capabilities of modern computer architec...
VMCAI
2010
Springer
15 years 11 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
108
click to vote
ECCC
2002
15 years 1 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
217
click to vote
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...