Behavioral Rewrite Systems and Behavioral Productivity

DOI10.1007/978-3-642-54624-2_15zbMath1407.68242OpenAlexW2187346675MaRDI QIDQ5403074

Dorel Lucanu, Grigore Roşu

Publication date: 25 March 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-642-54624-2_15

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Uses Software

• CIRC
• CafeOBJ
• Maude
• AProVE
• MTT
• CoCasl

Cites Work

• Productivity of stream definitions
• Observational logic, constructor-based logic, and their duality.
• Algebraic-coalgebraic specification in CoCASL
• Sufficient-completeness, ground-reducibility and their complexity
• Circular Coinduction: A Proof Theoretical Foundation
• CIRC: A Behavioral Verification Tool Based on Circular Coinduction
• A Tool Proving Well-Definedness of Streams Using Termination Tools
• MTT: The Maude Termination Tool (System Description)
• Behavioural Differential Equations and Coinduction for Binary Trees
• Well-Definedness of Streams by Termination
• The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
• Degrees of Undecidability in Term Rewriting
• On the complexity of equivalence of specifications of infinite objects
• Complexity of Fractran and Productivity
• Fundamental Approaches to Software Engineering
• Equality of streams is a Π0 over 2-complete problem
• Data-Oblivious Stream Productivity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Behavioral Rewrite Systems and Behavioral Productivity