Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Recurso digital |
| Lingua: | |
| Pubblicazione: |
Zenodo
2026
|
| Accesso online: | https://doi.org/10.5281/zenodo.18910685 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866901881354190848 |
|---|---|
| author | Metta, Ravindra Karmarkar, Hrishikesh Madhukar, Kumar |
| author_facet | Metta, Ravindra Karmarkar, Hrishikesh Madhukar, Kumar |
| contents | <p>ABSTRACT<br>========</p> <p>DIRNT is a non-termination (NT) checking technique based on recurrence-seeking tests. DIRNT generates tests designed to steer program execution toward state-recurrent behavior and reports NT when recurrence is observed during execution. Unlike symbolic approaches, which derive NT evidence primarily through symbolic reasoning, DIRNT uses symbolic reasoning only to construct tests that guide execution toward repeating runtime behavior. Unlike execution-based approaches, DIRNT systematically generates such tests with recurrence as the explicit objective rather than relying on unguided runs.</p> <p>We implemented DIRNT for C programs and evaluated it on SV-COMP NT benchmarks and on instances derived from real-world open-source software. DIRNT solves 98% of SV-COMP tasks and 90% of OSS-derived tasks, compared to 75–88% on SV-COMP and 65% on OSS for the best-performing state-of-the-art techniques under the same resource limits.</p> <p>----------------------------------------------------------------</p> <p>ARCHIVE CONTENTS<br>================</p> <p>This archive contains the DIRNT tool, benchmark sets, configuration files, and scripts required to reproduce the experimental results reported in the paper, as detailed below.</p> <p> </p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_18910685 |
| institution | Zenodo |
| language | |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | DIRNT Artifact: corresponding to our SPIN 2026 paper "Recurrence-seeking Tests for Non-termination" Metta, Ravindra Karmarkar, Hrishikesh Madhukar, Kumar <p>ABSTRACT<br>========</p> <p>DIRNT is a non-termination (NT) checking technique based on recurrence-seeking tests. DIRNT generates tests designed to steer program execution toward state-recurrent behavior and reports NT when recurrence is observed during execution. Unlike symbolic approaches, which derive NT evidence primarily through symbolic reasoning, DIRNT uses symbolic reasoning only to construct tests that guide execution toward repeating runtime behavior. Unlike execution-based approaches, DIRNT systematically generates such tests with recurrence as the explicit objective rather than relying on unguided runs.</p> <p>We implemented DIRNT for C programs and evaluated it on SV-COMP NT benchmarks and on instances derived from real-world open-source software. DIRNT solves 98% of SV-COMP tasks and 90% of OSS-derived tasks, compared to 75–88% on SV-COMP and 65% on OSS for the best-performing state-of-the-art techniques under the same resource limits.</p> <p>----------------------------------------------------------------</p> <p>ARCHIVE CONTENTS<br>================</p> <p>This archive contains the DIRNT tool, benchmark sets, configuration files, and scripts required to reproduce the experimental results reported in the paper, as detailed below.</p> <p> </p> |
| title | DIRNT Artifact: corresponding to our SPIN 2026 paper "Recurrence-seeking Tests for Non-termination" |
| url | https://doi.org/10.5281/zenodo.18910685 |