Foundations of Software Science and Computation Structures

DOI10.1007/B95995zbMath1126.68448OpenAlexW3105029025MaRDI QIDQ5308459

Salvador Lucas

Publication date: 28 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95995

zbMATH Keywords

rewritingterminationProgramming languages

Mathematics Subject Classification ID

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

Related Items (6)

Relaxing monotonicity for innermost termination ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ Tyrolean termination tool: techniques and features ⋮ Proving operational termination of membership equational programs ⋮ Context-sensitive dependency pairs ⋮ Proving Termination of Context-Sensitive Rewriting with MU-TERM

This page was built for publication: Foundations of Software Science and Computation Structures