Debugging Maude programs via runtime assertion checking and trace slicing

DOI10.1016/j.jlamp.2016.03.001zbMath1348.68027DBLPjournals/jlp/AlpuenteBFS16OpenAlexW2328785738WikidataQ57978111 ScholiaQ57978111MaRDI QIDQ739630

María Alpuente, Francisco Frechina, Demis Ballis, Julia Sapiña

Publication date: 18 August 2016

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2016.03.001

zbMATH Keywords

rewriting logicMaudedynamic program slicingprogram diagnosis and debuggingruntime checkingtrace slicing

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (5)

Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis ⋮ Symbolic Specialization of Rewriting Logic Theories with Presto ⋮ Assertion-based analysis via slicing withABETS(system description) ⋮ Optimizing Maude programs via program specialization ⋮ Safety enforcement via programmable strategies in Maude

Uses Software

• Eiffel
• JML
• Maude
• iJulienne
• DDebugger
• Web-TLR
• Anima
• ACUOS2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exploring conditional rewriting logic computations
• Invariant-driven specifications in Maude
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Dynamic program slicing
• Conditional rewriting logic as a unified model of concurrency
• Rewriting logic bibliography by topic: 1990--2011
• On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
• Declarative debugging of rewriting logic specifications
• A brief account of runtime verification
• A modular order-sorted equational generalization algorithm
• Semantic foundations for generalized rewrite theories
• Backward Trace Slicing for Conditional Rewrite Theories
• ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance
• Rewriting Modulo SMT and Open System Analysis
• Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis
• From Rewriting Logic, to Programming Language Semantics, to Program Verification
• Abstract Certification of Global Non-interference in Rewriting Logic
• A Modular Equational Generalization Algorithm
• Parametric Trace Slicing and Monitoring
• Order-Sorted Generalization
• Backward Trace Slicing for Rewriting Logic Theories
• Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way)
• Sound and complete models of contracts

This page was built for publication: Debugging Maude programs via runtime assertion checking and trace slicing