402 search results - page 27 / 81 » Model Checking Quantified Computation Tree Logic |
EACL
1989
ACL Anthology
13 years 11 months ago
1989
ACL Anthology
In this paper, we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISL...
WOLLIC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
LICS
1994
IEEE
14 years 1 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
DATE
2007
IEEE
14 years 4 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
14 years 10 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...