Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
From MaRDI portal
Publication:3522073
DOI10.1007/978-3-540-69166-2_15zbMATH Open1149.68345OpenAlexW1563352283MaRDI QIDQ3522073FDOQ3522073
Authors: Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla 
Publication date: 28 August 2008
Published in: Static Analysis (Search for Journal in Brave)
Full work available at URL: http://oa.upm.es/2904/
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Resource Analysis by Sup-interpretation
- Mechanical program analysis
- Automated higher-order complexity analysis
- Static prediction of heap space usage for first-order functional programs
- Automating program analysis
- Resource bound certification
- Title not available (Why is that?)
- A Naïve Time Analysis and its Theory of Cost Equivalence
- Programming Languages and Systems
Cited In (14)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- Lower-bound synthesis using loop specialization and Max-SMT
- Verification of gap-order constraint abstractions of counter systems
- Closed-form upper bounds in static cost analysis
- Run-time complexity bounds using squeezers
- On the inference of resource usage upper and lower bounds
- Runtime complexity analysis of logically constrained rewriting
- Interpolation-based height analysis for improving a recurrence solver
- Resource analysis driven by (conditional) termination proofs
- Automated recurrence analysis for almost-linear expected-runtime bounds
- Cost recurrences for DML programs
- Quantified abstract configurations of distributed systems
- More precise yet widely applicable cost analysis
- Type-based analysis of logarithmic amortised complexity
Uses Software
This page was built for publication: Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522073)
