Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis

DOI10.1007/978-3-540-69166-2_15zbMath1149.68345OpenAlexW1563352283MaRDI QIDQ3522073

Samir Genaim, Germán Puebla, Puri Arenas, Elvira Albert

Publication date: 28 August 2008

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: http://oa.upm.es/2904/

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Lower-bound synthesis using loop specialization and Max-SMT ⋮ Resource Analysis driven by (Conditional) Termination Proofs ⋮ Closed-form upper bounds in static cost analysis ⋮ Verification of gap-order constraint abstractions of counter systems ⋮ Run-time complexity bounds using squeezers ⋮ Quantified abstract configurations of distributed systems ⋮ Automatic complexity analysis of integer programs via triangular weakly non-linear loops ⋮ Type-based analysis of logarithmic amortised complexity ⋮ Runtime complexity analysis of logically constrained rewriting

Uses Software

• PURRS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automated higher-order complexity analysis
• Static prediction of heap space usage for first-order functional programs
• Resource Analysis by Sup-interpretation
• Automating program analysis
• Mechanical program analysis
• A Naïve Time Analysis and its Theory of Cost Equivalence
• Resource bound certification
• Programming Languages and Systems