Purpose: to describe the formal techniques used in the HUME Heap-space analysis and to explain how the results of the HUME Heap-space analysis are to be interpreted. Results: We have constructed a resource-aware type system for a slightly simplified version of HUME, whose annotated typings yield provable upper bounds on Heap-space consumption of the typed terms. Conclusion: The principal goal of this piece of work has been successfully achieved, providing a critical foundation for the success of the project as a whole. Moreover, in undertaking the work, we have identified a number of new ideas for further research that could be performed in order to improve the precision of the bounds we obtain and to increase the range of programs whose co...
Program properties that are automatically inferred by static analysis tools are generally not consid...
Live heap space analyses have so far been concerned with the standard sequential programming model. ...
ABSTRACT We show how to efficiently obtain linear a priori bounds on the heap space consumption of f...
Purpose: To construct an effective stack-space usage analysis based on a formal semantics for Hume i...
The prediction of resource consumption in programs has gained interest in the last years. It is impo...
This paper describes ongoing work aimed at the construction of formal cost models and analyses that ...
Programming resource-sensitive systems, such as real-time embedded systems, requires guaranteeing bo...
Controlling resource usage is important for the reliability, efficiency and security of software sys...
Bounding resource usage is important for a number of areas, notably real-time embedded systems and s...
This chapter describes Hume: a functionally-based language for programming with bounded resource usa...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
Our objective is to propose methods for resource-aware compila-tion inspired by the implicit complex...
The Amortised Heap Space Usage Analysis (AHA) project [4] aims at statically estimating heap consump...
Our objective is to propose methods for resource-aware compilation inspired by the implicit complexi...
Abstract. The prediction of resource consumption in programs has gained interest in the last years. ...
Program properties that are automatically inferred by static analysis tools are generally not consid...
Live heap space analyses have so far been concerned with the standard sequential programming model. ...
ABSTRACT We show how to efficiently obtain linear a priori bounds on the heap space consumption of f...
Purpose: To construct an effective stack-space usage analysis based on a formal semantics for Hume i...
The prediction of resource consumption in programs has gained interest in the last years. It is impo...
This paper describes ongoing work aimed at the construction of formal cost models and analyses that ...
Programming resource-sensitive systems, such as real-time embedded systems, requires guaranteeing bo...
Controlling resource usage is important for the reliability, efficiency and security of software sys...
Bounding resource usage is important for a number of areas, notably real-time embedded systems and s...
This chapter describes Hume: a functionally-based language for programming with bounded resource usa...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
Our objective is to propose methods for resource-aware compila-tion inspired by the implicit complex...
The Amortised Heap Space Usage Analysis (AHA) project [4] aims at statically estimating heap consump...
Our objective is to propose methods for resource-aware compilation inspired by the implicit complexi...
Abstract. The prediction of resource consumption in programs has gained interest in the last years. ...
Program properties that are automatically inferred by static analysis tools are generally not consid...
Live heap space analyses have so far been concerned with the standard sequential programming model. ...
ABSTRACT We show how to efficiently obtain linear a priori bounds on the heap space consumption of f...