A flow calculus of mwp -bounds for complexity analysis

DOI10.1145/1555746.1555752zbMath1351.68075OpenAlexW2115581182MaRDI QIDQ2946585

Neil D. Jones, Lars Kristiansen

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/1555746.1555752

zbMATH Keywords

implicit computational complexityautomatable complexity analysis of imperative programsstatic program anaysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time ⋮ Unnamed Item ⋮ ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs

This page was built for publication: A flow calculus of mwp -bounds for complexity analysis