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 51 - 75 of 183

Combinatorial Coverage Analysis of Subsets of the TLS Cipher Suite Registry

May 11, 2016
Author(s)
Dimitris Simos, Kristoffer Kleine, D. Richard Kuhn, Raghu N. Kacker
We present a combinatorial coverage measurement for (subsets) of the TLS cipher suite registries by analyzing the specified ciphers of IANA, ENISA, BSI, Mozilla and NSA Suite B. Our findings contribute towards the design of quality measures of recommended

Using Combinatorial Testing to Build Navigation Graphs for Dynamic Web Applications

February 2, 2016
Author(s)
Wenhua Wang, Sreedevi Sampath, Yu Lei, Raghu N. Kacker, D. Richard Kuhn, James F. Lawrence
Modelling a software system is often a challenging prerequisite to automatic test case generation. Modelling the navigation structure of a dynamic web application is particularly challenging because of the presence of a large number of pages that are

A Rational Foundation for Software Metrology

January 20, 2016
Author(s)
David W. Flater, Paul E. Black, Elizabeth N. Fong, Raghu N. Kacker, Vadim Okun, Stephen S. Wood, David R. Kuhn
Much software research and practice involves ostensible measurements of software, yet little progress has been made on an SI-like metrological foundation for those measurements since the work of Gray, Hogan, et al. in 1996-2001. Given a physical object

Measuring and Specifying Combinatorial Coverage of Test Input Configurations

November 14, 2015
Author(s)
David R. Kuhn, Raghu N. Kacker, Yu Lei
A key issue in testing is how many tests are needed for a required level of coverage or fault detection. Estimates are often based on error rates in initial testing, or on code coverage. For example, tests may be run until a desired level of statement or

Combinatorial Analysis of Diagonal, Box and Greater-Than Polynomials as Packing Functions

November 1, 2015
Author(s)
Pepe Torres Jimenez, Nelson Rangel-Valdez, Raghu N. Kacker, James F. Lawrence
Packing functions (PFs) are bijections between a set of m-dimensional vectors V over N m and nonnegative integers N. PFs have several applications, e.g. in partitioning schemes or text compression. Two important categories of PFs are diagonal polynomials

Combinatorial Testing: Theory and Practice

August 18, 2015
Author(s)
David R. Kuhn, Renee Bryce, Feng Duan, Laleh Ghandehari, Yu Lei, Raghu N. Kacker
Combinatorial testing has rapidly gained favor among software testers in the past decade as improved algorithms have become available, and practical success has been demonstrated. This article reviews the theory and application of this method, focusing

Combinatorial Testing: Theory and Practice, Section 8.

August 18, 2015
Author(s)
David R. Kuhn, Renee Bryce, Feng Duan, Laleh Ghandehari, Yu Lei, Raghu N. Kacker
Additional Section to PUB ID 918448. Combinatorial testing has rapidly gained favor among software testers in the past decade as improved algorithms have become available, and practical success has been demonstrated. This article reviews the theory and

Implementing and Managing Policy Rules in Attribute Based Access Control

August 13, 2015
Author(s)
Chung Tong Hu, David F. Ferraiolo, David R. Kuhn, Raghu N. Kacker, Yu Lei
Attribute Based Access Control (ABAC) is a popular approach to enterprise-wide access control that provides flexibility suitable for today's dynamic distributed systems. ABAC controls access to objects by evaluating policy rules against the attributes of

Tower of Covering Arrays

April 25, 2015
Author(s)
Raghu N. Kacker, Jose Torres Jimenez
Covering arrays are combinatorial objects that have several practical applications, specially in the design of experiments for software and hardware testing. A covering array CA(N;t,k,v) of strength t and order v is an N×k array over Z v with the property

Introducing Combinatorial Testing in a Large Organization

April 23, 2015
Author(s)
Jon Hagar, Thomas Wissink, D. Richard Kuhn, Raghu N. Kacker
A two-year study of eight pilot projects to introduce combinatorial testing in a large aerospace corporation found that the new methods were practical, significantly lowered development costs, and improved test coverage by 20 to 50 percent.

Constraint Handling In Combinatorial Test Generation Using Forbidden Tuples

April 13, 2015
Author(s)
Raghu N. Kacker, David R. Kuhn, Yu Lei
Constraint handling is a challenging problem in combinatorial test generation. In general, there are two ways to handle constraints, i.e., constraint solving and forbidden tuples. In our early work we proposed a constraint handling approach based on

Improving IPOG’s Vertical Growth Based on a Graph Coloring Scheme

April 13, 2015
Author(s)
Raghu N. Kacker, David R. Kuhn, Yu Lei
In this paper, we show that the vertical growth phase of IPOG is optimal for t-way test generation when t = 2, but it is no longer optimal when t is greater than 2. We present an improvement that reduces the number of tests generated during vertical growth

Calibration Considerations for Mission Success

April 1, 2015
Author(s)
Raghu N. Kacker
As more and more data from different sensors, either on the same or from different platforms, are used together for studies of changes in the earth’s atmosphere and surface properties, Department of Defense applications, or for the many other applications

Combinatorial Coverage as an Aspect of Test Quality

March 31, 2015
Author(s)
David R. Kuhn, Raghu N. Kacker, Yu Lei
There are relatively few good methods for evaluating test set quality, after ensuring basic requirements traceability. Structural coverage, mutation testing, and related methods can be used if source code is available, but these approaches may entail

Obtaining a Trapezoidal Distribution

March 9, 2015
Author(s)
James F. Lawrence, Raghu N. Kacker, Ruediger Kessel
Given a most believed value for a quantity together with upper and lower possible deviations from that value, a rectangular distribution might be used to represent state-of-knowledge about the quantity. If the deviations are themselves known by probability

An Empirical Comparison of Combinatorial and Random Testing

April 4, 2014
Author(s)
Raghu N. Kacker, David R. Kuhn
Some conflicting results have been reported on the comparison between t-way combinatorial testing and random testing. In this paper, we report a new study that applies t-way and random testing to the Siemens suite. In particular, we investigate the

An Empirical Comparison of Combinatorial and Random Testing

April 1, 2014
Author(s)
Laleh Ghandehari, Jacek Czerwonka, Yu Lei, Soheil Shafiee, Raghu N. Kacker, D. Richard Kuhn
Some conflicting results have been reported on the comparison between t-way combinatorial testing and random testing. In this paper, we report a new study that applies t-way and random testing to the Siemens suite. In particular, we investigate the

Estimating Fault Detection Effectiveness

April 1, 2014
Author(s)
David R. Kuhn, Raghu N. Kacker, Yu Lei
[Poster] A t-way covering array can detect t-way faults, however they generally include other combinations beyond t-way as well. For example, a particular test set of all 5-way combinations is shown capable of detecting all seeded faults in a test program

Bootstrap Variability Studies in ROC Analysis on Large Datasets

March 19, 2014
Author(s)
Jin Chu Wu, Alvin F. Martin, Raghu N. Kacker
The nonparametric two-sample bootstrap is employed to compute uncertainties of measures in receiver operating characteristic (ROC) analysis on large datasets in areas such as biometrics, and so on. In this framework, the bootstrap variability was