175 search results - page 27 / 35 » The Complexity of Model Checking Higher-Order Fixpoint Logic |
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...
115
click to vote
USS
2010
14 years 7 months ago
2010
Web applications are the most common way to make services and data available on the Internet. Unfortunately, with the increase in the number and complexity of these applications, ...
ATVA
2004
Springer
15 years 1 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
93
Voted
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
CHARME
2005
Springer
15 years 3 months ago
2005
Springer
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...