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

Maksim Jenihhin (1) , Jaan Raik (1) , Anton Chepurov (1) , Uljana Reinsalu (1) , Raimund Ubar (1)

1 Department of Computer Engineering

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.

Domains: Software Engineering [cs.SE]

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⟩