Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00381559
Contributor : Anne Bergez <>
Submitted on : Tuesday, May 12, 2009 - 11:13:08 AM
Last modification on : Tuesday, May 12, 2009 - 4:27:44 PM
Long-term archiving on: : Thursday, June 10, 2010 - 10:47:10 PM

File

Testing_4.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00381559, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

126

Files downloads

104