1138 search results - page 66 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
116
click to vote
DLOG
2010
15 years 17 days 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...
138
click to vote
CAV
2009
Springer
16 years 3 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...
134
Voted
ICPP
1999
IEEE
15 years 6 months 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...
121
Voted
CONCUR
2004
Springer
15 years 6 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...
131
Voted
STACS
2010
Springer
15 years 9 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...