The Benefit of Concurrency in Model Checking

The Benefit of Concurrency in Model Checking

Cached

Download Links

[www.eecs.berkeley.edu]

by Baruch Sterin , Niklas Een , Alan Mishchenko , Robert Brayton

BibTeX

@MISC{Sterin_thebenefit,
    author = {Baruch Sterin and Niklas Een and Alan Mishchenko and Robert Brayton},
    title = {The Benefit of Concurrency in Model Checking},
    year = {}
}

Bookmark

OpenURL

Abstract

Model checking (MC) offers an application amenable to the use of concurrency in some innovative ways. In this paper we focus on solving single, hard properties, and show how concurrency can be used to orchestrate the MC engines in a more robust way compared to traditional, non-concurrent solutions. Through a Python front-end to ABC, with concurrency capabilities, we demonstrate enhanced performance on both academic and industrial problems. 2

Citations

152	Interpolation and SAT-Based Model Checking - McMillan - 2003
103	Bounded model checking using satisfiability solving - Clarke, Bierea, et al.
92	Automatic abstraction without counter examples - McMillan, Amla - 2003
63	DAG-aware AIG rewriting: A fresh look at combinational logic synthesis - Mishchenko, Chatterjee, et al.
51	Smart simulation using collaborative formal and simulation engines - Ho, Shiple, et al.
25	Scalable automated verification via expert-system guided transformations - Mony, Baumgartner, et al. - 2004
24	Exploiting suspected redundancy without proving it - Mony, Baumgartner, et al. - 2005
23	P.: Iterative abstraction using SAT-based BMC with proof analysis - Gupta, Ganai, et al.
21	Scalable sequential equivalence checking across arbitrary design transformations - Baumgartner, Mony, et al.
16	Scalable and scalably-verifiable sequential synthesis - Mishchenko, Case, et al.
15	Automatic generalized phase abstraction for formal verification - Bjesse, Kukula - 2005
14	ABC: An academic industrialstrength verification tool - Brayton, Mishchenko
13	Computer-Aided-Verification of Coordinating Processes - Kurshan - 1994
11	Checking safety by inductive generalization of counterexamples to induction - Bradley, Manna
10	Maximal input reduction of sequential netlists via synergistic reparameterization and localization strategies - Baumgartner, Mony - 2005
10	The 3rd QBF solvers comparative evaluation - Narizzano, Pulina, et al.
5	Speculative reduction-based scalable redundancy identification - Mony, Baumgartner, et al.
4	A single-instance incremental SAT formulation of proof- and counterexample-based abstraction - Een, Mishchenko, et al.
4	Fast minimum-register retiming via binary maximum-flow - Hurst, Mishchenko, et al.
3	k-step relative inductive generalization - Bradley
3	Speeding up model checking by exploiting explicit and hidden verification constraints - Cabodi, Camurati, et al.
3	Fifteen years of formal property verification - Fix
2	Verification and Synthesis Research - Berkeley
2	Verification and Synthesis Research Center. ABC: A System for Sequential Synthesis and Verification. http://www.eecs.berkeley.edu/˜alanmi/abc - Berkeley
2	Enhanced verification by temporal decomposition - Case, Mony, et al.
2	User-Friendly Model Checking: Automatically Configuring Algorithms with RuleBase/PE - Nevo - 2008
1	Symbolic model checking for sequential circuit verification - Cabodi, Quer, et al. - 1994