Backward Trace Slicing for Rewriting Logic Theories

DOI10.1007/978-3-642-22438-6_5zbMath1341.68026OpenAlexW1503576365WikidataQ57978148 ScholiaQ57978148MaRDI QIDQ5200013

Javier Espert, Daniel M. Romero, Demis Ballis, María Alpuente

Publication date: 29 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22438-6_5

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Slicing concurrent constraint programs, Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis, Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way), Backward Trace Slicing for Rewriting Logic Theories, Debugging Maude programs via runtime assertion checking and trace slicing

Uses Software

• SPIN
• Maude
• Web-TLR
• Freja
• Hat
• Hood

Cites Work

• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Rewriting logic: Roadmap and bibliography
• Descendants and origins in term rewriting.
• Parametric Trace Slicing and Monitoring
• Backward Trace Slicing for Rewriting Logic Theories
• Declarative Debugging of Missing Answers for Maude.
• Unnamed Item
• Unnamed Item
• Unnamed Item