322 search results - page 25 / 65 » Symbolic model checking of institutions |
CHARME
2001
Springer
13 years 11 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...
FMCAD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
CADE
2008
Springer
14 years 8 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-...
SPIN
2010
Springer
13 years 6 months ago
2010
Springer
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
FMSD
1998
13 years 7 months ago
1998
Proving the equivalenceof two Finite State Machines (FSMs) has many applications to synthesis, veri cation, testing, and diagnosis. Building their product machine is a theoretical ...