Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
From MaRDI portal
Publication:968529
DOI10.1016/j.jsc.2010.01.008zbMath1192.68931MaRDI QIDQ968529
Kazuhiro Ogata, Kokichi Futatsugi, Masaki Nakamura
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
algebraic specification; term rewriting system; behavioral coherence; behavioral specification; observational transition system
68W30: Symbolic computation and algebraic computation
68Q65: Abstract data types; algebraic specification
68Q42: Grammars and rewriting systems
Uses Software
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