Long-Run Cost Analysis by Approximation of Linear Operators over Dioids
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...