Optimistic Synchronization-Based State-Space Reduction
Scott D. Stoller and Ernie Cohen

Reductions that aggregate fine-grained transitions into coarser transitions can significantly reduce the cost of automated verification, by reducing the size of the state space. We propose a reduction that can exploit common synchronization disciplines, such as the use of mutual exclusion for accesses to shared data structures. Exploiting them using traditional reduction theorems requires checking that the discipline is followed in the original (\ie, unreduced) system. That check can be prohibitively expensive. This paper presents a reduction that instead requires checking whether the discipline is followed in the reduced system. This check may be much cheaper, because the reachable state space is smaller.

TACAS 2003 paper:
BibTeX    gzip'd PostScript    PostScript    PDF

Technical Report:
BibTeX    PDF

Scott Stoller's Home Page