319 search results - page 53 / 64 » Space-Efficient Bounded Model Checking |
TPHOL
2005
IEEE
14 years 3 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
CAV
2003
Springer
14 years 3 months ago
2003
Springer
ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai1 , Chao Wang2, Zijiang Yang1, Pranav Ashar1 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University ...
DDECS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
PUK
2000
13 years 11 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
QEST
2007
IEEE
14 years 4 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...