Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124): Difference between revisions

@@ Property / cites work @@
+Termination of term rewriting using dependency pairs
+Normal rank
@@ Property / cites work @@
+Q3917482
@@ Property / cites work: Q3917482 / rank @@
+Normal rank
@@ Property / cites work @@
+Match-bounded string rewriting systems
@@ Property / cites work: Match-bounded string rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Termination proofs for string rewriting systems via inverse match-bounds
+Normal rank
@@ Property / cites work @@
+FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
+Normal rank
@@ Property / cites work @@
+On tree automata that certify termination of left-linear term rewriting systems
+Normal rank
@@ Property / cites work @@
+Logic for Programming, Artificial Intelligence, and Reasoning
+Normal rank
@@ Property / cites work @@
+Frontiers of Combining Systems
@@ Property / cites work: Frontiers of Combining Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Mechanizing and improving dependency pairs
@@ Property / cites work: Mechanizing and improving dependency pairs / rank @@
+Normal rank
@@ Property / cites work @@
+Automating the dependency pair method
@@ Property / cites work: Automating the dependency pair method / rank @@
+Normal rank
@@ Property / cites work @@
+Tyrolean termination tool: techniques and features
+Normal rank
@@ Property / cites work @@
+Proving Termination of Rewrite Systems Using Bounds
+Normal rank
@@ Property / cites work @@
+Q4539643
@@ Property / cites work: Q4539643 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability for left-linear growing term rewriting systems.
+Normal rank
@@ Property / cites work @@
+Term Rewriting and Applications
@@ Property / cites work: Term Rewriting and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of string rewriting proved automatically
+Normal rank