Bug path reduction strategies for symbolic execution

Brunner, Tibor and Szécsi, Péter and Porkoláb, Zoltán: Bug path reduction strategies for symbolic execution. Conference of PhD Students in Computer Science, (11). pp. 159-162. (2018)

[img] Cikk, tanulmány, mű
cscs_2018_172-175.pdf

Download (133kB)

Abstract

Symbolic execution is one of the most powerful tools in static analysis for finding bugs. In this technique the source code is not executed by the CPU, but interpreted statement-by-statement by preserving their semantics as much as possible. During the interpretation the possible values of variables are recorded so the analyzer can report when a variable gets to an invalid state. An additional benefit of such a provided bug report is that not only the place of the bug is returned but the control flow is also displayed which results the erroneous program state. Many times the bug path contains statements which are not related to the bug. These irrelevant statements make it harder to understand in the debugging process, how the error can occur. In this article we present three methods for shortening the bug paths by removing unnecessary bug points and by recognizing two different bug paths as unique if those refer the same bug.

Item Type: Article
Event Title: Conference of PhD students in computer science (11.) (2018) (Szeged)
Journal or Publication Title: Conference of PhD Students in Computer Science
Date: 2018
Volume: 11
Page Range: pp. 159-162
Uncontrolled Keywords: Programozás, Számítástechnika
Additional Information: Bibliogr.: 162. p. ; összefoglalás angol nyelven
Date Deposited: 2019. Nov. 04. 14:28
Last Modified: 2019. Nov. 04. 14:28
URI: http://acta.bibl.u-szeged.hu/id/eprint/61792

Actions (login required)

View Item View Item