6608 search results - page 113 / 1322 » On the Completeness of Model Checking |
122
click to vote
TASE
2007
IEEE
15 years 10 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...
120
click to vote
MFCS
2009
Springer
15 years 11 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...
123
click to vote
FORMATS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
123
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
134
click to vote
CAV
1998
Springer
15 years 8 months ago
1998
Springer
It has become good practice to expect authors of new model checking algorithms to provide not only rigorous evidence of the algorithms correctness, but also evidence of their pract...