798 search results - page 55 / 160 » Proving More Properties with Bounded Model Checking |
135
click to vote
APAL
2006
15 years 4 months ago
2006
CITY IN ABSTRACT ELEMENTARY CLASSES WITH NO MAXIMAL MODELS MONICA VANDIEREN Abstract. The results in this paper are in a context of abstract elementary classes identified by Shelah...
152
click to vote
SCP
2010
15 years 2 months ago
2010
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
152
click to vote
FMICS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
113
click to vote
TALG
2010
15 years 2 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
145
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...