261 search results - page 28 / 53 » Proof Normalization Modulo |
162
click to vote
CSL
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
185
click to vote
RTA
2005
Springer
15 years 11 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
146
click to vote
EUROCRYPT
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
157
click to vote
FOSSACS
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We propose a denotational semantics for the two-level language of [GJ91, Gom92], and prove its correctness w.r.t. a standard denotational semantics. Other researchers (se...
154
click to vote
ASIACRYPT
2006
Springer
15 years 9 months ago
2006
Springer
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...