A Fast Approach of Locating Complex System Design Errors

Article Preview

Abstract:

Model checking technique can give a specific counterexample which explains how the system violates some assertion when model does not satisfy the specification. However, it is a tedious work to understand the long counterexamples. We propose a genetic algorithm to enhance the efficiency of understanding long counterexample by computing the minimal unsatisfiable subformula. Besides, we also propose a Craig interpolation computation-based method to understand counterexample. The causes which are responsible for model failure are extracted by deriving interpolation from the proof of the nonsatisfiability of the initial state and the weakest precondition of counterexample. Experimental results show that our methods improve the efficiency of understanding counterexamples and debugging significantly.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

115-118

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] E Clarke, E Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. Logics of Programs, 1982, pp.52-71.

DOI: 10.1007/bfb0025774

Google Scholar

[2] I Beer, S Ben-David, H Chockler, et al. Explaining counterexamples using causality /Computer Aided Verification. 2009, pp.94-108.

DOI: 10.1007/978-3-642-02658-4_11

Google Scholar

[3] M Jose, R Majumdar. Cause Clue Clauses: Error Localization using Maximum Satisfiability. Arxiv preprint arXiv: 1011. 1589, (2010).

DOI: 10.1145/2345156.1993550

Google Scholar

[4] HUANG Hongtao, HUANG Shaobin, CHEN Zhiyuan and ZHANG Tao. Understanding Counterexamples Based on Craig Interpolation. Journal of Jilin University (Science Edition), 2013, 53(1), pp.94-100.

Google Scholar