1894 search results - page 158 / 379 » A TLA Proof System |
131
click to vote
TCC
2004
Springer
15 years 9 months ago
2004
Springer
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
146
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
126
Voted
GI
2009
Springer
15 years 8 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
105
click to vote
FOSSACS
2001
Springer
15 years 8 months ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
118
click to vote
LICS
1989
IEEE
15 years 8 months ago
1989
IEEE
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the...