Extending Quasar with dynamic tasks computation

Abstract : The inclusion of dynamic tasks modelisation in Quasar, a tool for automatic analysis of concurrent programs, extends its applicative usefulness. However this extension leads to large size models whose processing has to face combinatory explosion of modeling states. This article is an extension of the paper "Dynamic tasks verification with QUASAR" accepted for publication in the 10th International Conference on Reliable Software Technologies Ada-Europe 2005. It gives some insight into the impact of the way used to name dynamic task in term of state space size by comparing different solutions on several examples.
Type de document :
Rapport
[Research Report] CEDRIC-05-695, CEDRIC Lab/CNAM. 2005
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01124951
Contributeur : Laboratoire Cedric <>
Soumis le : vendredi 6 mars 2015 - 10:53:35
Dernière modification le : vendredi 16 septembre 2016 - 15:05:58

Identifiants

  • HAL Id : hal-01124951, version 1

Collections

Citation

Christophe Pajault. Extending Quasar with dynamic tasks computation. [Research Report] CEDRIC-05-695, CEDRIC Lab/CNAM. 2005. <hal-01124951>

Partager

Métriques

Consultations de la notice

6