Sciweavers

2137 search results - page 379 / 428
» Proving Abstract Non-interference
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao
IPPS
2010
IEEE
13 years 7 months ago
BitTorrent and fountain codes: friends or foes?
Abstract--BitTorrent is the most popular file sharing protocol on the Internet. It is proved that its performance are nearoptimal for generic file distribution when the overlay is ...
Salvatore Spoto, Rossano Gaeta, Marco Grangetto, M...
IPPS
2010
IEEE
13 years 7 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
POPL
2009
ACM
14 years 10 months ago
Masked types for sound object initialization
This paper presents a type-based solution to the long-standing problem of object initialization. Constructors, the conventional mechanism for object initialization, have semantics...
Xin Qi, Andrew C. Myers
CAV
2009
Springer
206views Hardware» more  CAV 2009»
14 years 10 months ago
D-Finder: A Tool for Compositional Deadlock Detection and Verification
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
Saddek Bensalem, Marius Bozga, Thanh-Hung Nguyen, ...