3333 search results - page 304 / 667 » Abstract Proof Search |
141
click to vote
AIPS
1996
15 years 8 months ago
1996
Weintroduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmementproceeds by stepwise transforming nonco...
178
click to vote
FORTE
1996
15 years 8 months ago
1996
In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the speci cation and analysis of distributed systems. This pre-order com...
170
click to vote
CRYPTO
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...
145
click to vote
ACTA
2010
15 years 6 months ago
2010
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...