research-article

PathART: path-sensitive adaptive random testing

Authors:

Lu ZhangAuthors Info & Claims

Internetware '13: Proceedings of the 5th Asia-Pacific Symposium on Internetware

Article No.: 23, Pages 1 - 4

https://doi.org/10.1145/2532443.2532460

Published: 23 October 2013 Publication History

Abstract

As test data widely spreading on the input domain may not thoroughly test the program's logic, in this paper, we propose an approach to generating test data widely spreading on a program's execution paths. In particular, we analyze execution paths of the program, distill constraints for executing the paths, calculate the path distance between test data according to their satisfaction for paths' constraints, and then generate test data far away from each other based on their path distance. The experimental results show that our approach significantly reduces the number of test data generated before the first fault is found.

References

[1]

Jcrasher. Availabe at http://ranger.uta.edu/csallner/jcrasher/.

[2]

T. Chen, G. Eddy, R. Merkel, and P. K. Wong. Adaptive random testing through dynamic partitioning. In Proc. QSIC, pages 79--86, 2004.

Digital Library

[3]

T. Chen and D. Huang. Adaptive random testing by localization. In Proc. APSEC, pages 292--298, 2004.

Digital Library

[4]

I. Ciupa, A. Leitner, M. Oriol, and B. Meyer. Artoo: adaptive random testing for object-oriented software. In Proc. ICSE, pages 71--80, 2008.

Digital Library

[5]

D. Hao, L. Zhang, M.-H. Liu, H. Li, and J.-S. Sun. Test-data generation guided by static defect detection. Journal of Computer Science and Technology, 24(2): 284--293, 2009.

Digital Library

[6]

J. King. Symbolic execution and program testing. Commun. ACM, 19(7): 385--394, 1976.

Digital Library

[7]

N. Kobayashi, T. Tsuchiya, and T. Kikuno. A new method for constructing pair wise covering designs for software testing. Information Processing Letters, 81(2): 85--91, 2002.

Digital Library

[8]

M.-H. Liu, Y.-F. Gao, J.-H. Liu, J.-H. Shan, L. Zhang, and J. Sun. An approach to test data generation for killing multiple mutants. In Proc. ICSM, pages 113--122, 2006.

Digital Library

[9]

I. Mak. On the effectiveness of random testing. Master's thesis, The University of Melbourne, 1997.

[10]

Y. Ni, S.-S. Hou, L. Zhang, J. Zhu, Z. Li, Q. Lan, H. Mei, and J.-S. Sun. Effective message-sequence generation for testing bpel programs. IEEE Transactions on Service Computing, 6(1): 7--19, 2013.

Digital Library

[11]

C. Nie, B. Xu, and L. Shi. A new pairwise covering test data generation algorithm for the system with many 2-level factors. Chinese Journal of Computers, 29(6): 841--848, 2006. In Chinese.

[12]

C. Pacheco, S. Lahiri, M. Ernst, and T. Ball. Feedback-directed random test generation. In Proc. ICSE, pages 75--84, 2007.

Digital Library

[13]

W. Visser, C. Pasareanu, and S. Khurshid. Test input generation with java pathfinder. In Proc. ISSTA, pages 97--107, 2004.

Digital Library

[14]

T. Xie, N. Tillmann, J. de Halleux, and W. Schulte. Fitness-guided path exploration in dynamic symbolic execution. In Proc. DSN, pages 359--368, 2009.

[15]

L. Zhang, T. Xie, L. Zhang, N. Tillmann, J. de Halleux, and H. Mei. Test generation via dynamic symbolic execution for mutation testing. In Proc. ICSM, pages 1--10, 2010.

Digital Library

Cited By

Qian RZhang QFang CYang DLi SLi BChen Z(2024)DiPri: Distance-based Seed Prioritization for Greybox FuzzingACM Transactions on Software Engineering and Methodology10.1145/3654440Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3654440
Qian RZhang QFang CChen ZBöhme MNoller YRay BSzekeres L(2023)DiPri: Distance-Based Seed Prioritization for Greybox Fuzzing (Registered Report)Proceedings of the 2nd International Fuzzing Workshop10.1145/3605157.3605172(21-30)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1145/3605157.3605172
Huang RSun WXu YChen HTowey DXia X(2021)A Survey on Adaptive Random TestingIEEE Transactions on Software Engineering10.1109/TSE.2019.294292147:10(2052-2083)Online publication date: 1-Oct-2021
https://doi.org/10.1109/TSE.2019.2942921

PathART: path-sensitive adaptive random testing
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Software defect analysis

Recommendations

Spartan: a spectral and entropy-based partial-scan and test point insertion algorithm
Improving the effectiveness of test suite reduction for user-session-based testing of web applications

Context: Test suite reduction is the problem of creating and executing a set of test cases that are smaller in size but equivalent in effectiveness to an original test suite. However, reduced suites can still be large and executing all the tests in a ...
Faster mutation testing inspired by test prioritization and reduction
ISSTA 2013: Proceedings of the 2013 International Symposium on Software Testing and Analysis

Mutation testing is a well-known but costly approach for determining test adequacy. The central idea behind the approach is to generate mutants, which are small syntactic transformations of the program under test, and then to measure for a given test ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

Internetware '13: Proceedings of the 5th Asia-Pacific Symposium on Internetware

October 2013

211 pages

ISBN:9781450323697

DOI:10.1145/2532443

Conference Chairs:
Hong Mei,
Jian Lv,
Program Chair:
Xiaoguang Mao

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

NJU: Nanjing University
CCF: China Computer Federation
Chinese Academy of Sciences

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 October 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Conference

Internetware '13

Sponsor:

NJU
CCF

Internetware '13: The Fifth Asia-Pacific Symposium on Internetware

October 23 - 24, 2013

Changsha, China

Acceptance Rates

Internetware '13 Paper Acceptance Rate 15 of 50 submissions, 30%;

Overall Acceptance Rate 55 of 111 submissions, 50%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
63
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Qian RZhang QFang CYang DLi SLi BChen Z(2024)DiPri: Distance-based Seed Prioritization for Greybox FuzzingACM Transactions on Software Engineering and Methodology10.1145/3654440Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3654440
Qian RZhang QFang CChen ZBöhme MNoller YRay BSzekeres L(2023)DiPri: Distance-Based Seed Prioritization for Greybox Fuzzing (Registered Report)Proceedings of the 2nd International Fuzzing Workshop10.1145/3605157.3605172(21-30)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1145/3605157.3605172
Huang RSun WXu YChen HTowey DXia X(2021)A Survey on Adaptive Random TestingIEEE Transactions on Software Engineering10.1109/TSE.2019.294292147:10(2052-2083)Online publication date: 1-Oct-2021
https://doi.org/10.1109/TSE.2019.2942921

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents