Resource control graphs

DOI10.1145/1555746.1555753zbMath1351.68077OpenAlexW2025356485MaRDI QIDQ2946586

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

zbMATH Keywords

program analysisimplicit computational complexityprogram 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)

Related Items (2)

A type-based complexity analysis of object oriented programs ⋮ Realizability models for a linear dependent PCF

This page was built for publication: Resource control graphs