Sciweavers

536 search results - page 57 / 108
» A computer verified, monadic, functional implementation of t...
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
15 years 6 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
NGC
1998
Springer
171views Communications» more  NGC 1998»
15 years 5 months ago
Programming Languages for Distributed Applications
Much progress has been made in distributed computing in the areas of distribution structure, open computing, fault tolerance, and security. Yet, writing distributed applications r...
Seif Haridi, Peter Van Roy, Per Brand, Christian S...
CLUSTER
2006
IEEE
15 years 6 months ago
Optimizing MPI collective communication by orthogonal structures
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
PLPV
2009
ACM
16 years 3 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
CIA
2008
Springer
15 years 8 months ago
Towards an Open Negotiation Architecture for Heterogeneous Agents
This paper presents the design of an open architecture for heterogeneous negotiating agents. Both the system level architecture as well as the architecture for negotiating agents a...
Koen V. Hindriks, Catholijn M. Jonker, Dmytro Tykh...