Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way)

DOI10.1007/978-3-642-54624-2_12zbMath1407.68097DBLPconf/birthday/AlpuenteBFS14OpenAlexW2109540130WikidataQ57978126 ScholiaQ57978126MaRDI QIDQ5403072

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

Publication date: 25 March 2014

Published in: Specification, Algebra, and Software (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis ⋮ An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis ⋮ Exploring conditional rewriting logic computations ⋮ Debugging Maude programs via runtime assertion checking and trace slicing

Uses Software

• Maude
• ChC 3
• iJulienne
• DDebugger
• Web-TLR
• Anima

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional rewriting logic as a unified model of concurrency
• Rewriting logic: Roadmap and bibliography
• The origins of structural operational semantics
• Semantic foundations for generalized rewrite theories
• Backward Trace Slicing for Conditional Rewrite Theories
• Declarative Debugging of Rewriting Logic Specifications
• The Temporal Logic of Rewriting: A Gentle Introduction
• A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
• Backward Trace Slicing for Rewriting Logic Theories
• Declarative Debugging of Missing Answers for Maude.

This page was built for publication: Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way)