Sciweavers

1157 search results - page 28 / 232
» Descriptive Complexity and Model Checking
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Optimal Sub-Shape Models by Minimum Description Length
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowle...
Georg Langs, Philipp Peloschek, Horst Bischof
ISSTA
1998
ACM
13 years 11 months ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...
FOSSACS
2011
Springer
12 years 11 months ago
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
Naoki Kobayashi
TAMC
2009
Springer
14 years 2 months ago
Best-Order Streaming Model
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
Atish Das Sarma, Richard J. Lipton, Danupon Nanong...
TACAS
2007
Springer
110views Algorithms» more  TACAS 2007»
14 years 1 months ago
Counterexamples in Probabilistic Model Checking
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
Tingting Han, Joost-Pieter Katoen