A Framework to Synergize Partial Order Reduction with State Interpolation
Authors:
Preprint
Abstract
We address the problem of reasoning about interleavings in safety verification of concurrent programs. In the literature, there are two prominent techniques for pruning the search space. First, there are well-investigated trace-based methods, collectively known as "Partial Order Reduction (POR)", which operate by weakening the concept of a trace by abstracting the total order of its transitions into a partial order. Second, there is state-based interpolation where a collection of formulas can be generalized by taking into account the property to be verified. Our main contribution is a framework that synergistically combines POR with state interpolation so that the sum is more than its parts.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Unbounded Symbolic Execution for Program VerificationLecture Notes in Computer Science, 2012
- Lazy Annotation for Program Testing and Verification2010
- Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique2009
- An Interpolation Method for CLP Traversal2009
- Efficient Stateful Dynamic Partial Order Reduction2008
- Peephole Partial Order Reduction2008
- Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions2008
- Z3: An Efficient SMT Solver2008
- Cartesian Partial-Order Reduction2007
- All from one, one for all: on model checking using representatives1993