Sciweavers

21 search results - page 3 / 5
» Information Hiding in Probabilistic Concurrent Systems
Sort
View
SOSP
2009
ACM
16 years 29 days ago
PRES: probabilistic replay with execution sketching on multiprocessors
Bug reproduction is critically important for diagnosing a production-run failure. Unfortunately, reproducing a concurrency bug on multi-processors (e.g., multi-core) is challengin...
Soyeon Park, Yuanyuan Zhou, Weiwei Xiong, Zuoning ...
MOBIHOC
2003
ACM
15 years 9 months ago
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster
ICCAD
2008
IEEE
151views Hardware» more  ICCAD 2008»
16 years 1 months ago
Race analysis for SystemC using model checking
—SystemC is a system-level modeling language that offers a wide range of features to describe concurrent systems rent levels of abstraction. The SystemC standard permits simulato...
Nicolas Blanc, Daniel Kroening
CSFW
2007
IEEE
15 years 10 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
CCS
2010
ACM
15 years 4 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov