1161 search results - page 122 / 233 » Kinetic Dependence Graphs |
119
Voted
CCS
2007
ACM
15 years 6 months ago
2007
ACM
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
104
click to vote
FASE
2005
Springer
15 years 6 months ago
2005
Springer
This tool paper describes a modular program slicer for Java built using the Indus program analysis framework along with it’s Eclipse-based user interface called Kaveri. Indus pro...
67
Voted
ICDCS
2003
IEEE
15 years 6 months ago
2003
IEEE
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
98
Voted
ATAL
2003
Springer
15 years 6 months ago
2003
Springer
Agents must decide with whom to interact, which is nontrivial when no central directories are available. A classical decentralized approach is referral systems, where agents adapt...
105
Voted
CONCUR
2003
Springer
15 years 6 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...