Sciweavers

9 search results - page 2 / 2
» tacas 2001
Sort
View
TACAS
2001
Springer
92views Algorithms» more  TACAS 2001»
13 years 9 months ago
Language Containment Checking with Nondeterministic BDDs
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
Bernd Finkbeiner
TACAS
2001
Springer
135views Algorithms» more  TACAS 2001»
13 years 9 months ago
Implementing a Multi-valued Symbolic Model Checker
Multi-valued logics support the explicit modeling of uncertainty and disagreement by allowing additional truth values in the logic. Such logics can be used for verification of dyn...
Marsha Chechik, Benet Devereux, Steve M. Easterbro...
TACAS
2001
Springer
125views Algorithms» more  TACAS 2001»
13 years 9 months ago
Coverage Metrics for Temporal Logic Model Checking
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complet...
Hana Chockler, Orna Kupferman, Moshe Y. Vardi
TACAS
2001
Springer
119views Algorithms» more  TACAS 2001»
13 years 9 months ago
Compositional Message Sequence Charts
Abstract. A message sequence chart (MSC) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication pro...
Elsa L. Gunter, Anca Muscholl, Doron Peled