3228 search results - page 284 / 646 » Computationally Sound Proofs |
127
click to vote
CCS
2009
ACM
15 years 11 months ago
2009
ACM
We introduce HAIL (High-Availability and Integrity Layer), a distributed cryptographic system that allows a set of servers to prove to a client that a stored file is intact and r...
157
Voted
WOLLIC
2009
Springer
15 years 11 months ago
2009
Springer
Bi-intuitionistic logic is the extension of intuitionistic logic with exclusion, a connective dual to implication. Cut-elimination in biintuitionistic logic is complicated due to t...
123
Voted
COCO
2009
Springer
15 years 11 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
128
Voted
ARTS
1997
Springer
15 years 8 months ago
1997
Springer
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
143
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...