| Autor: |
Jenihhin, Maksim, Raik, Jaan, Chepurov, Anton, Reinsalu, Uljana, Ubar, Raimund |
| Přispěvatelé: |
Bergez, Anne, Hélène WAESELYNCK |
| Jazyk: |
angličtina |
| Rok vydání: |
2009 |
| Předmět: |
|
| Popis: |
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. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
