.png){kind=icon}
.png){kind=icon}
Return
Directed Model Checking for Fast Abstract Reachability Analysis
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3130569.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a novel technique (TOUR) to improve both bug detection ability and verification speed of ARMC by detecting a target path quickly. The key idea of TOUR is an error location directed search that utilizes the distance to an error location and function call context at runtime. TOUR applies four different distance metrics and a distance metric selection heuristic using static features of a target program. We have extensively evaluated TOUR on 3,042 real-world C programs in a software verification competition benchmark. The experiment results show that TOUR, due to its error location directed search, finds bugs in 20% more programs in 11% less model checking time than the state-of-the-art ARMC technique (i.e., block-abstraction memoization) for 354 buggy programs. Also, TOUR verifies 15% more programs within 15% less model checking time than the block-abstraction memoization for 652 complex clean programs.
Keywords:
Measurement
Runtime
Model checking
Computer bugs
Annotations
Software
Reachability analysis
Software verification
software testing
symbolic model checking
abstract reachability
interprocedural analysis
directed search
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W