Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis

DOI10.1007/978-3-319-23165-5_3zbMath1321.68325OpenAlexW2294492308WikidataQ57978115 ScholiaQ57978115MaRDI QIDQ2945700

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

Publication date: 14 September 2015

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

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

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Related Items

Debugging Maude programs via runtime assertion checking and trace slicing

Uses Software

• Maude
• ChC 3
• Anima
• Julienne

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exploring conditional rewriting logic computations
• Debugging Maude programs via runtime assertion checking and trace slicing
• 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
• A modular order-sorted equational generalization algorithm
• Semantic foundations for generalized rewrite theories
• Backward Trace Slicing for Conditional Rewrite Theories
• Rewriting Modulo SMT and Open System Analysis
• From Rewriting Logic, to Programming Language Semantics, to Program Verification
• A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
• Backward Trace Slicing for Rewriting Logic Theories
• Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way)
• Equality, types, modules, and (why not?) generics for logic programming