6608 search results - page 26 / 1322 » On the Completeness of Model Checking |
122
click to vote
MOVEP
2000
15 years 4 months ago
2000
We survey principles of model checking techniques for the automatic analysis of reactive systems. The use of model checking is exemplified by an analysis of the Needham-Schroeder p...
101
Voted
LPAR
2005
Springer
15 years 6 months ago
2005
Springer
Model checking is a useful method to verify automatically the correctness of a system with respect to a desired behavior, by checking whether a mathematical model of the system sat...
115
Voted
SOCASE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Existing computer science approaches to business modeling offer lowstractions such as data and control flows, which fail to capture the business intent underlying the in...
LPAR
2000
Springer
15 years 4 months ago
2000
Springer
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
110
Voted
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...