Sciweavers

691 search results - page 129 / 139
» Automatically Proving Linearizability
Sort
View
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
14 years 4 months ago
How Bayesians Debug
Manual debugging is expensive. And the high cost has motivated extensive research on automated fault localization in both software engineering and data mining communities. Fault l...
Chao Liu 0001, Zeng Lian, Jiawei Han
LICS
2006
IEEE
14 years 4 months ago
Provable Implementations of Security Protocols
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
Andrew D. Gordon
ANCS
2006
ACM
14 years 4 months ago
WormTerminator: an effective containment of unknown and polymorphic fast spreading worms
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang
PLDI
2006
ACM
14 years 4 months ago
SAFECode: enforcing alias analysis for weakly typed languages
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve
VEE
2006
ACM
102views Virtualization» more  VEE 2006»
14 years 4 months ago
A stackless runtime environment for a Pi-calculus
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
Frédéric Peschanski, Samuel Hym