Minimizing counterexample with Unit Core Extraction and Incremental SAT

Shen, ShengYu and Qin, Ying and Li, SiKun Minimizing counterexample with Unit Core Extraction and Incremental SAT., 2005 . In Sixth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'05), Paris (France), 17-19 January 2005. [Conference paper]

[img]
Preview
 PDF
VMCAI05_DE2D8VQ8GA3KX5X7.pdf
Download (208kB) | Preview

English abstract

It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample minimization algorithm. This algorithm is the most effective one among all existing approaches, but time overhead of its second stage(called BFL) is very large due to one call to SAT solver per candidate variable to be eliminated. So we propose a faster counterexample minimization algorithm based on unit core extraction and incremental SAT. First, for every unsatisfiable instance of BFL, we perform unit core extraction algorithm to extract the set of variables that are sufficient to lead to conflict, all variables not belong to this set can be eliminated simultaneously. In this way, we can eliminate many variables with only one call to SAT solver. At the same time, we employ incremental SAT approach to share learned clauses between similar instances of BFL, to prevent overlapped state space from being searched repeatedly. Theoretic analysis and experiment result show that, our approach is 1 order of magnitude faster than K Ravi’s algorithm, and still retains its ability to eliminate irrelevant variables.

Item type: Conference paper
Keywords: Model Checking Counterexample Minimization
Subjects: L. Information technology and library technology > LJ. Software.
L. Information technology and library technology > LK. Software methodologies and engineering.
Depositing user: ShengYu Shen
Date deposited: 01 Aug 2006
Last modified: 02 Oct 2014 12:04
URI: http://hdl.handle.net/10760/7866

References

E. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction refinement using ILP and machine learning. In E. Brinksma and K. G. Larsen, editors, Fourteenth Conference on Computer Aided Verification (CAV 2002), pages 265-279. Springer-Verlag, July 2002.LNCS 2404.

Pankaj Chauhan, Edmund M. Clarke, Daniel Kroening, Using SAT based Image Computation for Reachability Analysis. technology report CMU-CS-03-151, School of Computer Science ,Carnegie Mellon University, September 2003

K. L. McMillan. Applying SAT methods in unbounded symbolic model checking.In E. Brinksma and K. G. Larsen, editors, Fourteenth Conference on Computer Aided Verification (CAV’02), pages 250-264. Berlin, July 2002. LNCS 2404.

Hyeong-Ju Kang and In-Cheol Park,SAT-Based Unbounded Symbolic Model Checking,In Proceeding of DAC 2003,Anaheim, California, USA, June 2-6, 2003.

Kavita Ravi and Fabio Somenzi. Minimal Assignments for Bounded Model Checking. In Tenth International Conference on Tools and Algorithms For the Construction and Analysis of Systems (TACAS’04),pages 31-45 , 2004. LNCS 2988.

H.Jin, K.Ravi,and F.Somenzi. ”Fate and free will in error traces”. In 8th International Conference on Tools and Algorithms For the Construction and Analysis of Systems(TACAS 2002), pages 445-458, 2002.LNCS 2280.

A. Biere, A. Cimatti, E.M. Clarke, M. Fujita, Y. Zhu . ”Symbolic Model Checking using SAT procedures instead of BDDs”.In Proceedings of the 36th Conference on Design Automation(DAC1999).pages 317-320, 1999.

L.Zhang, C.Madigan, M.Moskewicz, and S.Malik. Efficient conflict driven learning in a Boolean satisfiability solver. ICCAD 2001.

A. Cimatti, E. M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani and A. Tacchella. ”NuSMV 2: An OpenSource Tool for Symbolic Model Checking”. In 14th International Conference on Computer Aided Verification(CAV2002),pages 359-364 , Copenhagen, Denmark, July 27-31, 2002.LNCS 2404

M. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the Design Automation Conference, pages 530-535,Las Vegas, NV, June 2001.

http://www.cbl.ncsu.edu/CBL Docs/iscas89.html

N. Een and N. Sorensson. Temporal Induction by Incremental SAT Solving. In Proc. of the First International Workshop on Bounded Model Checking, 2003.

P. Gastin, P. Moro, and M. Zeitoun. Minimization of counterexamples in spin.In SPIN Workshop on Model Checking of Software, pages 92-108, 2004.

Alex Groce , Daniel Kroening. Making the Most of BMC Counterexamples. the second international workshop on Bounded Model Checking(BMC 2004), to appear

Marcelo Glusman, Gila Kamhi, Sela Mador-Haim, Ranan Fraer, and Moshe Y. Vardi,Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation. In 9th International Conference on Tools and Algorithms For the Construction and Analysis of Systems(TACAS 2003)

L. Zhang and S. Malik. Validating sat solvers using an independent resolutionbased checker: Practical implementations and other applications. In Proceedings of Design Automation and Test in Europe (DATE2003),2003.

E. Goldberg and Y. Novikov. Verification of proofs of unsatisfiability for cnf formulas. In Proceedings of Design Automation and Test in Europe (DATE2003),2003.


Downloads

Downloads per month over past year

Actions (login required)

View Item View Item
Contact us
Send email Sponsors
Sponsor: AIMS Sponsor: D&P Sponsor: UniNa CAB Get connected
Facebook Facebook Twitter Twitter Linkedin LinkedIn RSS RSS