In order to automatically infer the resource consumption of programs, analyzers track how data sizes change along a program's execution. Typically, analyzers measure the sizes of data by applying norms which are mappings from data to natural numbers that represent thesizes of the corresponding data. When norms are de_ned by taking typeinformation into account, they are named typed-norms. The main contributionof this paper is a transformational approach to resource analysiswith typed-norms. The analysis is based on a transformation of the programinto an intermediate abstract program in which each variable isabstracted with respect to all considered norms which are valid for itstype. We also sketch a simple analysis that can be used to automa...
This thesis deals with several quantitative aspects of program analysis. In particular, we consider ...
Recent works by the authors address the problem of automating the selection of a candidate norm for ...
Proofs of termination typically proceed by mapping program states to a well founded domain and showi...
In order to automatically infer the resource consumption of programs, analyzers track how data sizes...
We present a novel general resource analysis for logic programs based on sized types. Sized types a...
We present a novel general resource analysis for logic programs based on sized types.Sized types are...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
We study the problem of automatically analyzing the worst-case resource usage of procedures with sev...
As typed logic programming becomes more mainstream, system building tools like partial deduction sys...
A primary feature of a computer program is its quantitative performance characteristics: the amount ...
This article introduces a technique to accurately perform static prediction of resource usage for ML...
Abstract. Proving bounds on the resource consumption of a program by statically analyzing its source...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
This paper considers the use of dependent types to capture information about dynamic resource usage ...
We present a novel analysis for relating the sizes of terms and subterms occurring at diferent argum...
This thesis deals with several quantitative aspects of program analysis. In particular, we consider ...
Recent works by the authors address the problem of automating the selection of a candidate norm for ...
Proofs of termination typically proceed by mapping program states to a well founded domain and showi...
In order to automatically infer the resource consumption of programs, analyzers track how data sizes...
We present a novel general resource analysis for logic programs based on sized types. Sized types a...
We present a novel general resource analysis for logic programs based on sized types.Sized types are...
We present a generic analysis that infers both upper and lower bounds on the usage that a program ma...
We study the problem of automatically analyzing the worst-case resource usage of procedures with sev...
As typed logic programming becomes more mainstream, system building tools like partial deduction sys...
A primary feature of a computer program is its quantitative performance characteristics: the amount ...
This article introduces a technique to accurately perform static prediction of resource usage for ML...
Abstract. Proving bounds on the resource consumption of a program by statically analyzing its source...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
This paper considers the use of dependent types to capture information about dynamic resource usage ...
We present a novel analysis for relating the sizes of terms and subterms occurring at diferent argum...
This thesis deals with several quantitative aspects of program analysis. In particular, we consider ...
Recent works by the authors address the problem of automating the selection of a candidate norm for ...
Proofs of termination typically proceed by mapping program states to a well founded domain and showi...