Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories

DOI10.1007/978-3-642-16242-8_42zbMath1306.68087OpenAlexW102151912MaRDI QIDQ4933334

Camilo Rocha, José Meseguer

Publication date: 12 October 2010

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16242-8_42

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Related Items (6)

Metalevel algorithms for variant satisfiability ⋮ Twenty years of rewriting logic ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Ground confluence of order-sorted conditional specifications modulo axioms ⋮ Metalevel Algorithms for Variant Satisfiability ⋮ A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems

Uses Software

• Maude
• ITP
• SCC

This page was built for publication: Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories