1810 search results - page 19 / 362 » Type Systems for Distributed Data Structures |
EEF
2000
13 years 11 months ago
2000
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...
WETICE
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency ex...
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
IPTPS
2005
Springer
14 years 1 months ago
2005
Springer
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
DAGSTUHL
1993
13 years 8 months ago
1993
In this paper we present a type system for graph rewrite systems: uniqueness typing. It employs usage information to deduce whether an object is `unique' at a certain moment,...