1138 search results - page 66 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
DLOG
2010
13 years 5 months ago
2010
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
ICPP
1999
IEEE
14 years 2 days ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
CONCUR
2004
Springer
13 years 11 months ago
2004
Springer
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...