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

DOI10.1145/1555746.1555751MaRDI QIDQ2946584zbMATH OpenOpenAlexFDO

Authors Jean-Yves Marion, Romain Péchoux

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)

Recommendations

• Resource Analysis by Sup-interpretation
• Synthesis of sup-interpretations: a survey
• Quasi-interpretations. A way to control resources
• A space consumption analysis by abstract interpretation
• scientific article; zbMATH DE number 2061700

Cited in

(10)

• Automatic synthesis of logical models for order-sorted first-order theories
• Synthesis of sup-interpretations: a survey
• Real or natural number interpretation and their effect on complexity
• Characterizing polynomial time complexity of stream programs using interpretations
• Closed-form upper bounds in static cost analysis
• On quasi-interpretations, blind abstractions and implicit complexity
• Resource control graphs
• Analyzing the implicit computational complexity of object-oriented programs
• Resource Analysis by Sup-interpretation
• Upper Bounds on Stream I/O Using Semantic Interpretations

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

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