Abstract
ABSTRACT Recently, automated software testing methods such as fuzzing ha ve been researched to find software vulnerabilities. The purpose of fuzzing is to disclose software vulnerabilities by p roviding a software with malformed data. In order to increase t he probability of vulnerability discovery by fuzzing, we must solv e the test suite reduction problem because the probability depends on the test case quality. In this paper, we propose a n ew method to solve the test suite reduction problem which is suitable for the long test case such as file. First, we suggested the length of test case as a measure in addition to old measures such as coverage and redundancy. Next we designed a test suite reduction algorithm using the new measure. In the experimental results, the proposed algorithm showed better perf ormance in the size and length reduction ratio of the test suit e than previous studies. Finally, results from an empirical study suggested the viability of our proposed measure and algorithm for file fuzzing.Keywords: Test Suite Reduction, File Fuzzing, Software Vulnerability접수일(2013년 3월 6일), 게재확정일(2013년 3월 18일)†주저자, mirr1004@ensec.re.kr‡교신저자, ymkim@jnu.ac.kr
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Korea Institute of Information Security and Cryptology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
