On the Completeness of Context-Sensitive Order-Sorted Specifications
From MaRDI portal
Publication:5432344
DOI10.1007/978-3-540-73449-9_18zbMath1203.68098OpenAlexW1509808769MaRDI QIDQ5432344
Publication date: 2 January 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2142/11291
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)
Related Items
Order-Sorted Parameterization and Induction ⋮ Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting ⋮ Twenty years of rewriting logic ⋮ Completeness of context-sensitive rewriting ⋮ Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications ⋮ Normal forms and normal theories in conditional rewriting ⋮ Applications and extensions of context-sensitive rewriting
Uses Software
This page was built for publication: On the Completeness of Context-Sensitive Order-Sorted Specifications