Enhancing declarative debugging with loop expansion and tree compression

DOI10.1007/978-3-642-38197-3_6MaRDI QIDQ2848898zbMATH OpenOpenAlexFDO

Authors David Insa, Josep Silva, César Tomás

Publication date 13 September 2013

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10251/36674

zbMATH Keywords

tree compressionloop expansiondeclarative debugging

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Simplifying questions in Maude declarative debugger by transforming proof trees
• Declarative debugging meets the world
• Declarative Debugging of Rewriting Logic Specifications
• A declarative debugging system for lazy functional logic programs
• A Theoretical Framework for the Declarative Debugging of Datalog Programs

Cited in

(2)

• Algorithmic debugging generalized
• A generalized model for algorithmic debugging

Describes a project that uses

Uses Software

• DDebugger

This page was built for publication: Enhancing declarative debugging with loop expansion and tree compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848898)