Implication-based approximating bounded model checking

Authors:
Zhenyu Chen;Zhihong Tao;Baowen Xu;Lifu Wang
Affiliations:
School of Computer Science and Engineering, Southeast University, Nanjing, China;School of Software and Microelectronics, Peking University, Beijing, China;School of Computer Science and Engineering, Southeast University, Nanjing, China;School of Software and Microelectronics, Peking University, Beijing, China
Venue:
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Year:
2007

Citing 10
Cited 0

Model checking and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Model checking

Model checking
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
The PEP Tool

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Automatic abstraction refinement for Petri nets verification

HLDVT '05 Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International
Bounded model checking of CTL

Journal of Computer Science and Technology
An algebraic definition of simulation between programs

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Variable minimal unsatisfiability

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Abstraction refinement for bounded model checking

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an iterative framework based on over-approximation and under-approximation for traditional bounded model checking (BMC). A novel feature of our approach is the approximations are defined based on "implication" instead of "simulation". As a common partial order relation of logic formulas, implication is suitable for the satisfiability checking of BMC for debugging. Our approach could generate the implication-based approximations efficiently with necessary accuracy, thus it potentially enables BMC to go deeper and the output counterexamples with fewer variables are easier to understand. An experiment on a suite of Petri nets shows the effectiveness of implication-based approximating BMC.