56 search results - page 8 / 12 » The Complexity of Model Checking Higher Order Fixpoint Logic |
KBSE
2007
IEEE
15 years 4 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
113
click to vote
PODS
1994
ACM
15 years 1 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
103
click to vote
TPHOL
1999
IEEE
15 years 1 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...
DAGSTUHL
2003
14 years 11 months ago
2003
Abstract. In this paper, we show how the concepts of objects, components, features and agents are used today in the Agent Building Center (ABC) environment in order to marry the mo...
CONCUR
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...