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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com