Sciweavers

401 search results - page 48 / 81
» Delegatable Functional Signatures
Sort
View
IFL
2001
Springer
14 years 1 months ago
A Polynomial-Cost Non-determinism Analysis
Abstract. This paper is an extension of a previous work where two nondeterminism analyses were presented. One of them was efficient but not very powerful and the other one was more...
Ricardo Pena, Clara Segura
DL
1998
Springer
144views Digital Library» more  DL 1998»
14 years 28 days ago
Archival Storage for Digital Libraries
We propose an architecture for Digital Library Repositories that assures long-term archival storage of digital objects. The architecture is formed by a federation of independent b...
Arturo Crespo, Hector Garcia-Molina
RTA
2010
Springer
14 years 18 days ago
Order-Sorted Unification with Regular Expression Sorts
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
Temur Kutsia, Mircea Marin
IWFM
2003
123views Formal Methods» more  IWFM 2003»
13 years 10 months ago
Logic for Computational Effects: Work in Progress
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...
Gordon D. Plotkin, John Power
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 8 months ago
Cryptanalysis of an Efficient Signcryption Scheme with Forward Secrecy Based on Elliptic Curve
The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Several ...
Mohsen Toorani, Ali Asghar Beheshti Shirazi