Brunner Tibor; Szécsi Péter; Porkoláb Zoltán: Bug path reduction strategies for symbolic execution.
Előnézet |
Cikk, tanulmány, mű
cscs_2018_172-175.pdf Letöltés (133kB) | Előnézet |
Absztrakt (kivonat)
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.
| Mű típusa: | Konferencia vagy workshop anyag |
|---|---|
| Befoglaló folyóirat/kiadvány címe: | Conference of PhD Students in Computer Science |
| Dátum: | 2018 |
| Kötet: | 11 |
| Oldalak: | pp. 159-162 |
| Konferencia neve: | Conference of PhD students in computer science (11.) (2018) (Szeged) |
| Befoglaló mű URL: | http://acta.bibl.u-szeged.hu/59477/ |
| Kulcsszavak: | Programozás, Számítástechnika |
| Megjegyzések: | Bibliogr.: 162. p. ; összefoglalás angol nyelven |
| Feltöltés dátuma: | 2019. nov. 04. 14:28 |
| Utolsó módosítás: | 2022. nov. 08. 10:18 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/61792 |
 |
Tétel nézet |
