Please use this identifier to cite or link to this item:
http://www.repositorio.ufop.br/jspui/handle/123456789/1767
Title: | Efficient allocation of verification resources using revision history information. |
Authors: | Nacif, José Augusto Miranda Silva, Thiago Tavares, Andréa Iabrudi Fernandes, Antônio Otávio Coelho Júnior, Claudionor José Nunes |
Issue Date: | 2008 |
Citation: | NACIF, J. A. M. et al. Efficient allocation of verification resources using revision history information. In.IEEE Workshop on Design and Diagnostics of Electronic Systems,11,. 2008, Bratislava. Anais... Bratislava: Workshop on Design and Diagnostics of Electronic Systems, 2008.Disponível em: <http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4538784>. Acesso em: 12 nov. 2012 |
Abstract: | Verifying large industrial designs is getting harder each day. he current verification methodologies are not able to guarantee bug free designs. Some recurrent questions during a design verification are: Which modules are most likely to contain undetected bugs? In wich modules the verification team should concentrate their effort? This information is very useful, because it is better to start verifying the most bug-prone modules. In this work we present a novel approach to answer these questions. In order to identify these bug rone modules the revision history of the design is used. Using information of an academic experiment, we demonstrate that there is a close between bugs/changes history and future bugs. Our results show that allocating modules for verification based on bugs/changes leaded to the coverage of 91.67% of future bugs, while random based strategy covered only 37.5% of the future work mainly focused in software engineering techniques to bugs. |
URI: | http://www.repositorio.ufop.br/handle/123456789/1767 |
Appears in Collections: | DECOM - Trabalhos apresentados em eventos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
EVENTO_EfficientAllocationVerification.pdf | 402,92 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.