212 search results - page 29 / 43 » Completeness and Complexity of Bounded Model Checking |
195
click to vote
FMOODS
2008
15 years 3 months ago
2008
In this work, novel symbolic step encodings of the transition relation for object based communicating state machines are presented. This class of systems is tailored to capture the...
156
Voted
CORR
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
129
click to vote
COCO
2008
Springer
15 years 3 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
135
click to vote
TACAS
2001
Springer
15 years 6 months ago
2001
Springer
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
120
click to vote
FATES
2003
Springer
15 years 7 months ago
2003
Springer
Use of model-checking approaches for test generation from requirement models have been proposed by several researchers. These approaches leverage the witness (or counter-example) ...