Simplifying questions in Maude declarative debugger by transforming proof trees

DOI10.1007/978-3-642-32211-2_6MaRDI QIDQ4909314zbMATH OpenOpenAlexWikidataFDO

Authors Adrián Riesco, Alberto Verdejo, Narciso Martí-Oliet, Rafael Caballero

Publication date 13 March 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-32211-2_6

zbMATH Keywords

Maudedeclarative debuggingproof tree transformation

Mathematics Subject Classification ID

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

Recommendations

• Declarative Debugging of Rewriting Logic Specifications
• Enhancing the debugging of Maude specifications
• A declarative debugger for Maude functional modules
• A complete declarative debugger for Maude
• Declarative Debugging of Membership Equational Logic Specifications

Cited in

(4)

• A core Erlang semantics for declarative debugging
• Algorithmic debugging generalized
• Enhancing declarative debugging with loop expansion and tree compression
• A generalized model for algorithmic debugging

This page was built for publication: Simplifying questions in Maude declarative debugger by transforming proof trees

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