On the Inference of Resource Usage Upper and Lower Bounds

DOI10.1145/2499937.2499943zbMath1353.68045OpenAlexW1992296379MaRDI QIDQ2946710

Samir Genaim, Abu Naser Masud, Elvira Albert

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2499937.2499943

zbMATH Keywords

upper boundslower boundsstatic cost analysis

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Lower-bound synthesis using loop specialization and Max-SMT ⋮ Lower bounds for runtime complexity of term rewriting ⋮ Inference of Field-Sensitive Reachability and Cyclicity ⋮ Denotational semantics as a foundation for cost recurrence extraction for functional languages ⋮ A Transformational Approach to Resource Analysis with Typed-norms Inference ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes ⋮ Lower Runtime Bounds for Integer Programs ⋮ Runtime complexity analysis of logically constrained rewriting

This page was built for publication: On the Inference of Resource Usage Upper and Lower Bounds