Abstract
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a
symptom
of an error. As a result, users can spend considerable time examining an error trace in order to understand the
cause
of the error. Moreover, even state-of-the-art model checkers provide an experience akin to that provided by parsers before syntactic error recovery was invented: they report a single error trace per run. The user has to fix the error and run the model checker again to find more error traces.We present an algorithm that exploits the existence of correct traces in order to localize the error cause in an error trace, report a single error trace per error cause, and generate multiple error traces having independent causes. We have implemented this algorithm in the context of
slam
, a software model checker that automatically verifies temporal safety properties of C programs, and report on our experience using it to find and localize errors in device drivers. The algorithm typically narrows the location of a cause down to a few lines, even in traces consisting of hundreds of statements.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
126 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Impact Of Bug Localization Based on Crash Report Mining: A Developers' Perspective;Proceedings of the 46th International Conference on Software Engineering: Software Engineering in Practice;2024-04-14
2. A bounded constraint-based approach to aid in fault localization from a counterexample;Innovations in Systems and Software Engineering;2024-04-12
3. Localizing faults using verification technique;Journal of Systems and Software;2024-03
4. Finding and Investigating Buggy Codes to Make CS1 Learning Efficient;Proceedings of the 17th Innovations in Software Engineering Conference;2024-02-22
5. Counterfactual Causality for Reachability and Safety based on Distance Functions;Electronic Proceedings in Theoretical Computer Science;2023-09-30