2872 search results - page 207 / 575 » On (Omega-)Regular Model Checking |
112
click to vote
CAV
2006
Springer
15 years 3 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
101
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Requirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-orient...
ENTCS
2010
14 years 11 months ago
2010
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
ENTCS
2006
14 years 11 months ago
2006
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
IJDE
2007
14 years 11 months ago
2007
Inconsistencies in various data structures, such as missing log records and modified operating system files, have long been used by intrusion investigators and forensic analysts a...