Supporting the debugging of Erlang programs by symbolic execution

Programmers can benefit from static source code analysis techniques in various ways: they can understand their code better, test it more effectively, debug it more efficiently, and so on. However, they often face the challenge of discovering how to reproduce faulty executions that cause runtime errors. The term symbolic execution refers to a static source code analysis method that can help with this challenge. In this paper, we are showing a symbolic execution-based analysis method to find the source of a runtime error. The method uses a control-flow graph to select the execution paths reaching the targeted runtime error. The algorithm is implemented as part of the RefactorErl static program analysis and transformation framework.

Authors

Institutions

Publication Details

Journal
Acta Universitatis Sapientiae Informatica
Published
2024-10-01
DOI
https://doi.org/10.47745/ausi-2024-0004
Citations
2
Primary Topic
Software Testing and Debugging Techniques
Type
article
Field-Weighted Citation Impact
0.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Supporting the debugging of Erlang programs by symbolic execution

Melinda Tóth, István Bozó, Zsófia Erdei
2 citations
Acta Universitatis Sapientiae Informatica
Software Testing and Debugging Techniques
0.97
article

Supporting the debugging of Erlang programs by symbolic execution

Melinda Tóth, István Bozó, Zsófia Erdei
article en
2 citations

Abstract

Programmers can benefit from static source code analysis techniques in various ways: they can understand their code better, test it more effectively, debug it more efficiently, and so on. However, they often face the challenge of discovering how to reproduce faulty executions that cause runtime errors. The term symbolic execution refers to a static source code analysis method that can help with this challenge. In this paper, we are showing a symbolic execution-based analysis method to find the source of a runtime error. The method uses a control-flow graph to select the execution paths reaching the targeted runtime error. The algorithm is implemented as part of the RefactorErl static program analysis and transformation framework.

Acta Universitatis Sapientiae InformaticaVol. 16(1)
Eötvös Loránd University (HU)
Openalex Percentile: Top 20%
Software Testing and Debugging Techniques
0.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Supporting the debugging of Erlang programs by symbolic execution — Melinda Tóth, István Bozó, et al. · Acta Universitatis Sapientiae Informatica (2024) | TGRS Research Map | TGRS