Exploring conditional rewriting logic computations

DOI10.1016/j.jsc.2014.09.028zbMath1315.68166OpenAlexW2079684794WikidataQ57978116 ScholiaQ57978116MaRDI QIDQ485831

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

Publication date: 14 January 2015

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2014.09.028

zbMATH Keywords

rewriting logicMaudeconditional rewrite theoriestrace exploration

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

Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis ⋮ Assertion-based analysis via slicing withABETS(system description) ⋮ Symbolic Analysis of Maude Theories with Narval ⋮ Debugging Maude programs via runtime assertion checking and trace slicing ⋮ Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Computing in systems described by equations
• Conditional rewriting logic as a unified model of concurrency
• Origin tracking
• Rewriting logic: Roadmap and bibliography
• Descendants and origins in term rewriting.
• The origins of structural operational semantics
• Declarative debugging of rewriting logic specifications
• Rewriting-based repairing strategies for XML repositories
• Semantic foundations for generalized rewrite theories
• Analysis and caching of dependencies
• A Generic Program Slicing Technique Based on Language Definitions
• Backward Trace Slicing for Conditional Rewrite Theories
• Provenance as dependency analysis
• Declarative Debugging of Rewriting Logic Specifications
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
• Declarative Debugging of Missing Answers for Maude.
• Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way)

This page was built for publication: Exploring conditional rewriting logic computations