Lower bounds for runtime complexity of term rewriting (Q2398176): Difference between revisions

@@ Property / DOI @@
-.1007/s10817-016-9397-x
@@ Property / DOI: 10.1007/s10817-016-9397-x / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+LoAT
@@ Property / describes a project that uses: LoAT / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+AProVE
@@ Property / describes a project that uses: AProVE / rank @@
+Normal rank
@@ 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/s10817-016-9397-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2561310305
@@ Property / OpenAlex ID: W2561310305 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Inference of Resource Usage Upper and Lower Bounds
+Normal rank
@@ Property / cites work @@
+A Combination Framework for Complexity
@@ Property / cites work: A Combination Framework for Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of type polymorphism in programming
@@ Property / cites work: A theory of type polymorphism in programming / rank @@
+Normal rank
@@ Property / cites work @@
+Term Rewriting and All That
@@ Property / cites work: Term Rewriting and All That / rank @@
+Normal rank
@@ Property / cites work @@
+Q3894958
@@ Property / cites work: Q3894958 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of string rewriting proved automatically
+Normal rank
@@ Property / cites work @@
+Proving Non-looping Non-termination Automatically
@@ Property / cites work: Proving Non-looping Non-termination Automatically / rank @@
+Normal rank
@@ Property / cites work @@
+Inferring Lower Bounds for Runtime Complexity
@@ Property / cites work: Inferring Lower Bounds for Runtime Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Runtime Bounds for Integer Programs
@@ Property / cites work: Lower Runtime Bounds for Integer Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Proving termination by dependency pairs and inductive theorem proving
+Normal rank
@@ Property / cites work @@
+Termination proofs for string rewriting systems via inverse match-bounds
+Normal rank
@@ Property / cites work @@
+Frontiers of Combining Systems
@@ Property / cites work: Frontiers of Combining Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
+Normal rank
@@ Property / cites work @@
+Analyzing program termination and complexity automatically with \textsf{AProVE}
+Normal rank
@@ Property / cites work @@
+Automated Complexity Analysis Based on the Dependency Pair Method
+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 @@
+Loop detection in term rewriting using the eliminating unfoldings
+Normal rank
@@ Property / cites work @@
+Amortised Resource Analysis and Typed Polynomial Interpretations
+Normal rank
@@ Property / cites work @@
+The undecidability of the Turing machine immortality problem
+Normal rank
@@ Property / cites work @@
+Johann Faulhaber and Sums of Powers
@@ Property / cites work: Johann Faulhaber and Sums of Powers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4809079
@@ Property / cites work: Q4809079 / rank @@
+Normal rank
@@ Property / cites work @@
+The Derivational Complexity Induced by the Dependency Pair Method
+Normal rank
@@ Property / cites work @@
+Analyzing innermost runtime complexity of term rewriting by dependency pairs
+Normal rank
@@ Property / cites work @@
+Automated Termination Analysis of Java Bytecode by Term Rewriting
+Normal rank
@@ Property / cites work @@
+Automatic Termination
@@ Property / cites work: Automatic Termination / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and Certifying Loops
@@ Property / cites work: Finding and Certifying Loops / rank @@
+Normal rank
@@ Property / cites work @@
+Modular Complexity Analysis for Term Rewriting
@@ Property / cites work: Modular Complexity Analysis for Term Rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of term rewriting: Interpretation and type elimination
+Normal rank
@@ Property / DOI @@
+.1007/S10817-016-9397-X
@@ Property / DOI: 10.1007/S10817-016-9397-X / rank @@
+Normal rank