Reversible Debugging in Logic Programming

July 31, 2020 Β· Declared Dead Β· πŸ› Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors GermΓ‘n Vidal arXiv ID 2007.16171 Category cs.PL: Programming Languages Cross-listed cs.LO Citations 0 Venue Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems Last Checked 4 months ago
Abstract
Reversible debugging is becoming increasingly popular for locating the source of errors. This technique proposes a more natural approach to debugging, where one can explore a computation from the observable misbehaviour backwards to the source of the error. In this work, we propose a reversible debugging scheme for logic programs. For this purpose, we define an appropriate instrumented semantics (a so-called Landauer embedding) that makes SLD resolution reversible. An implementation of a reversible debugger for Prolog, rever, has been developed and is publicly available.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted