Sup-interpretations, a semantic method for static analysis of program resources

DOI10.1145/1555746.1555751zbMath1351.68061OpenAlexW2033656559MaRDI QIDQ2946584

Romain Péchoux, Jean-Yves Marion

Publication date: 17 September 2015

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

Full work available at URL: https://hal.inria.fr/inria-00446057/file/333pechoux.pdf

zbMATH Keywords

resources controlstatic analysis of first-order languages

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

On quasi-interpretations, blind abstractions and implicit complexity ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ Closed-form upper bounds in static cost analysis ⋮ Upper Bounds on Stream I/O Using Semantic Interpretations ⋮ Real or natural number interpretation and their effect on complexity ⋮ Characterizing polynomial time complexity of stream programs using interpretations

This page was built for publication: Sup-interpretations, a semantic method for static analysis of program resources