1894 search results - page 166 / 379 » A TLA Proof System |
158
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
127
click to vote
ICISS
2009
Springer
15 years 10 months ago
2009
Springer
We present a new remote, coercion-free electronic voting protocol which satisfies a number of properties previously considered contradictory. We introduce (and justify) the idea ...
167
click to vote
CCS
2005
ACM
15 years 9 months ago
2005
ACM
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
139
click to vote
TACAS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. A Craig interpolant for a mutually inconsistent pair of formulas (A, B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common ...
121
click to vote
CSL
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...