scientific article; zbMATH DE number 794237
From MaRDI portal
Publication:4846997
Recommendations
- scientific article; zbMATH DE number 1761895
- On the modularity of termination of term rewriting systems
- Generalized sufficient conditions for modular termination of rewriting
- Completeness of combinations of constructor systems
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
Cited in
(27)- Decidability for left-linear growing term rewriting systems.
- Some characteristics of strong innermost normalization
- Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems
- Hierarchical termination revisited.
- Modular termination proofs for rewriting using dependency pairs
- Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting system
- Modularity in term rewriting revisited
- Termination of term rewriting using dependency pairs
- Applications and extensions of context-sensitive rewriting
- Conditions for confluence of innermost terminating term rewriting systems
- Automating the dependency pair method
- Modular and incremental automated termination proofs
- Formalizing soundness and completeness of unravelings
- Harnessing first order termination provers using higher order dependency pairs
- Deciding Innermost Loops
- Proving Confluence of Term Rewriting Systems Automatically
- Finite canonical rewriting systems for congruences generated by concurrency relations
- Real_Impl
- scientific article; zbMATH DE number 1761895 (Why is no real title available?)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving
- Termination by absence of infinite chains of dependency pairs
- From innermost to full almost-sure termination of probabilistic term rewriting
- On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
- Wanda -- a higher-order termination tool (system description)
- From innermost to full probabilistic term rewriting: almost-sure termination, complexity, and modularity
- Mechanizing and improving dependency pairs
- Overlap closures do not suffice for termination of general term rewriting systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846997)
