1000 search results - page 133 / 200 » Dependency Tree Automata |
TACAS
2005
Springer
15 years 6 months ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
97
Voted
DLT
2006
15 years 2 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
107
Voted
FMOODS
2003
15 years 2 months ago
2003
Performance analysis of computing systems, in particular distributed computing systems, is a complex process. Analysing the complex flows and interactions between a set of distribu...
104
click to vote
TSE
2010
14 years 11 months ago
2010
Abstract—In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial stud...
137
click to vote
AAAI
2012
13 years 3 months ago
2012
A tailored model of a system is the prerequisite for various analysis tasks, such as anomaly detection, fault identification, or quality assurance. This paper deals with the algo...