713 search results - page 43 / 143 » Model Checking and Transitive-Closure Logic |
112
click to vote
TIME
2003
IEEE
15 years 4 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
100
click to vote
CSFW
2004
IEEE
15 years 2 months ago
2004
IEEE
This paper describes how symbolic techniques (in particular, OBDD's) may be used to to implement an algorithm for model checking specifications in the logic of knowledge for ...
DATE
2007
IEEE
15 years 5 months ago
2007
IEEE
This paper focuses on inductive invariants in unbounded model checking to improve efficiency and scalability. First of all, it introduces optimized techniques to speedup the comp...
CADE
2004
Springer
15 years 11 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
WOLLIC
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In this paper, we present a three-valued property driven model checking algorithm for the logic CTL on hybrid automata. The technique of multivalued model checking for hy...