793 search results - page 62 / 159 » Argumentation and standards of proof |
106
click to vote
RSA
2006
15 years 20 days ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
100
Voted
ENTCS
2007
15 years 16 days ago
2007
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
108
click to vote
CADE
2010
Springer
15 years 1 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
105
Voted
ACNS
2006
Springer
15 years 6 months ago
2006
Springer
We propose a new password-based 3-party protocol with a formal security proof in the standard model. Under reasonable assumptions we show that our new protocol is more efficient t...