Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search Publications by: Raghu N Kacker (Fed)

Search Title, Abstract, Conference, Citation, Keyword or Author
Displaying 101 - 125 of 195

ACTS: A Combinatorial Test Generation Tool

March 22, 2013
Author(s)
Raghu N. Kacker
In this paper, we introduce a combinatorial test generation tool called Advanced Combinatorial Testing System (or ACTS). ACTS supports t-way combinatorial test generation with several advanced features such as mixed-strength test generation and constraint

An Input Space Modeling Methodology for Combinatorial Testing

March 22, 2013
Author(s)
Mehra N. Borazjany, Laleh Ghandehari, Yu Lei, Raghu N. Kacker, D. Richard Kuhn
The input space of a system must be modeled before combinatorial testing can be applied to this system. The effectiveness of combinatorial testing to a large extent depends on the quality of the input space model. In this paper we introduce an input space

Applying Combinatorial Testing to the Siemens Suite

March 22, 2013
Author(s)
Laleh Ghandehari, Mehra N. Borazjany, Yu Lei, Raghu N. Kacker, D. Richard Kuhn
Combinatorial testing has attracted a lot of attention from both industry and academia. A number of reports suggest that combinatorial testing can be effective for practical applications. However, there still seems to lack systematic, controlled studies on

Combinatorial Coverage Measurement Concepts and Applications

March 22, 2013
Author(s)
David R. Kuhn, Itzel (. Dominquez Mendoza, Raghu N. Kacker, Yu Lei
Empirical data demonstrate the value of t-way coverage, but in some testing situations, it is not practical to use covering arrays. However any set of tests covers at least some proportion of t-way combinations. This paper describes a variety of measures

To Predict Vibrational Spectra, Are Anharmonic Calculations Worthwhile?

January 22, 2013
Author(s)
Ruth L. Jacobsen, Karl K. Irikura, Russell D. Johnson III, Raghu N. Kacker
Anharmonic calculations using vibrational perturbation theory are known to provide near-spectroscopic accuracy when combined with high-level ab initio potential energy functions. However, performance with economical, popular electronic structure methods is

Combinatorial Coverage Measurement

October 26, 2012
Author(s)
David R. Kuhn, Raghu N. Kacker, Yu Lei
Combinatorial testing applies factor covering arrays to test all t-way combinations of input or configuration state space. In some testing situations, it is not practical to use covering arrays, but any set of tests covers at least some portion of t-way

Significance Test in Speaker Recognition Data Analysis with Data Dependency

October 17, 2012
Author(s)
Jin Chu Wu, Alvin F. Martin, Craig S. Greenberg, Raghu N. Kacker, Vincent M. Stanford
To evaluate the performance of speaker recognition systems, a detection cost function defined as a weighted sum of the probabilities of type I and type II errors is employed. The speaker datasets may have data dependency due to multiple uses of the same

Efficient Algorithms for T-way Test Sequence Generation

October 16, 2012
Author(s)
Linbin Yu, Yu Lei, Raghu N. Kacker, D. Richard Kuhn, James F. Lawrence
Combinatorial testing has been shown to be a very effective testing strategy. Most work on combinatorial testing focuses on t-way test data generation, where each test is an unordered set of parameter values. In this paper, we study the problem of t-way

Measuring Combinatorial Coverage of System State-space for IV&V

September 13, 2012
Author(s)
David R. Kuhn, Raghu N. Kacker
This report describes some measures of combinatorial coverage that can be helpful in estimating this risk that we have applied to tests for spacecraft software but have general application to any combinatorial coverage problem. This method will be

Efficient Methods for Interoperability Testing Using Event Sequences

July 31, 2012
Author(s)
David R. Kuhn, James M. Higdon, J .M. Lawrence, Raghu N. Kacker, Yu Lei
Many software testing problems involve sequences of events. The methods described in this paper were motivated by testing needs of mission critical systems that may accept multiple communication or sensor inputs and generate output to several communication

A New Measure in Cell Image Segmentation Data Analysis

July 24, 2012
Author(s)
Jin Chu Wu, Michael W. Halter, Raghu N. Kacker, John T. Elliott
Cell image segmentation (CIS) is critical for quantitative imaging in cytometric analyses. The data derived after segmentation can be used to infer cellular function. To evaluate CIS algorithms, first for dealing with comparisons of single cells treated as

Data Dependency on Measurement Uncertainties in Speaker Recognition Evaluation

July 11, 2012
Author(s)
Jin Chu Wu, Alvin F. Martin, Craig S. Greenberg, Raghu N. Kacker
The National Institute of Standards and Technology conducts an ongoing series of Speaker Recognition Evaluations (SRE). Speaker detection performance is measured using a detection cost function defined as a weighted sum of the probabilities of type I and

Combinatorial Testing

June 25, 2012
Author(s)
David R. Kuhn, Raghu N. Kacker, Yu Lei
Combinatorial testing is a method that can reduce cost and improve test effectiveness significantly for many applications. The key insight underlying this form of testing is that not every parameter contributes to every failure, and empirical data suggest

Combinatorial Methods for Event Sequence Testing

April 21, 2012
Author(s)
D. Richard Kuhn, James M. Higdon, James F. Lawrence, Raghu N. Kacker, Yu Lei
Many software testing problems involve sequences. This paper presents an application of combinatorial methods to testing problems for which it is important to test multiple configurations, but also to test the order in which events occur. For example, the

Combinatorial Testing of ACTS: A Case Study

April 21, 2012
Author(s)
Mehra N. Borazjany, Linbin Yu, Yu Lei, Raghu N. Kacker, D. Richard Kuhn
In this paper we present a case study of applying combinatorial testing to test a combinatorial test generation tool called ACTS. The purpose of this study is two-fold. First, we want to gain experience and insights about how to apply combinatorial testing

Combining Results from Multiple Evaluations of the Same Measurand

December 1, 2011
Author(s)
Raghu N. Kacker, Klaus-Dieter Sommer
According to the Guide to the Expression of Uncertainty in Measurement (GUM), a result of measurement consists of a measured value together with its associated standard uncertainty. The measured value and the standard uncertainty are interpreted as the

Uncertainties of Measures in Speaker Recognition Evaluation

November 10, 2011
Author(s)
Jin Chu Wu, Alvin F. Martin, Craig S. Greenberg, Raghu N. Kacker
The National Institute of Standards and Technology (NIST) Speaker Recognition Evaluations (SRE) are an ongoing series of projects conducted by NIST. In the NIST SRE, speaker detection performance is measured using a detection cost function, which is

Data Dependency on Measurement Uncertainties in Speaker Recognition Evaluation

November 3, 2011
Author(s)
Jin Chu Wu, Alvin F. Martin, Craig S. Greenberg, Raghu N. Kacker
The National Institute of Standards and Technology (NIST) has been conducting an ongoing series of Speaker Recognition Evaluations (SRE). Speaker detection performance is measured using a detection cost function defined as a weighted sum of the

A Combinatorial Approach to Detecting Buffer Overflow Vulnerabilities

June 14, 2011
Author(s)
Raghu N. Kacker, Yu Lei, David R. Kuhn, Wenhua Wang
Buffer overflow vulnerabilities are program defects that can cause a buffer overflow to occur at runtime. Many security attacks exploit buffer overflow vulnerabilities to compromise critical data structures. In this paper, we present a black-box testing