Robert Merkel

Robert Merkel

Auto-generated profile, based on publicly available information

Robert Merkel

Swinburne University of Technology, Hawthorn, Australia

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
1 January 2010 in Journal of Systems and Software
Verified
Journal Article
Open access
TCTsong Yueh Chen
Tsong Yueh Chen
FKFei-Ching Kuo
Fei-Ching Kuo
RMRobert G. Merkel
Robert G. Merkel
TTT.H. Tse
T.H. Tse
Random testing is not only a useful testing technique in itself, but also plays a core role in many other testing methods. Hence, any significant improvement to random testing has an impact throughout the software testing community. Recently, Adaptive Random Testing (ART) was proposed as an effective alternative to random testing. This paper presents a synthesis of the most important research results related to ART. In the course of our research and through further reflection, we have realised how the techniques and concepts of ART can be applied in a much broader context, which we present here. We believe such ideas can be applied in a variety of areas of software testing, and even beyond software testing. Amongst these ideas, we particularly note the fundamental role of diversity in test case selection strategies. We hope this paper serves to provoke further discussions and investigations of these ideas. © 2009 Elsevier Inc. All rights reserved.postprin

27 June 2008 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
PDF file
TCTsong Yueh Chen
Tsong Yueh Chen
RMRobert Merkel
Robert Merkel
Failure patterns describe typical ways in which inputs revealing program failure are distributed across the input domain—in many cases, clustered together in contiguous regions. Based on these observations several debug testing methods have been developed. We examine the upper bound of debug testing effectiveness improvements possible through making assumptions about the shape, size and orientation of failure patterns. We consider the bounds for testing strategies with respect to minimizing the F-measure, maximizing the P-measure, and maximizing the E-measure. Surprisingly, we find that the empirically measured effectiveness of some existing methods that are not based on these assumptions is close to the theoretical upper bound of these strategies. The assumptions made to obtain the upper bound, and its further implications, are also examined.

1 December 2004 in Information and Software Technology
Verified
Journal Article
Closed access
TCT.Y. Chen
T.Y. Chen
FKF.-C. Kuo
F.-C. Kuo
RMR.G. Merkel
R.G. Merkel
SNS.P. Ng
S.P. Ng

1 May 2006 in Journal of Systems and Software
Verified
Journal Article
Closed access
TCTsong Yueh Chen
Tsong Yueh Chen
FKFei-Ching Kuo
Fei-Ching Kuo
RMRobert Merkel
Robert Merkel

1 January 2004
Verified
Conference Paper
Closed access
TCT.Y. Chen
T.Y. Chen
GEG. Eddy
G. Eddy
RMR. Merkel
R. Merkel
PWP.K. Wong
P.K. Wong
Adaptive random testing (ART) describes a family of algorithms for generating random test cases that have been experimentally demonstrated to have greater fault-detection capacity than simple random testing. We outline and demonstrate two new ART algorithms, and demonstrate experimentally that they offer similar performance advantages, with considerably lower overhead than other ART algorithms

4 September 2007 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
TCTsong Yueh Chen
Tsong Yueh Chen
RMRobert Merkel
Robert Merkel
Our paper proposes an implementable procedure for using the method of quasi-random sequences in software debug testing. In random testing, the sequence of tests (if considered as points in an -dimensional unit hypercube) will give rise to regions where there are clusters of points, as well as underpopulated regions. Quasi-random sequences, also known as low-discrepancy or low-dispersion sequences, are sequences of points in such a hypercube that are spread more evenly throughout. Based on the observation that program faults tend to lead to contiguous failure regions within a program's input domain, and that an even spread of random tests enhances the failure detection effectiveness for certain failure patterns, we examine the use of quasi-random sequences as a replacement for random sequences in automated testing. Because there are only a small number of quasi-random sequence generation algorithms, and each of them can only generate a small number of distinct sequences, the applicability of quasi-random sequences in testing real programs is severely restricted. To alleviate this problem, we examine the use of two types of randomized quasi-random sequences, which are quasi-random sequences permuted in a nondeterministic fashion in such a way as to retain their low discrepancy properties. We show that testing using randomized quasi-random sequences is often significantly more effective than random testing.