Constructing Rewrite-Based Decision Procedures for Embeddings and Termination

DOI10.1007/11783596_24MaRDI QIDQ3618835zbMATH OpenOpenAlexFDO

Authors Georg Struth

Publication date 2 April 2009

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

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A Completion Method to Decide Reachability in Rewrite Systems
• New results on rewrite-based satisfiability procedures
• Termination of rewriting
• Termination by completion
• Rewrite-based decision procedures

Cited in

(1)

• Terminal embeddings

This page was built for publication: Constructing Rewrite-Based Decision Procedures for Embeddings and Termination

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