493 search results - page 79 / 99 » Bounded LTL Model Checking with Stable Models |
100
click to vote
SPIN
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
108
click to vote
LICS
2006
IEEE
15 years 5 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...
106
click to vote
EPEW
2010
Springer
15 years 1 days ago
2010
Springer
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
119
click to vote
SIGSOFT
2003
ACM
16 years 17 days ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...