Compression of rewriting systems for termination analysis

DOI10.4230/LIPICS.RTA.2013.97MaRDI QIDQ2958378zbMATH OpenFDO

Authors Alexander Bau, Markus Lohrey, Eric Noeth, Johannes Waldmann

Publication date 1 February 2017

Full work available at URL https://doi.org/10.4230/LIPICS.RTA.2013.97

zbMATH Keywords

constraint solvingmatrix interpretationstermination of rewritingtree compression

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Termination of term rewriting using dependency pairs
• Termination of String Rewriting with Matrix Interpretations
• Matrix Interpretations for Proving Termination of Term Rewriting
• Linear compressed pattern matching for polynomial rewriting (extended abstract)
• Reinterpreting compression in infinitary rewriting

Cited in

(3)

• Automatic generation of logical models with AGES
• Linear compressed pattern matching for polynomial rewriting (extended abstract)
• Reinterpreting compression in infinitary rewriting

This page was built for publication: Compression of rewriting systems for termination analysis

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