6608 search results - page 259 / 1322 » On the Completeness of Model Checking |
148
click to vote
CSR
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
162
click to vote
ACSD
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper considers distributed systems, defined as a collection of components interacting through interfaces. Components, interfaces and distributed systems are modeled as Petri...
167
click to vote
FASE
2008
Springer
15 years 7 months ago
2008
Springer
For a number of programming languages, among them Eiffel, C, Java and Ruby, Hoare-style logics and dynamic logics have been developed. In these logics, pre- and postconditions are ...
189
click to vote
TABLEAUX
2009
Springer
16 years 14 days ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. ...
153
click to vote
CHARME
2001
Springer
15 years 9 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...