Run-time complexity bounds using squeezers (Q2233463): Difference between revisions

@@ Property / cites work @@
+Algorithmic analysis of programs with well quasi-ordered domains.
+Normal rank
@@ Property / cites work @@
+Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
+Normal rank
@@ Property / cites work @@
+Resource Analysis driven by (Conditional) Termination Proofs
+Normal rank
@@ Property / cites work @@
+Well-structured transition systems everywhere!
@@ Property / cites work: Well-structured transition systems everywhere! / rank @@
+Normal rank
@@ Property / cites work @@
+SPEED: Symbolic Complexity Bound Analysis
@@ Property / cites work: SPEED: Symbolic Complexity Bound Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+SPEED
@@ Property / cites work: SPEED / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized Resource Analysis with Polynomial Potential
+Normal rank
@@ Property / cites work @@
+Putting the squeeze on array programs: loop verification via inductive rank reduction
+Normal rank
@@ Property / cites work @@
+SMT-based model checking for recursive programs
@@ Property / cites work: SMT-based model checking for recursive programs / rank @@
+Normal rank
@@ Property / cites work @@
+The size-change principle for program termination
@@ Property / cites work: The size-change principle for program termination / rank @@
+Normal rank
@@ Property / cites work @@
+Termination Analysis with Calling Context Graphs
@@ Property / cites work: Termination Analysis with Calling Context Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and resource bound analysis of imperative programs using difference constraints
+Normal rank
@@ Property / cites work @@
+Mechanical program analysis
@@ Property / cites work: Mechanical program analysis / rank @@
+Normal rank