Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-70590-1_19
+Normal rank
@@ Property / OpenAlex ID @@
+W1588175212
@@ Property / OpenAlex ID: W1588175212 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination proofs and the length of derivations
@@ Property / cites work: Termination proofs and the length of derivations / rank @@
+Normal rank
@@ Property / cites work @@
+Termination proofs by multiset path orderings imply primitive recursive derivation lengths
+Normal rank
@@ Property / cites work @@
+Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths
+Normal rank
@@ Property / cites work @@
+Derivational Complexity of Knuth-Bendix Orders Revisited
+Normal rank
@@ Property / cites work @@
+On tree automata that certify termination of left-linear term rewriting systems
+Normal rank
@@ Property / cites work @@
+Automated Complexity Analysis Based on the Dependency Pair Method
+Normal rank
@@ Property / cites work @@
+Q2778874
@@ Property / cites work: Q2778874 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4799892
@@ Property / cites work: Q4799892 / rank @@
+Normal rank
@@ Property / cites work @@
+Mechanically proving termination using polynomial interpretations
+Normal rank
@@ Property / cites work @@
+Q5613949
@@ Property / cites work: Q5613949 / rank @@
+Normal rank
@@ Property / cites work @@
+SAT Solving for Termination Analysis with Polynomial Interpretations
+Normal rank
@@ Property / cites work @@
+Proving Termination of Rewrite Systems Using Bounds
+Normal rank
@@ Property / cites work @@
+Deleting string rewriting systems preserve regularity
+Normal rank
@@ Property / cites work @@
+Algorithms with polynomial interpretation termination proof
+Normal rank
@@ Property / cites work @@
+Analysing the implicit complexity of programs.
@@ Property / cites work: Analysing the implicit complexity of programs. / rank @@
+Normal rank
@@ Property / cites work @@
+Term Rewriting and Applications
@@ Property / cites work: Term Rewriting and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Resource Analysis by Sup-interpretation
@@ Property / cites work: Resource Analysis by Sup-interpretation / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Analysis by Rewriting
@@ Property / cites work: Complexity Analysis by Rewriting / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3522024