Resource control graphs

DOI10.1145/1555746.1555753zbMATH Open1351.68077OpenAlexW2025356485WikidataQ130981266 ScholiaQ130981266MaRDI QIDQ2946586FDOQ2946586

Authors: Jean-Yves Moyen 

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.1555753

Recommendations

• Resource Analysis by Sup-interpretation
• Resource analysis driven by (conditional) termination proofs
• scientific article; zbMATH DE number 2018591
• Sup-interpretations, a semantic method for static analysis of program resources
• Programming Languages and Systems

zbMATH Keywords

implicit computational complexityprogram analysisprogram terminationnon-size-increasing computationsize change termination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (3)

• Realizability models for a linear dependent PCF
• A type-based complexity analysis of object oriented programs
• Resource analysis driven by (conditional) termination proofs

This page was built for publication: Resource control graphs

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