Hareton Leung

Hareton Leung

Auto-generated profile, based on publicly available information

Hareton Leung

Department of Computing, The Hong Kong Polytechnic University, Hong Kong, Hong Kong Hong Kong

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

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

Representative Publications

View All Publications
1 January 2011 in ACM Computing Surveys
Verified
Journal Article
Open access
CNChanghai Nie
Changhai Nie
HLHareton Leung
Hareton Leung
Combinatorial Testing (CT) can detect failures triggered by interactions of parameters in the Software Under Test (SUT) with a covering array test suite generated by some sampling mechanisms. It has been an active field of research in the last twenty years. This article aims to review previous work on CT, highlights the evolution of CT, and identifies important issues, methods, and applications of CT, with the goal of supporting and directing future practice and research in this area. First, we present the basic concepts and notations of CT. Second, we classify the research on CT into the following categories: modeling for CT, test suite generation, constraints, failure diagnosis, prioritization, metric, evaluation, testing procedure and the application of CT. For each of the categories, we survey the motivation, key issues, solutions, and the current state of research. Then, we review the contribution from different research groups, and present the growing trend of CT research. Finally, we recommend directions for future CT research, including: (1) modeling for CT, (2) improving the existing test suite generation algorithm, (3) improving analysis of testing result, (4) exploring the application of CT to different levels of testing and additional types of systems, (5) conducting more empirical studies to fully understand limitations and strengths of CT, and (6) combining CT with other testing techniques.

30 October 2006 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
YZYuming Zhou
Yuming Zhou
HLHareton Leung
Hareton Leung
In the last decade, empirical studies on object-oriented design metrics have shown some of them to be useful for predicting the fault-proneness of classes in object-oriented software systems. This research did not, however, distinguish among faults according to the severity of impact. It would be valuable to know how object-oriented design metrics and class fault-proneness are related when fault severity is taken into account. In this paper, we use logistic regression and machine learning methods to empirically investigate the usefulness of object-oriented design metrics, specifically, a subset of the Chidamber and Kemerer suite, in predicting fault-proneness when taking fault severity into account. Our results, based on a public domain NASA data set, indicate that 1) most of these design metrics are statistically related to fault-proneness of classes across fault severity, and 2) the prediction capabilities of the investigated metrics greatly depend on the severity of faults. More specifically, these design metrics are able to predict low severity faults in fault-prone classes better than high severity faults in fault-prone classes

1 August 2007 in Journal of Systems and Software
Verified
Journal Article
Closed access
YZYuming Zhou
Yuming Zhou
HLHareton Leung
Hareton Leung

27 April 2012 in Software Testing, Verification and Reliability
Verified
Journal Article
Closed access
PDF file
BLBixin Li
Bixin Li
XSXiaobing Sun
Xiaobing Sun
HLHareton Leung
Hareton Leung
SZSai Zhang
Sai Zhang

1 April 2010 in Journal of Systems and Software
Verified
Journal Article
Closed access
YZYuming Zhou
Yuming Zhou
BXBaowen Xu
Baowen Xu
HLHareton Leung
Hareton Leung

7 January 2003
Verified
Conference Paper
Closed access
HLH.K.N. Leung
H.K.N. Leung
LWL. White
L. White