We present a type and effect system for static analysis of programs written in a simplified version of iTasks. iTasks is a workflow specification language embedded in Clean, a general-purpose functional programming language. Given costs for basic tasks, our analysis calculates an upper bound of the total cost of a workflow. The analysis has to deal with the domain-specific features of iTasks, in particular parallel and sequential composition of tasks, as well as the general-purpose features of Clean, in particular let-polymorphism, higher-order functions, recursion and lazy evaluation. Costs are vectors of natural numbers where every element represents some resource, either consumable or reusable
This paper describes an inference system, whose purpose is to determine the cost of evaluating expre...
International audienceWe propose a static analysis technique that computes upper bounds of virtual m...
Abstract. Resource usage is one of the most important characteristics of programs. Automatically gen...
Source code accompanying the paper Markus Klinik, Jurriaan Hage, Jan Martin Jansen, and Rinus Plasm...
We describe a new automatic static analysis for determining upper-bound functions on the use of quan...
This paper considers the use of dependent types to capture information about dynamic resource usage ...
We present a novel static analysis for inferring precise complexity bounds of imperative and recursi...
Traditional static resource analyses estimate the total resource usage of a program, without executi...
Contains fulltext : 168716.pdf (publisher's version ) (Open Access)PEPM 2017: 2017...
For some applications, standard resource analyses do not provide the information required. Such anal...
Bounding resource usage is important for a number of areas, notably real-time embedded systems and s...
none4We propose a static analysis technique that computes upper bounds of virtual machine usages in ...
Source code accompanying the paper: Klinik, M., Jansen, J.M. & Plasmeijer, R. (2017). The Sky is th...
Abstract. Proving bounds on the resource consumption of a program by statically analyzing its source...
Cost analysis aims at statically inferring the amount of resources, such as time or memory, needed t...
This paper describes an inference system, whose purpose is to determine the cost of evaluating expre...
International audienceWe propose a static analysis technique that computes upper bounds of virtual m...
Abstract. Resource usage is one of the most important characteristics of programs. Automatically gen...
Source code accompanying the paper Markus Klinik, Jurriaan Hage, Jan Martin Jansen, and Rinus Plasm...
We describe a new automatic static analysis for determining upper-bound functions on the use of quan...
This paper considers the use of dependent types to capture information about dynamic resource usage ...
We present a novel static analysis for inferring precise complexity bounds of imperative and recursi...
Traditional static resource analyses estimate the total resource usage of a program, without executi...
Contains fulltext : 168716.pdf (publisher's version ) (Open Access)PEPM 2017: 2017...
For some applications, standard resource analyses do not provide the information required. Such anal...
Bounding resource usage is important for a number of areas, notably real-time embedded systems and s...
none4We propose a static analysis technique that computes upper bounds of virtual machine usages in ...
Source code accompanying the paper: Klinik, M., Jansen, J.M. & Plasmeijer, R. (2017). The Sky is th...
Abstract. Proving bounds on the resource consumption of a program by statically analyzing its source...
Cost analysis aims at statically inferring the amount of resources, such as time or memory, needed t...
This paper describes an inference system, whose purpose is to determine the cost of evaluating expre...
International audienceWe propose a static analysis technique that computes upper bounds of virtual m...
Abstract. Resource usage is one of the most important characteristics of programs. Automatically gen...