Sciweavers

2 search results - page 1 / 1
» Programming a Symbolic Model Checker in a Fully Expansive Th...
Sort
View
TPHOL
2003
IEEE
13 years 9 months ago
Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
Hasan Amjad
BCS
2008
13 years 5 months ago
Hardware Dependability in the Presence of Soft Errors
Using formal verification for designing hardware designs free from logic design bugs has been an active area of research since the last 15 years. Technology has matured and we hav...
Ashish Darbari, Bashir M. Al-Hashimi