Autowrite: A tool for checking properties of term rewriting systems

DOI10.1007/3-540-45610-4_27MaRDI QIDQ4808760zbMATH OpenFDO

Authors Irène Durand

Publication date 12 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2378/23780371.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Sequentiality in orthogonal term rewriting systems
• Constructor equivalent term rewriting systems are strongly sequential: A direct proof
• \texttt{Autowrite}: a tool for term rewrite systems and tree automata
• Decidable call-by-need computations in term rewriting
• Sequentiality, monadic second-order logic and tree automata.

Cited in

(7)

• Autowrite
• Decidable call-by-need computations in term rewriting
• Sequentiality, monadic second-order logic and tree automata.
• \texttt{Autowrite}: a tool for term rewrite systems and tree automata
• Strongly sequential and inductively sequential term rewriting systems
• Practical algorithms for MSO model-checking on tree-decomposable graphs
• scientific article; zbMATH DE number 6792369 (Why is no real title available?)

This page was built for publication: Autowrite: A tool for checking properties of term rewriting systems

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