Sciweavers

55 search results - page 4 / 11
» Robustness Check for Multiple Faults Using Formal Techniques
Sort
View
DAC
1997
ACM
13 years 11 months ago
Equivalence Checking Using Cuts and Heaps
This paper presents a verification technique which is specifically targeted to formally comparing large combinational circuits with some structural similarities. The approach co...
Andreas Kuehlmann, Florian Krohm
ECSA
2011
Springer
12 years 7 months ago
Architecture-Based Run-Time Fault Diagnosis
Abstract. An important step in achieving robustness to run-time faults is the ability to detect and repair problems when they arise in a running system. Effective fault detection a...
Paulo Casanova, Bradley R. Schmerl, David Garlan, ...
ISSTA
2000
ACM
13 years 11 months ago
Verisim: Formal analysis of network simulations
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...
Karthikeyan Bhargavan, Carl A. Gunter, Moonjoo Kim...
ICALP
1994
Springer
13 years 11 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
ATS
2009
IEEE
142views Hardware» more  ATS 2009»
14 years 2 months ago
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
Stephan Eggersglüß, Daniel Tille, Rolf ...