Sciweavers

769 search results - page 52 / 154
» Where Is the Proof
Sort
View
ASIACRYPT
2009
Springer
14 years 3 months ago
Group Encryption: Non-interactive Realization in the Standard Model
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encryp...
Julien Cathalo, Benoît Libert, Moti Yung
TLCA
1993
Springer
14 years 27 days ago
Recursive Types Are not Conservative over F
d abstract) Giorgio Ghelli1 F≤ is a type system used to study the integration of inclusion and parametric polymorphism. F≤ does not include a notion of recursive types, but ext...
Giorgio Ghelli
TELSYS
2002
126views more  TELSYS 2002»
13 years 8 months ago
Framework and Tool Support for Formal Verification of Highspeed Transfer Protocol Designs
Formal description techniques, verification methods, and their tool-based automated application meanwhile provide valuable support for the formal analysis of communication protocol...
Peter Herrmann, Heiko Krumm, Olaf Drögehorn, ...
FOCS
2008
IEEE
14 years 3 months ago
On the Union of Cylinders in Three Dimensions
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
Esther Ezra
JUCS
2006
131views more  JUCS 2006»
13 years 8 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita