2 search results - page 1 / 1 » Language Containment Checking with Nondeterministic BDDs |
TACAS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
KBSE
2007
IEEE
13 years 11 months ago
2007
IEEE
Programs written in languages that provide direct access to memory through pointers often contain memory-related faults, which may cause non-deterministic failures and even securi...