4502 search results - page 90 / 901 » Regular Model Checking |
90
Voted
ENTCS
2008
15 years 22 days 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.
132
click to vote
ICST
2009
IEEE
14 years 10 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...
97
Voted
FOSSACS
2005
Springer
15 years 6 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 ...
85
Voted
TASE
2007
IEEE
15 years 7 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...
85
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...