5015 search results - page 85 / 1003 » Model Checking a Path |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
ENTCS
2008
13 years 11 months ago
2008
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
ICST
2009
IEEE
13 years 8 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...
FOSSACS
2005
Springer
14 years 4 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
TASE
2007
IEEE
14 years 5 months ago
2007
IEEE
Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD-based symbolic model checking of LTL and ACTL properties in recent years. For genera...