Sciweavers

19 search results - page 3 / 4
» How Fail-Stop are Faulty Programs
Sort
View
ICSE
2008
IEEE-ACM
14 years 8 months ago
Testing pervasive software in the presence of context inconsistency resolution services
Pervasive computing software adapts its behavior according to the changing contexts. Nevertheless, contexts are often noisy. Context inconsistency resolution provides a cleaner pe...
Heng Lu, W. K. Chan, T. H. Tse
PASTE
2010
ACM
14 years 16 days ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
MICS
2010
81views more  MICS 2010»
13 years 5 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
ISVLSI
2007
IEEE
121views VLSI» more  ISVLSI 2007»
14 years 1 months ago
Performance of Graceful Degradation for Cache Faults
In sub-90nm technologies, more frequent hard faults pose a serious burden on processor design and yield control. In addition to manufacturing-time chip repair schemes, microarchit...
Hyunjin Lee, Sangyeun Cho, Bruce R. Childers
FLOPS
2006
Springer
13 years 11 months ago
Contracts as Pairs of Projections
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
Robert Bruce Findler, Matthias Blume