Automatic Checking of Aggregation Abstractions Through State Enumeration (0)
| Citations: | 1 - 0 self |
BibTeX
@MISC{Park_automaticchecking,
author = {Seungjoon Park and Satyaki Das and David L. Dill},
title = {Automatic Checking of Aggregation Abstractions Through State Enumeration},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ions Through State Enumeration Seungjoon Park Satyaki Das David L. Dill Computer Systems Laboratory, Stanford University Gates f358, 312, 314g, Stanford University, Ca 94305, U. S. A. fpark@turnip, satyaki@turnip, dill@csg.stanford.edu Abstract We present a technique for checking aggregation abstractions automatically using a finite-state enumerator. The abstraction relation between implementation and specification is checked on-the-fly and the verification requires examining no more states than checking a simple invariant property. This technique can be used alone for verification of finite-state protocols, or as preparation for a more general aggregation proof using a general-purpose theorem-prover. We illustrate the technique on the cache coherence protocol in the Flash multiprocessor system. Keywords Automatic verification, cache coherence protocols, distributed systems, aggregation abstraction, formal methods 1 INTRODUCTION Formal verification of a system design compares tw...
