Sciweavers

200 search results - page 5 / 40
» A Protocol for Execution of Distributed Logic Programs
Sort
View
84
Voted
ENTCS
2002
143views more  ENTCS 2002»
14 years 10 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...
97
Voted
VLDB
1990
ACM
166views Database» more  VLDB 1990»
15 years 2 months ago
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...
Divyakant Agrawal, Amr El Abbadi
193
Voted
ICLP
2009
Springer
15 years 11 months ago
A Language for Large Ensembles of Independently Executing Nodes
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
Michael P. Ashley-Rollman, Peter Lee, Seth Copen G...
67
Voted
PPOPP
2009
ACM
15 years 10 months ago
Serialization sets: a dynamic dependence-based parallel execution model
This paper proposes a new parallel execution model where programmers augment a sequential program with pieces of code called serializers that dynamically map computational operati...
Matthew D. Allen, Srinath Sridharan, Gurindar S. S...
93
Voted
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 3 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi