Raghu N. Kacker

Raghu N. Kacker

Auto-generated profile, based on publicly available information

Raghu N. Kacker

National Institute of Standards and Technology, Gaithersburg, MD, USA

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

1 September 2008 in Journal of Research of the National Institute of Standards and Technology
Verified
Journal Article
Closed access
MFMichael Forbes
Michael Forbes
JLJim Lawrence
Jim Lawrence
YLYu Lei
Yu Lei
RKRaghu N. Kacker
Raghu N. Kacker
DKD. Richard Kuhn
D. Richard Kuhn
Covering arrays are structures for well-representing extremely large input spaces and are used to efficiently implement blackbox testing for software and hardware. This paper proposes refinements over the In-Parameter-Order strategy (for arbitrary t). When constructing homogeneous-alphabet covering arrays, these refinements reduce runtime in nearly all cases by a factor of more than 5 and in some cases by factors as large as 280. This trend is increasing with the number of columns in the covering array. Moreover, the resulting covering arrays are about 5 % smaller. Consequently, this new algorithm has constructed many covering arrays that are the smallest in the literature. A heuristic variant of the algorithm sometimes produces comparably sized covering arrays while running significantly faster.

5 January 2011 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
JLJim Lawrence
Jim Lawrence
RKRaghu N. Kacker
Raghu N. Kacker
YLYu Lei
Yu Lei
DKD. Richard Kuhn
D. Richard Kuhn
MFMichael Forbes
Michael Forbes
Binary covering arrays of strength $t$ are 0–1 matrices having the property that for each $t$ columns and each of the possible $2^t$ sequences of $t$ 0's and 1's, there exists a row having that sequence in that set of $t$ columns. Covering arrays are an important tool in certain applications, for example, in software testing. In these applications, the number of columns of the matrix is dictated by the application, and it is desirable to have a covering array with a small number of rows. Here we survey some of what is known about the existence of binary covering arrays and methods of producing them, including both explicit constructions and search techniques.

17 August 2018 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
LGLaleh Sh. Ghandehari
Laleh Sh. Ghandehari
YLYu Lei
Yu Lei
RKRaghu Kacker
Raghu Kacker
RKRichard Kuhn
Richard Kuhn
TXTao Xie
Tao Xie
DKDavid Kung
David Kung
Combinatorial testing has been shown to be a very effective strategy for software testing. After a failure is detected, the next task is to identify one or more faulty statements in the source code that have caused the failure. In this paper, we present a fault localization approach, called BEN, which produces a ranking of statements in terms of their likelihood of being faulty by leveraging the result of combinatorial testing.

1 November 2010 in Journal of Research of the National Institute of Standards and Technology
Verified
Journal Article
Closed access
RKRaghu N. Kacker
Raghu N. Kacker
RKRüdiger Kessel
Rüdiger Kessel
KSKlaus-Dieter Sommer
Klaus-Dieter Sommer
In some metrology applications multiple results of measurement for a common measurand are obtained and it is necessary to determine whether the results agree with each other. A result of measurement based on the Guide to the Expression of Uncertainty in Measurement (GUM) consists of a measured value together with its associated standard uncertainty. In the GUM, the measured value is regarded as the expected value and the standard uncertainty is regarded as the standard deviation, both known values, of a state-of-knowledge probability distribution. A state-of-knowledge distribution represented by a result need not be completely known. Then how can one assess the differences between the results based on the GUM? Metrologists have for many years used the Birge chisquare test as ‘a rule of thumb’ to assess the differences between two or more measured values for the same measurand by pretending that the standard uncertainties were the standard deviations of the presumed sampling probability distributions from random variation of the measured values. We point out that this is misuse of the standard uncertainties; the Birge test and the concept of statistical consistency motivated by it do not apply to the results of measurement based on the GUM. In 2008, the International Vocabulary of Metrology, third edition (VIM3) introduced the concept of metrological compatibility. We propose that the concept of metrological compatibility be used to assess the differences between results based on the GUM for the same measurand. A test of the metrological compatibility of two results of measurement does not conflict with a pairwise Birge test of the statistical consistency of the corresponding measured values.

1 June 2011
Verified
Conference Paper
Closed access
WWWenhua Wang
Wenhua Wang
YLYu Lei
Yu Lei
DLDonggang Liu
Donggang Liu
DKDavid Kung
David Kung
CCChristoph Csallner
Christoph Csallner
RKRick Kuhn
Rick Kuhn
Buffer overflow vulnerabilities are program defects that can cause a buffer to overflow at runtime. Many security attacks exploit buffer overflow vulnerabilities to compromise critical data structures. In this paper, we present a black-box testing approach to detecting buffer overflow vulnerabilities. Our approach is motivated by a reflection on how buffer overflow vulnerabilities are exploited in practice. In most cases the attacker can influence the behavior of a target system only by controlling its external parameters. Therefore, launching a successful attack often amounts to a clever way of tweaking the values of external parameters. We simulate the process performed by the attacker, but in a more systematic manner. A novel aspect of our approach is that it adapts a general software testing technique called combinatorial testing to the domain of security testing. In particular, our approach exploits the fact that combinatorial testing often achieves a high level of code coverage. We have implemented our approach in a prototype tool called Tance. The results of applying Tance to five open-source programs show that our approach can be very effective in detecting buffer overflow vulnerabilities.