788 search results - page 54 / 158 » Symbolic Equivalence Checking |
100
click to vote
TACAS
2001
Springer
15 years 7 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...
111
click to vote
AAAI
2004
15 years 4 months ago
2004
Model checking is a promising approach to automatic verification, which has concentrated on specification expressed in temporal logic. Comparatively little attention has been give...
146
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
150
click to vote
CHARME
2001
Springer
15 years 6 months ago
2001
Springer
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
113
Voted
APSEC
2002
IEEE
15 years 8 months ago
2002
IEEE
Continuous action systems (CAS) is a formalism intended for modeling hybrid systems (systems that combine discrete control with continuous behavior), and proving properties about ...