Sciweavers

6149 search results - page 434 / 1230
» Revealing the programming process
Sort
View
SAC
2009
ACM
16 years 1 months ago
Celling SHIM: compiling deterministic concurrency to a heterogeneous multicore
Parallel architectures are the way of the future, but are notoriously difficult to program. In addition to the low-level constructs they often present (e.g., locks, DMA, and non-...
Nalini Vasudevan, Stephen A. Edwards
RAID
2009
Springer
16 years 1 months ago
Automatically Adapting a Trained Anomaly Detector to Software Patches
Abstract. In order to detect a compromise of a running process based on it deviating from its program’s normal system-call behavior, an anomaly detector must first be trained wi...
Peng Li, Debin Gao, Michael K. Reiter
DCOSS
2005
Springer
16 years 13 days ago
Macro-programming Wireless Sensor Networks Using Kairos
The literature on programming sensor networks has focused so far on g higher-level abstractions for expressing local node behavior. Kairos is a natural next step in sensor network ...
Ramakrishna Gummadi, Omprakash Gnawali, Ramesh Gov...
EDCC
2005
Springer
16 years 13 days ago
Adding Fault-Tolerance Using Pre-synthesized Components
We present a hybrid synthesis method for automatic addition of fault-tolerance to distributed programs. In particular, we automatically specify and add pre-synthesized fault-tolera...
Sandeep S. Kulkarni, Ali Ebnenasir
TACS
2001
Springer
15 years 11 months ago
The UDP Calculus: Rigorous Semantics for Real Networking
Network programming is notoriously hard to understand: one has to deal with a variety of protocols (IP, ICMP, UDP, TCP etc), concurrency, packet loss, host failure, timeouts, the c...
Andrei Serjantov, Peter Sewell, Keith Wansbrough