Localizing errors in counterexample with iteratively witness searching

Shen, ShengYu and Qin, Ying and Li, SiKun Localizing errors in counterexample with iteratively witness searching., 2004 . In Automated Technology for Verification and Analysis : Second International Conference, Taipei (Taiwan), October 31-November 3, 2004. [Conference paper]


Download (214kB) | Preview

English abstract

We propose a novel approach to locate errors in complex counterexample of safety property. Our approach measures the distance between two state transition traces with difference of their control flow. With respect to this distance metrics, our approach search for a witness as near as possible to the counterexample. Then we can obtain the set of control flow predicates with difference assignment in witness and counterexample. Run this witness-searching algorithm iteratively, we can then obtain a predicate list with priority. A predicate with higher priority means that this predicate is more likely the actual error. Experiment result shows that our approach is highly accurate.

Item type: Conference paper
Keywords: Model Checking; Counterexample Explanation
Subjects: L. Information technology and library technology > LK. Software methodologies and engineering.
Depositing user: ShengYu Shen
Date deposited: 09 May 2006
Last modified: 02 Oct 2014 12:03
URI: http://hdl.handle.net/10760/7463


ShengYu Shen , Ying Qin and SiKun Li., ”Bug Localization of Hardware System with Control Flow Distance Minimization”. 13th IEEE International Workshop on Logic and Synthesis (IWLS 2004), Temecula, California, USA. June 2-4, 2004 . accepted.

ShengYu Shen , Ying Qin and SiKun Li., ”Debugging Complex Counterexample of Hardware System using Control Flow Distance Metrics”.47rd IEEE Midwest Symposium on Circuits and Systems(MWSCAS 2004), Hiroshima, Japan. July 25-28, 2004 .accpeted.

Kavita Ravi and Fabio Somenzi. Minimal Assignments for Bounded Model Checking. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), March-April 2004.

Alex Groce, Daniel Kroening, and Flavio Lerda. ”Understanding Counterexamples with explain”. Proceeding of 16th International Conference on Computer Aided Verification(CAV), July 13 – 17 , 2004

Thomas Ball, Mayur Naik, Sriram Rajamani.”From Symptom to Cause: Localizing Errors in Counterexample Traces”. In Proceedings of ACM Symposium on Principles of Programming Languages (POPL ’03), New Orleans, LA, January 2003.

D.Lewis .”Causation”. Journal of Philosophy, 70:556-567,1973.

M.Renieris and S .Reiss . ”fault localization with nearest neighbor queries”. In Automatic Software Engineering,2003

Alex Groce and Willem Visser. ”What Went Wrong: Explaining Counterexamples.” In SPIN Workshop on Model Checking of Software, pages 121–135, May 2003.

Alex Groce. ”Error Explanation with Distance Metrics.” Tools and Algorithms for the Construction and Analysis of Systems (TACAS), March-April 2004. Localizing Errors in Counterexample with Iteratively Witness Searching 469

H.Jin, K.Ravi,and F.Somenzi. ”Fate and free will in error traces”. In Tools and Algorithms for the Construction and Analysis of Systems, page 445-458,2002.

Gorschwin Fey ,Rolf Drechsler. Finding Good Counter-Examples to Aid Design Verification. Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE’03),2003

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 Proceeding of CAV 2002. Copenhagen, Denmark, July 27-31, 2002

M.Chechik and A.Gurfinkel. ”Proof-like counterexamples”. In Tools and Algorithms for the Construction and Analysis of Systems,page160-175,2003.

F.Aloul, A.Ramani, I.Markov, and K.Sakallah .”PBS: A Backtrack-Search Pseudo-Boolean Solver and Optimizer”.Symposium on the Theory and Applications of Satisfiability Testing (SAT),Ohio,pp.346-353, 2002

D. Peled, A. Pnueli, and L. Zuck. From falsification to verification. In FST&TCS, volume 2245 of LNCS. Springer Verlag, 2001.

A. Biere, A. Cimatti, E.M. Clarke, M. Fujita, Y. Zhu . ”Symbolic Model Checking using SAT procedures instead of BDDs”,Proceedings of Design Automation Conference (DAC’99)

K. L. McMillan and J. Schwalbe, ”Formal verification of the Encore Gigamax cache consistency protocols”, Int. Symp. on Shared Memory Multiprocessors, Tokyo, Japan, 2-4 April 1991, pp. 242-51

L. Tan and R. Cleaveland. Evidence-Based Model Checking. In Proceedings of 14th Conference on Computer-Aided Verification (CAV’02), volume 2404 of LNCS, pages 455–470, Copenhagen, Denmark, July 2002. Springer-Verlag.

K. Namjoshi. Certifying Model Checkers. In Proceedings of 13th International Conference on Computer Aided Verification (CAV’01), volume 2102 of LNCS. Springer Verlag, 2001.

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.


Downloads per month over past year

Actions (login required)

View Item View Item