A Transformational Approach to Resource Analysis with Typed-norms Inference
From MaRDI portal
Publication:4957197
DOI10.1017/S1471068419000401zbMath1472.68033OpenAlexW2971474072WikidataQ127320625 ScholiaQ127320625MaRDI QIDQ4957197
Enrique Martin-Martin, Elvira Albert, Samir Genaim, Raúl Gutiérrez
Publication date: 3 September 2021
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068419000401
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Programming languages and systems. 9th Asian symposium, APLAS 2011, Kenting, Taiwan, December 5--7, 2011. Proceedings
- Cost analysis of object-oriented bytecode programs
- Closed-form upper bounds in static cost analysis
- A lattice-theoretical fixpoint theorem and its applications
- Resource Analysis of Complex Programs with Cost Equations
- Recursion and dynamic data-structures in bounded space
- An overview of Ciao and its design philosophy
- Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types
- Static prediction of heap space usage for first-order functional programs
- On the Inference of Resource Usage Upper and Lower Bounds
- A Transformational Approach to Resource Analysis with Typed-Norms
- Compile-time derivation of variable dependency using abstract interpretation
- Mechanical program analysis
- Optimized algorithms for incremental analysis of logic programs
- Cost recurrences for DML programs
- Towards automatic resource bound analysis for OCaml
- Implementation of Functional Languages
- Calculating sized types
This page was built for publication: A Transformational Approach to Resource Analysis with Typed-norms Inference
