125 search results - page 16 / 25 » Computing Over-Approximations with Bounded Model Checking |
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
GLVLSI
2009
IEEE
14 years 2 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
SPIN
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, we describe our application of SPIN 1 to model an algorithm used to synchronize the clocks of modules that provide periodic real-time communication over a network. W...
DAC
2005
ACM
13 years 9 months ago
2005
ACM
We propose a normalization technique for verifying arithmetic circuits in a bounded model checking environment. Our technique operates on the arithmetic bit level (ABL) descriptio...
CGF
1998
13 years 7 months ago
1998
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...