453 search results - page 3 / 91 » Using Symbolic Simulation for Bounded Property Checking |
90
Voted
TACAS
2005
Springer
15 years 6 months ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
116
Voted
ICCD
1995
IEEE
15 years 4 months ago
1995
IEEE
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
137
Voted
ICST
2009
IEEE
14 years 11 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
APSEC
2002
IEEE
15 years 6 months ago
2002
IEEE
Continuous action systems (CAS) is a formalism intended for modeling hybrid systems (systems that combine discrete control with continuous behavior), and proving properties about ...
104
Voted
CHARME
2001
Springer
15 years 4 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...