Sciweavers

3228 search results - page 119 / 646
» Computationally Sound Proofs
Sort
View
APLAS
2009
ACM
14 years 4 months ago
Proving Copyless Message Passing
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
Jules Villard, Étienne Lozes, Cristiano Cal...
IAT
2007
IEEE
14 years 4 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
DALT
2005
Springer
14 years 3 months ago
Beliefs in Agent Implementation
Abstract. This paper extends a programming language for implementing cognitive agents with the capability to explicitly represent beliefs and reason about them. In this programming...
Laurens Winkelhagen, Mehdi Dastani, Jan Broersen
MPC
2004
Springer
97views Mathematics» more  MPC 2004»
14 years 3 months ago
Friends Need a Bit More: Maintaining Invariants Over Shared State
A friendship system is introduced for modular static verification of object invariants. It extends a previous methodology, based on ownership hierarchy encoded in auxiliary state,...
Michael Barnett, David A. Naumann
TCC
2004
Springer
100views Cryptology» more  TCC 2004»
14 years 3 months ago
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
Ran Canetti, Oded Goldreich, Shai Halevi