More precise yet widely applicable cost analysis

DOI10.1007/978-3-642-18275-4_5zbMATH Open1317.68027OpenAlexW3136924826MaRDI QIDQ3075469FDOQ3075469

Authors: Elvira Albert, Samir Genaim, Abu Naser Masud 

Publication date: 15 February 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18275-4_5

Recommendations

• On the inference of resource usage upper and lower bounds
• Resource analysis of complex programs with cost equations
• Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
• Precise cost analysis via local reasoning
• Closed-form upper bounds in static cost analysis

Mathematics Subject Classification ID

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

Cites Work

• Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
• SPEED: precise and efficient static estimation of program computational complexity
• Closed-form upper bounds in static cost analysis
• Comparing cost functions in resource analysis
• Mechanical program analysis
• Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
• Resource bound certification
• Size-Change Termination, Monotonicity Constraints and Ranking Functions

Cited In (18)

• Comparing cost functions in resource analysis
• Relational cost analysis
• Closed-form upper bounds in static cost analysis
• A transformational approach to parametric accumulated-cost static profiling
• Run-time complexity bounds using squeezers
• A multi-domain incremental analysis engine and its application to incremental resource analysis
• On the inference of resource usage upper and lower bounds
• A general framework for static profiling of parametric resource usage
• On-screen real-time cost estimating
• Interpolation-based height analysis for improving a recurrence solver
• Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
• Selectively-amortized resource bounding
• Semantic foundations for cost analysis of pipeline-optimized programs
• Analysis of executable software models
• Cost recurrences for DML programs
• Resource analysis of complex programs with cost equations
• Cost analysis of object-oriented bytecode programs
• Precise cost analysis via local reasoning

Uses Software

• Maxima
• PURRS
• SPEED

This page was built for publication: More precise yet widely applicable cost analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075469)