Optimistic Synchronization-Based State-Space Reduction

@inproceedings{Stoller2003OptimisticSS,
  title={Optimistic Synchronization-Based State-Space Reduction},
  author={Scott D. Stoller and Ernie Cohen},
  booktitle={TACAS},
  year={2003}
}
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 (i.e., unreduced) system. That check can be… CONTINUE READING

Tables and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

Transactions for Software Model Checking

VIEW 7 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Adapting Petri Nets Reductions to Promela Specifications

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Sound Transaction-Based Reduction Without Cycle Detection

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Combining sequentialization-based verification of multi-threaded C programs with symbolic Partial Order Reduction

VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

Verifying SystemC: A software model checking approach

VIEW 1 EXCERPT
CITES BACKGROUND

Finding and Reproducing Heisenbugs in Concurrent Programs

VIEW 1 EXCERPT
CITES METHODS

Formal Functional Verification of Device Drivers

VIEW 1 EXCERPT
CITES RESULTS

Peephole Partial Order Reduction

VIEW 1 EXCERPT
CITES METHODS