Long-run cost analysis by approximation of linear operators over dioids

Authors:
David Cachera;Thomas Jensen;Arnaud Jobin;Pascal Sotin
Affiliations:
Irisa/ens cachan (bretagne), campus de beaulieu, f-35042 rennes cedex, france email: david.cachera@irisa.fr;Irisa/cnrs, campus de beaulieu, f-35042 rennes cedex, france email: thomas.jensen@irisa.fr;Université rennes 1, campus de beaulieu, f-35042 rennes cedex, france email: arnaud.jobin@irisa.fr;Cnrs/dga, f-35042 rennes cedex, france email: pascal.sotin@irisa.fr
Venue:
Mathematical Structures in Computer Science
Year:
2010

Citing 15
Cited 1

Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Concurrent constraint programming: towards probabilistic abstract interpretation

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstracting soft constraints: framework, properties, examples

Artificial Intelligence
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)

Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Probabilistic λ-calculus and Quantitative Program Analysis

Journal of Logic and Computation
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract)

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SHReQ: Coordinating Application Level QoS

SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Measuring the confinement of probabilistic systems

Theoretical Computer Science - Theoretical foundations of security analysis and design II
A program logic for resources

Theoretical Computer Science
Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)

Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids

AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Managing quality of service with soft constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
A Semiring-based Quantitative Analysis of Mobile Systems

Electronic Notes in Theoretical Computer Science (ENTCS)

Cost analysis of object-oriented bytecode programs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.