Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity

DOI10.2168/LMCS-8(3:4)2012zbMath1252.68161MaRDI QIDQ2904621

Masahiko Sakai, Naoki Nishida, Toshiki Sakabe

Publication date: 15 August 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

program transformationconditional term rewritingunraveling

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Unnamed Item, Dependency pairs for proving termination properties of conditional term rewriting systems, Determinization of conditional term rewriting systems, Reversible computation in term rewriting, Formalizing Soundness and Completeness of Unravelings, On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings, Determinization of inverted grammar programs via context-free expressions, Applications and extensions of context-sensitive rewriting