A flow calculus of mwp -bounds for complexity analysis
From MaRDI portal
Publication:2946585
DOI10.1145/1555746.1555752zbMath1351.68075MaRDI 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
implicit computational complexity; automatable complexity analysis of imperative programs; static program anaysis
68Q25: Analysis of algorithms and problem complexity
03B70: Logic in computer science
03D15: Complexity of computation (including implicit computational complexity)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
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, Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time