Sciweavers

114 search results - page 7 / 23
» Using likely program invariants to detect hardware errors
Sort
View
SIGSOFT
2002
ACM
15 years 10 months ago
Invariant inference for static checking
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
Jeremy W. Nimmer, Michael D. Ernst
VTS
2007
IEEE
203views Hardware» more  VTS 2007»
15 years 3 months ago
Multiple Bit Upset Tolerant Memory Using a Selective Cycle Avoidance Based SEC-DED-DAEC Code
Conventional error correcting code (ECC) schemes used in memories and caches cannot correct double bit errors caused by a single event upset (SEU). As memory density increases, mu...
Avijit Dutta, Nur A. Touba
TOOLS
2008
IEEE
15 years 3 months ago
Towards Raising the Failure of Unit Tests to the Level of Compiler-Reported Errors
Running unit tests suites with contemporary tools such as JUNIT can show the presence of bugs, but not their locations. This is different from checking a program with a compiler, w...
Friedrich Steimann, Thomas Eichstädt-Engelen,...
83
Voted
ISSTA
2010
ACM
14 years 11 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
90
Voted
SC
2004
ACM
15 years 2 months ago
Assessing Fault Sensitivity in MPI Applications
Today, clusters built from commodity PCs dominate high-performance computing, with systems containing thousands of processors now being deployed. As node counts for multi-teraflo...
Charng-da Lu, Daniel A. Reed