Raghu Kacker

TL;DR: This paper presents an approach to identifying failure-inducing combinations, i.e., combinations that have caused some tests to fail, and shows that this approach can effectively and efficiently identify failure- inducing combinations in benchmark programs.

TL;DR: 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.

TL;DR: This work revisits the National Institute of Standards and Technology hash function competition, which was used to develop the SHA-3 standard, and applies a new testing strategy to all available reference implementations, and develops four tests motivated by the cryptographic properties that a hash function should satisfy.

TL;DR: The experimental results show that combinatorial testing is effective in terms of detecting most of the faulty versions with a small number of tests, and the details of the modeling process are reported, which hope to shed some lights on this critical, yet often ignored step, in the combinatorially testing process.

TL;DR: In this article, the authors present an approach to fault localization that leverages the result of combinatorial testing based on a notion called failure-inducing combinations, where a combination is failureinducing if it causes any test in which it appears to fail.