Choosing Abstraction Levels for Model-Based Software Debugging: A Theoretical and Empirical Analysis for Spreadsheet Programs (Abstract Reprint)
Proceedings of the AAAI Conference on Artificial Intelligence · 14.03.2026 · 40 (47) · 39890-39890
DOI: 10.1609/aaai.v40i47.41405 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 14.03.2026. Verfasst von Patrick Rodler und 4 weiteren Autor:innen.
Abstract (Originalsprache)
Model-based diagnosis is a generally applicable, principled approach to the systematic debugging of a wide range of system types such as circuits, knowledge bases, physical devices, or software. Based on a formal description of the system, it enables precise and deterministic reasoning about potential faults responsible for observed misbehavior. In software, such a formal system description can often even be extracted from the buggy program fully automatically. As logical reasoning is central to diagnosis, the performance of model-based debuggers is largely influenced by reasoning efficiency, which in turn depends on the complexity and expressivity of the system description. Since highly detailed models capturing exact semantics often exceed the capabilities of current reasoning tools, researchers have proposed more abstract representations. In this work, we thoroughly analyze system modeling techniques with a focus on fault localization in spreadsheets—one of the most widely used end-user programming paradigms. Specifically, we present three constraint model types characterizing spreadsheets at different abstraction levels, show how to extract them automatically from faulty spreadsheets, and provide theoretical and empirical investigations of the impact of abstraction on both diagnostic output and computational performance. Our main conclusions are that (i) for the model types, there is a trade-off between the conciseness of generated fault candidates and computation time, (ii) the exact model is often impractical, and (iii) a new model based on qualitative reasoning yields the same solutions as the exact one in up to more than half the cases while being orders of magnitude faster. Due to their ability to restrict the solution space in a sound way, the explored model-based techniques, rather than being used as standalone approaches, are expected to realize their full potential in combination with iterative sequential diagnosis or indeterministic but more performant statistical debugging methods.
Zitieren
APA
Rodler, P., Hofer, B., Jannach, D., Nica, I., & Wotawa, F. (2026). Choosing Abstraction Levels for Model-Based Software Debugging: A Theoretical and Empirical Analysis for Spreadsheet Programs (Abstract Reprint). Proceedings of the AAAI Conference on Artificial Intelligence, 40(47), 39890-39890. https://doi.org/10.1609/aaai.v40i47.41405
Vancouver
Rodler P, Hofer B, Jannach D, Nica I, Wotawa F. Choosing Abstraction Levels for Model-Based Software Debugging: A Theoretical and Empirical Analysis for Spreadsheet Programs (Abstract Reprint). Proceedings of the AAAI Conference on Artificial Intelligence. 2026;40(47):39890-39890. doi:10.1609/aaai.v40i47.41405
BibTeX
@article{Rodler2026,
author = {Rodler, Patrick and Hofer, Birgit and Jannach, Dietmar and Nica, Iulia and Wotawa, Franz},
title = {Choosing Abstraction Levels for Model-Based Software Debugging: A Theoretical and Empirical Analysis for Spreadsheet Programs (Abstract Reprint)},
journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
year = {2026},
volume = {40},
number = {47},
pages = {39890--39890},
doi = {10.1609/aaai.v40i47.41405}
}
EUVIMED