6608 search results - page 137 / 1322 » On the Completeness of Model Checking |
138
click to vote
DBPL
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
116
click to vote
ENTCS
2006
15 years 4 months ago
2006
We implement a specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers and compare the results. Key words: Crypto...
147
click to vote
ILC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We aim at checking safety and temporal properties over models representing the behavior of programs manipulating dynamic singly-linked lists. The properties we consider n...
133
click to vote
SPIN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
258
click to vote
FMCAD
1998
Springer
15 years 8 months ago
1998
Springer
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...