Local sensitive hash-based adaptive random test method

A locally sensitive hashing and random testing technology, applied in software testing/debugging, error detection/correction, instruments, etc., can solve problems such as inaccurate results, reduced algorithm efficiency, and insufficient improvement of algorithm efficiency

Active Publication Date: 2020-06-30
JIANGSU UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When only one LSH function is generated for the input domain for calculation, if the value of w is too small, the result obtained by LSH may be very inaccurate, and even the result cannot be obtained; if the value of w is large, it may only be divided As a bucket, the algorithm is reduced to ...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Local sensitive hash-based adaptive random test method
  • Local sensitive hash-based adaptive random test method
  • Local sensitive hash-based adaptive random test method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] The present invention proposes a locality-sensitive hashing (Locality-Sensitive Hashing, LSH) based adaptive random testing method, by using the locality-sensitive hashing algorithm, put the executed test cases into a hash tree, the tree Each node corresponds to a "bucket". When calculating the minimum distance between each test case in the candidate set and the executed test case, the calculation range is reduced to a "bucket", which reduces the distance between the candidate test cases and the executed test cases in adaptive random testing. Computational overhead between executed test cases, improving time performance for adaptive random testing. The present invention mainly comprises: 1, determine the scope of input domain; 2, generate first test case randomly in input domain and execute it; 3, randomly generate k candidate test cases to form candidate test case set; 4, adopt FSCS- The ART algorithm selects the next test case, executes it and inserts it into the hash...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a local sensitive hash-based adaptive random test method. The method comprises the steps of 1, determining an input domain range; 2, randomly generating a first test case in the input domain and executing the first test case; 3, randomly generating k candidate test cases to form a candidate test case set; 4, selecting a next test case by adopting FSCS-ART, executing the next test case and inserting the next test case into the hash tree; and 5, repeatedly executing the steps 3 and 4 until m executed test cases are obtained or errors are found. 6, randomly generating k candidate test cases to form a candidate test case set; and 7, selecting a next test case by adopting an improved locality sensitive hash algorithm, executing and inserting the next test case into the hash tree. And repeating the steps 6 and 7 until a program error is found. Compared with the existing FSCS-ART, the LSH-ART provided by the invention has the advantages that in performance, the LSH-ARTis slightly similar to the FSCS-ART in low dimension, but the LSH-ART is better than the FSCS-ART in high dimension; in terms of time expenditure, the LSH-ART is less than the FSCS-ART in both low dimension and high dimension, and particularly, the time expenditure of the LSH-ART is even less than 10% of the time expenditure of the FSCS-ART under low failure rate.

Description

technical field [0001] The invention proposes an adaptive random testing method based on local sensitive hashing, which is used to improve the high-dimensional performance of the traditional FSCS-ART technology and reduce the time overhead of the traditional FSCS-ART technology, belonging to the technical field of software test automation. Background technique [0002] With the continuous expansion of the software market, the scale of software is increasing day by day, and the software functions are becoming more and more complex. How to ensure the quality of software products has become an important research focus, and software testing has undoubtedly become an important link to ensure software quality. For software testing, researchers have proposed many software testing techniques, among which random testing has received more and more attention because of its simple concept and automation. [0003] Random testing can detect errors that people can't expect (and this kind o...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F11/36
CPCG06F11/3684G06F11/3688
Inventor 黄如兵连俊龙孙伟峰
Owner JIANGSU UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products