3335 search results - page 107 / 667 » Grid result checking |
140
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
156
Voted
ENTCS
2006
15 years 3 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
158
click to vote
IANDC
2006
15 years 3 months ago
2006
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...
128
click to vote
ITA
2007
15 years 3 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
144
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...