Theoretical Aspects of Computing - ICTAC 2004

DOI10.1007/B107116zbMATH Open1108.68500OpenAlexW2493490011MaRDI QIDQ5709986FDOQ5709986

Hélène Kirchner, Olivier Fissore, Isabelle Gnaedig

Publication date: 30 November 2005

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

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

Recommendations

• Termination of rewriting under strategies
• Proving weak properties of rewriting
• On proving termination by innermost termination
• Induction for termination with local strategies
• Outermost ground termination

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (3)

• Proving weak properties of rewriting
• Termination and normalisation under strategy proofs in ELAN
• A proof rule for fair termination of guarded commands

Uses Software

• Maude
• CARIBOO

This page was built for publication: Theoretical Aspects of Computing - ICTAC 2004

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5709986)