Exploration of the scalability of LocFaults
This addresses the challenge of error localization in model checking for developers, but it appears incremental as it builds on existing error localization methods.
The authors tackled the problem of locating errors in long counterexample traces from model checking, focusing on loops, by exploring the scalability of their LocFaults approach, which uses CFG paths to compute MCDs and MCSs, and found that it has better times and more expressive information compared to BugAssist.
A model checker can produce a trace of counterexample, for an erroneous program, which is often long and difficult to understand. In general, the part about the loops is the largest among the instructions in this trace. This makes the location of errors in loops critical, to analyze errors in the overall program. In this paper, we explore the scalability capabilities of LocFaults, our error localization approach exploiting paths of CFG(Control Flow Graph) from a counterexample to calculate the MCDs (Minimal Correction Deviations), and MCSs (Minimal Correction Subsets) from each found MCD. We present the times of our approach on programs with While-loops unfolded b times, and a number of deviated conditions ranging from 0 to n. Our preliminary results show that the times of our approach, constraint-based and flow-driven, are better compared to BugAssist which is based on SAT and transforms the entire program to a Boolean formula, and further the information provided by LocFaults is more expressive for the user.