175 search results - page 11 / 35 » The Complexity of Model Checking Higher-Order Fixpoint Logic |
175
click to vote
LFCS
2007
Springer
15 years 12 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
161
click to vote
CSL
2009
Springer
16 years 12 days ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
133
click to vote
LICS
2009
IEEE
16 years 14 days ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
190
click to vote
TPHOL
1999
IEEE
15 years 10 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
156
click to vote
FORMATS
2008
Springer
15 years 7 months ago
2008
Springer
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...