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 194

A novel measure and significance testing in data analysis of cell image segmentation

April 20, 2017
Author(s)
Jin Chu Wu, Michael W. Halter, Raghu N. Kacker, John T. Elliott, Anne L. Plant
Background: Cell image segmentation (CIS) is an essential part of quantitative imaging of biological cells. Designing a performance measure and conducting significance testing are critical for evaluating and comparing the CIS algorithms for image-based

The Impact of Data Dependency on Speaker Recognition Evaluation

February 8, 2017
Author(s)
Jin Chu Wu, Alvin F. Martin, Craig S. Greenberg, Raghu N. Kacker
The data dependency due to multiple use of the same subjects has impact on the standard error (SE) of the detection cost function (DCF) in speaker recognition evaluation. The DCF is defined as a weighted sum of the probabilities of type I and type II

Combinatorial Methods in Security Testing

October 20, 2016
Author(s)
Dimitris Simos, D. Richard Kuhn, Artemios Voyiatzis, Raghu N. Kacker
This article introduces combinatorial testing-based approaches for security testing and presents case studies and experiences. The success of the presented research program motivates further intensive research on the field of combinatorial security testing

Estimating t-way Fault Profile Evolution During Testing

August 25, 2016
Author(s)
David R. Kuhn, Raghu N. Kacker, Lei Yu
Empirical studies have shown that most software interaction faults involve one or two variables interacting, with progressively fewer triggered by three or more, and no failure has been reported involving more than six variables interacting. This paper

Evaluating the Effectiveness of BEN in Locating Different Types of Software Fault

August 4, 2016
Author(s)
Raghu N. Kacker, David R. Kuhn, Jagan Chandrasekaran, Yu Lei
Debugging or fault localization is one of the most challenging tasks during software development. Automated fault localization tools have been developed to reduce the amount of effort and time software developers have to spend on debugging. In this paper

Pseudo-exhaustive Testing of Attribute Based Access Control Rules

August 4, 2016
Author(s)
David R. Kuhn, Chung Tong Hu, David F. Ferraiolo, Raghu N. Kacker, Yu Lei
Access control typically requires translating policies or rules given in natural language into a form such as a programming language or decision table, which can be processed by an access control system. Once rules have been described in machine

Estimating t-way Fault Profile Evolution During Testing

June 10, 2016
Author(s)
Raghu N. Kacker, David R. Kuhn
Empirical studies have shown that most software interaction faults involve one or two variables interacting, with progressively fewer triggered by three or more, and no failure has been reported involving more than six variables interacting. This paper

Removing divergence of JCGM documents from the GUM (1993)

June 1, 2016
Author(s)
Raghu N. Kacker
The stated mission of the Joint Committee for Guides in Metrology (JCGM) is to maintain and promote the use of the Guide to the Expression of Uncertainty in Measurement (GUM) and the International Vocabulary of Metrology (VIM, 2nd edition). The JCGM has

Combinatorial Testing for Cybersecurity and Reliability

May 12, 2016
Author(s)
David R. Kuhn, Raghu N. Kacker, Larry Feldman, Gregory A. Witte
This bulletin focuses on NIST's combinatorial testing work. Combinatorial testing is a proven method for more effective software testing at lower cost. The key insight underlying combinatorial testing's effectiveness resulted from a series of studies by

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