Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications

DOI10.1016/j.jsc.2010.01.008zbMath1192.68931OpenAlexW2061219800MaRDI QIDQ968529

Masaki Nakamura, Kazuhiro Ogata, Kokichi Futatsugi

Publication date: 5 May 2010

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

Full work available at URL: http://hdl.handle.net/2297/22582

zbMATH Keywords

algebraic specificationterm rewriting systembehavioral coherencebehavioral specificationobservational transition system

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42)

Related Items (4)

A proof method for local sufficient completeness of term rewriting systems ⋮ Completeness of context-sensitive rewriting ⋮ Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications ⋮ Applications and extensions of context-sensitive rewriting

Uses Software

• CafeOBJ
• MU-TERM

Cites Work

• On sufficient-completeness and related properties of term rewriting systems
• The algebraic specification of abstract data types
• Context-sensitive rewriting strategies
• Ground reducibility is EXPTIME-complete
• On the Completeness of Context-Sensitive Order-Sorted Specifications
• Improving Context-Sensitive Dependency Pairs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications