Closed-form upper bounds in static cost analysis (Q2429987): Difference between revisions

@@ Property / describes a project that uses @@
+COSTA
@@ Property / describes a project that uses: COSTA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+PPL
@@ Property / describes a project that uses: PPL / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+PURRS
@@ Property / describes a project that uses: PURRS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Refal
@@ Property / describes a project that uses: Refal / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Ciao
@@ Property / describes a project that uses: Ciao / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ACE
@@ Property / describes a project that uses: ACE / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CiaoPP
@@ Property / describes a project that uses: CiaoPP / 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-010-9174-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2111366004
@@ Property / OpenAlex ID: W2111366004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
+Normal rank
@@ Property / cites work @@
+Cost analysis of object-oriented bytecode programs
+Normal rank
@@ Property / cites work @@
+Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Automated higher-order complexity analysis
@@ Property / cites work: Automated higher-order complexity analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Term Rewriting and Applications
@@ Property / cites work: Term Rewriting and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of Integer Linear Programs
@@ Property / cites work: Termination of Integer Linear Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Programming Languages and Systems
@@ Property / cites work: Programming Languages and Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Resource bound certification
@@ Property / cites work: Resource bound certification / rank @@
+Normal rank
@@ Property / cites work @@
+Q5584402
@@ Property / cites work: Q5584402 / rank @@
+Normal rank
@@ Property / cites work @@
+Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
+Normal rank
@@ Property / cites work @@
+Automating program analysis
@@ Property / cites work: Automating program analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Static prediction of heap space usage for first-order functional programs
+Normal rank
@@ Property / cites work @@
+Q5287559
@@ Property / cites work: Q5287559 / rank @@
+Normal rank
@@ Property / cites work @@
+New Computational Paradigms
@@ Property / cites work: New Computational Paradigms / rank @@
+Normal rank
@@ Property / cites work @@
+Logic program specialisation through partial  deduction: Control issues
+Normal rank
@@ Property / cites work @@
+Partial evaluation in logic programming
@@ Property / cites work: Partial evaluation in logic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Sup-interpretations, a semantic method for static analysis of program resources
+Normal rank
@@ Property / cites work @@
+Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
+Normal rank
@@ Property / cites work @@
+Verification, Model Checking, and Abstract Interpretation
+Normal rank
@@ Property / cites work @@
+Q4414740
@@ Property / cites work: Q4414740 / rank @@
+Normal rank
@@ Property / cites work @@
+A Naïve Time Analysis and its Theory of Cost Equivalence
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
+Normal rank
@@ Property / cites work @@
+The concept of a supercompiler
@@ Property / cites work: The concept of a supercompiler / rank @@
+Normal rank
@@ Property / cites work @@
+Mechanical program analysis
@@ Property / cites work: Mechanical program analysis / rank @@
+Normal rank