<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-28T20:03:53Z</responseDate>
  <request identifier="26718" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:26718</identifier>
        <datestamp>2026-07-28T09:32:41Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Out of the Loop No More: Online Abstract Debugging with Loop Stepping (Short Paper)</dc:title>
          <dc:creator>Alvim, João</dc:creator>
          <dc:creator>Steevens, Maarten</dc:creator>
          <dc:creator>Scholliers, Christophe</dc:creator>
          <dc:subject>Debugging</dc:subject>
          <dc:subject>Abstract Interpretation</dc:subject>
          <dc:description>Traditional debugging makes it practically impossible to manually explore all execution paths, often leaving hypotheses insufficiently explored. Abstract debugging addresses this problem by safely over-approximating all program behaviours through a familiar stepping interface. However, existing approaches operate offline, pre-computing fixed loop summaries that developers cannot interactively refine or inspect at the individual iteration level.&#13;
In this paper, we propose online abstract debugging, which performs abstract interpretation on demand as the developer steps through the program. This novel architecture enables loop stepping: developers can step into a loop body for precise, iteration-specific states, or step-over to obtain a coarser summary. By interleaving analysis with execution, developers gain direct control over the cost-precision trade-off, computing high precision only where needed to settle a hypothesis. We instantiate this model for WebAssembly and present a prototype implementation, demonstrating that developers can effectively draw sound conclusions about complex, potentially non-terminating looping programs.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>João Alvim and Maarten Steevens and Christophe Scholliers</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 144, 15th Symposium on Languages, Applications and Technologies (SLATE 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/OASIcs.SLATE.2026.20</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-267180</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2026.20</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
