Long-Run Cost Analysis by Approximation of Linear Operators over Dioids - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Long-Run Cost Analysis by Approximation of Linear Operators over Dioids

Abstract

We present a static analysis technique for modeling and approxi- mating the long-run resource usage of programs. The approach is based on a quantitative semantic framework where programs are represented as linear op- erators over dioids. We show how to extract the long-run cost of a program from the matrix representation of its semantics. An essential contribution is to provide abstraction techniques which make it feasible to compute safe over- approximations of this cost. A theorem is proved stating that such abstractions yield correct approximations of the program's long-run cost. The theoretical developments are illustrated on a concrete example taken from the analysis of the cache behaviour of a simple bytecode language.
Fichier principal
Vignette du fichier
RR-6338.pdf (434.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00182338 , version 1 (25-10-2007)
inria-00182338 , version 2 (26-10-2007)
inria-00182338 , version 3 (25-01-2008)
inria-00182338 , version 4 (25-01-2008)

Identifiers

  • HAL Id : inria-00182338 , version 4

Cite

David Cachera, Thomas Jensen, Arnaud Jobin, Pascal Sotin. Long-Run Cost Analysis by Approximation of Linear Operators over Dioids. [Research Report] RR-6338, INRIA. 2007, pp.35. ⟨inria-00182338v4⟩
363 View
254 Download

Share

Gmail Facebook X LinkedIn More