More precise yet widely applicable cost analysis

DOI10.1007/978-3-642-18275-4_5MaRDI QIDQ3075469zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(18)

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

Describes a project that uses

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)