Sciweavers

592 search results - page 3 / 119
» Predicting faults using the complexity of code changes
Sort
View
ISSRE
2007
IEEE
13 years 7 months ago
Prioritization of Regression Tests using Singular Value Decomposition with Empirical Change Records
During development and testing, changes made to a system to repair a detected fault can often inject a new fault into the code base. These injected faults may not be in the same f...
Mark Sherriff, Mike Lake, Laurie Williams
GLVLSI
1999
IEEE
92views VLSI» more  GLVLSI 1999»
13 years 10 months ago
Fault Coverage Estimation for Early Stage of VLSI Design
This paper proposes a new fault coverage estimation model which can be used in the early stage of VLSI design. The fault coverage model is an exponentially decaying function with ...
Von-Kyoung Kim, Tom Chen, Mick Tegethoff
ISQED
2010
IEEE
156views Hardware» more  ISQED 2010»
13 years 8 months ago
On the design of different concurrent EDC schemes for S-Box and GF(p)
Recent studies have shown that an attacker can retrieve confidential information from cryptographic hardware (e.g. the secret key) by introducing internal faults. A secure and re...
Jimson Mathew, Hafizur Rahaman, Abusaleh M. Jabir,...
SIGSOFT
2006
ACM
14 years 7 months ago
Finding failure-inducing changes in java programs using change classification
Testing and code editing are interleaved activities during program development. When tests fail unexpectedly, the changes that caused the failure(s) are not always easy to find. W...
Barbara G. Ryder, Frank Tip, Maximilian Störz...
ESEM
2008
ACM
13 years 8 months ago
An empirical model to predict security vulnerabilities using code complexity metrics
Complexity is often hypothesized to be the enemy of software security. If this hypothesis is true, complexity metrics may be used to predict the locale of security problems and ca...
Yonghee Shin, Laurie Williams