Time complexity of concurrent programs: a technique based on behavioural types

Elena Giachino 1, 2 Einar Broch Johnsen 3 Cosimo Laneve 1, 2 Ka I Pun 3
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : We study the problem of automatically computing the time complexity of concurrent object-oriented programs. To determine this complexity we use intermediate abstract descriptions that record relevant information for the time analysis (cost of statements, creations of objects, and concurrent operations), called behavioural types. Then, we define a translation function that takes behavioural types and makes the parallelism explicit into so-called cost equations , which are fed to an automatic off-the-shelf solver for obtaining the time complexity.
Type de document :
Communication dans un congrès
FACS 2015, Oct 2015, Niterói, Rio de Janeiro, Brazil
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01229068
Contributeur : Elena Giachino <>
Soumis le : lundi 16 novembre 2015 - 12:58:55
Dernière modification le : mercredi 10 octobre 2018 - 10:09:56
Document(s) archivé(s) le : vendredi 28 avril 2017 - 21:31:45

Fichiers

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01229068, version 1
  • ARXIV : 1511.05104

Collections

Citation

Elena Giachino, Einar Broch Johnsen, Cosimo Laneve, Ka I Pun. Time complexity of concurrent programs: a technique based on behavioural types. FACS 2015, Oct 2015, Niterói, Rio de Janeiro, Brazil. 〈hal-01229068〉

Partager

Métriques

Consultations de la notice

178

Téléchargements de fichiers

83