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
Journal Articles Mathematical Structures in Computer Science Year : 2010

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

David Cachera
Thomas Jensen
  • Function : Author
  • PersonId : 831246
Arnaud Jobin
  • Function : Author
  • PersonId : 901697
Pascal Sotin

Abstract

In this paper we present a semantics-based framework for analysing the quantitative behaviour of programs with respect to resource usage. We start from an operational semantics in which costs are modelled using a dioid structure. The dioid structure of costs allows the definition of the quantitative semantics as a linear operator. We then develop a theory of approximation of such a semantics, which is akin to what is offered by the theory of abstract interpretation for analysing qualitative properties, in order to compute effectively global cost information from the program. We focus on the notion of long-run cost, which models the asymptotic average cost of a program. The abstraction of the semantics has to take two distinct notions of order into account: the order on costs and the order on states. We prove that our abstraction technique provides a correct approximation of the concrete long-run cost of a program.
No file

Dates and versions

hal-00699608 , version 1 (21-05-2012)

Identifiers

Cite

David Cachera, Thomas Jensen, Arnaud Jobin, Pascal Sotin. Long-Run Cost Analysis by Approximation of Linear Operators over Dioids. Mathematical Structures in Computer Science, 2010, 20 (4), pp.589-624. ⟨10.1017/S0960129510000113⟩. ⟨hal-00699608⟩
140 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More