Code Coverage Analysis for Concurrent Programming Languages Using High-Level Decision Diagrams - Archive ouverte HAL
Communication Dans Un Congrès Année : 2009

Code Coverage Analysis for Concurrent Programming Languages Using High-Level Decision Diagrams

Résumé

The paper presents using high-level decision diagram (HLDD) as a suitable graph model for code coverage analysis in concurrent programming languages. The authors show that HLDD models are scalable and compact models for realistic problems can be automatically obtained. At the same time they allow covering paths of non-blocking assignments, which conventional code coverage metrics designed for procedural programming languages are unable to handle. The paper proposes optimal minimization rules to be used in HLDD model synthesis for code coverage analysis.

Domaines

Génie logiciel [cs.SE]
Fichier principal
Vignette du fichier
Testing_4.pdf (365.44 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Anne Bergez  : Connectez-vous pour contacter le contributeur

https://hal.science/hal-00381559

Soumis le : mardi 12 mai 2009-11:13:08

Dernière modification le : lundi 4 novembre 2024-15:50:04

Archivage à long terme le : jeudi 10 juin 2010-22:47:10

Télécharger pour visualiser

Dates et versions

hal-00381559 , version 1 (12-05-2009)

Identifiants

  • HAL Id : hal-00381559 , version 1

Citer

Maksim Jenihhin, Jaan Raik, Anton Chepurov, Uljana Reinsalu, Raimund Ubar. Code Coverage Analysis for Concurrent Programming Languages Using High-Level Decision Diagrams. 12th European Workshop on Dependable Computing, EWDC 2009, May 2009, Toulouse, France. 4 p. ⟨hal-00381559⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

EWDC2009
125 Consultations
83 Téléchargements

Partager

More