Resource analysis of complex programs with cost equations

DOI10.1007/978-3-319-12736-1_15MaRDI QIDQ2789051zbMATH OpenOpenAlexFDO

Authors Antonio Flores-Montoya, Reiner Hähnle

Publication date 26 February 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12736-1_15

Mathematics Subject Classification ID

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

Recommendations

• More precise yet widely applicable cost analysis
• On the inference of resource usage upper and lower bounds
• Closed-form upper bounds in static cost analysis
• SPEED: precise and efficient static estimation of program computational complexity
• Precise cost analysis via local reasoning

Cited in

(34)

• From Jinja bytecode to term rewriting: a complexity reflecting transformation
• Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
• On the complexity of monitoring Orchids signatures, and recurrence equations
• Certified abstract cost analysis
• Inferring expected runtimes of probabilistic integer programs using expected sizes
• Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free
• Automatic complexity analysis of integer programs via triangular weakly non-linear loops
• Cost analysis for an actor-based workflow modelling language
• Run-time complexity bounds using squeezers
• Complexity and resource bound analysis of imperative programs using difference constraints
• Rely-guarantee termination and cost analyses of loops with concurrent interleavings
• Time analysis of actor programs
• Closed-form upper bounds in static cost analysis
• A transformational approach to parametric accumulated-cost static profiling
• Lower runtime bounds for integer programs
• On the inference of resource usage upper and lower bounds
• More precise yet widely applicable cost analysis
• Interpolation-based height analysis for improving a recurrence solver
• Proving termination through conditional termination
• Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
• A general framework for static profiling of parametric resource usage
• A transformational approach to resource analysis with typed-norms inference
• Resource analysis driven by (conditional) termination proofs
• Control-flow refinement by partial evaluation, and its application to termination and cost analysis
• scientific article; zbMATH DE number 7204445 (Why is no real title available?)
• Precise cost analysis via local reasoning
• SPEED: precise and efficient static estimation of program computational complexity
• Long-Run Cost Analysis by Approximation of Linear Operators over Dioids
• Comparing cost functions in resource analysis
• Analysing parallel complexity of term rewriting
• On complexity bounds and confluence of parallel term rewriting
• Termination analysis of programs with multiphase control-flow
• Targeting completeness: automated complexity analysis of integer programs
• Resource-usage-aware configuration in software product lines

This page was built for publication: Resource analysis of complex programs with cost equations

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