852 search results - page 105 / 171 » entcs 2010 |
94
Voted
ENTCS
2007
15 years 13 days ago
2007
ed Metatheory (Extended Abstract) Andrew W. Appel Princeton University and INRIA Rocquencourt Xavier Leroy INRIA Rocquencourt We propose a benchmark to compare theorem-proving sys...
130
click to vote
ENTCS
2007
15 years 13 days ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
139
click to vote
ENTCS
2007
15 years 13 days ago
2007
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
103
Voted
ENTCS
2007
15 years 13 days ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
ENTCS
2007
15 years 13 days ago
2007
If a program does not fulfill a given specification, a model checker delivers a counterexample, a run which demonstrates the wrong behavior. Even with a counterexample, locating...