Out of the Loop No More: Online Abstract Debugging with Loop Stepping

J. Alvim Maarten Steevens Christophe Scholliers Fernando Batista Eugénio Ribeiro Ricardo Ribeiro André L. M. Santos

· 0 citations · 19 references

TL;DR

This paper proposes online abstract debugging, which performs abstract interpretation on demand as the developer steps through the program, and instantiate this model for WebAssembly and presents a prototype implementation, demonstrating that developers can effectively draw sound conclusions about complex, potentially non-terminating looping programs.

Semantic Scholar

View source

Similar papers

Open access Sep 2026

Goanna: a novel approach for automated type error debugging

Statically typed languages offer many advantages in software engineering, including bug prevention, enhanced code quality, and reduced maintenance costs. However, these benefits come at the expense of a steep learning curve and a slower development pace. Although known for its expressive and strong type system, Haskell...

Shuai Fu, Tim Dwyer, Peter James Stuckey et al. · International Conference on... · 0 citations

Preprint Aug 2026

Improving Debugging in Verification-Aware Languages Through Automated Fault Localization: A Case Study in Dafny

This paper investigates automated fault localization for verification-aware languages by comparing two paradigms: state-based and counterexample-based localization, and shows that counterexample-based approaches substantially outperform state-based localization in this setting.

Álvaro F. Silva, Isabel Amaral, João Pascoal Faria et al. · 1 citation · ⚡1

Preprint Aug 2026

Can Formal Specifications Be Synthesized from Tests Alone?

This approach uses LLMs to infer candidate specifications solely from test code and dynamic execution traces: the LLM observes only the program interface, selected inputs, and corresponding outputs or state changes, while the implementation internals remain hidden.

Tian-Hai Liu, Maximilian Müller, Tobias Hey et al. · 0 citations

Review Aug 2026

Refine After Generation: Toward Correct and Concise Patches in LLM-based Program Repair

This paper identifies patch verbosity as a major yet overlooked concern in LLM-based APR and proposes RECAP, a lightweight, plug-and-play adapter that attaches to existing repair frameworks after generation that achieves a substantially better size-correctness tradeoff.

Wen-Qiang Luo, J. Keung, Xiaoyu Shi et al. · 0 citations

Preprint Aug 2026

Compiling WebAssembly Concolic Execution with Staging, Continuations, and Snapshots (Extended Version)

Concolic execution is a variant of symbolic execution that runs a program simultaneously with concrete and symbolic inputs. It records the symbolic constraints encountered along a concrete execution path, then solves those constraints to generate inputs that explore new paths. Existing concolic engines generally follow...

Ding-Hong Zhong, Alexander Y. Bai, Mikail Khan et al. · 0 citations

Preprint Aug 2026

Forbench: Symbolic Simulation Helps Make Your Testbench More Formal

Forbench is introduced, a word-level symbolic simulation framework that retains the familiar execution semantics of simulation but augments it with solver-backed symbolic signals and state transitions, enabling systematic exploration of RTL behaviors under symbolic inputs and conditions.

Ziyi Yang, Wenbin Che, Ziyue Zheng et al. · 0 citations