Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Code auditing method for particle swarm optimization based on bubble sort

A particle swarm optimization and code auditing technology, applied in the field of information security, can solve problems such as premature convergence of code auditing, and achieve the effect of fast and accurate solution

Inactive Publication Date: 2014-05-28
BEIJING SAFE CODE TECH
View PDF1 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The embodiment of the present invention provides a code audit method based on Bubble Sort (BS) particle swarm optimization, which is used to solve the problem that PSO algorithm is prone to fall into premature convergence when it is applied to path-oriented code audit

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
  • Code auditing method for particle swarm optimization based on bubble sort

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0009] Aiming at the problem that the existing PSO algorithm tends to fall into premature convergence when it is applied to path-oriented code auditing, the embodiment of the present invention retains infeasible solution information with a low degree of constraint violation based on the BS algorithm, and makes up for the problem that the optimal point is located near the boundary of the constraint, avoiding Falling into premature convergence to quickly solve the shortest path for defective codes.

[0010] like figure 1 As shown, the code audit method based on bubble sorting particle swarm optimization provided by the embodiment of the present invention includes the following steps:

[0011] Step 101, initialize the position and velocity of the particles, and set the number of iterations;

[0012] Step 102, test the path, and calculate the Manhattan fitness function value;

[0013] Step 103, for each particle, compare the current position fitness function value F(p i ) and t...

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 code auditing method for particle swarm optimization based on bubble sort. The method includes: initializing a particle swarm; testing a path and calculating a fitness function value; on the basis of using a feasible rule for constraint solution, dividing the particle swarm into feasible particles and infeasible particles, and putting the feasible particles and the infeasible particles into two vessels; retaining infeasible particles low in violation degree on the basis of the bubble sort, and putting the retained infeasible particles in the feasible particle swarm to solve the problem that a global optimal point is positioned close to a constrained boundary; finally working out a shortest path of defected codes to avoid the problem of proneness to fall into premature convergence when particle swarm optimization is applicable to code audit aiming at paths.

Description

technical field [0001] The invention belongs to the technical field of information security, in particular to path search and particle swarm optimization methods. Background technique [0002] At present, generally large-scale computer programs usually contain tens of thousands to hundreds of thousands of lines of code, and pure manual review is generally not feasible, so automated tools are often used to complete the work. Static analysis is the main application technology of code review tools. It refers to checking the correctness of the program by analyzing or checking the syntax, structure, process, interface, etc. of the source program without running the tested code, and finding out the hidden errors and Defects, such as parameter mismatches, ambiguous nested statements, wrong recursion, illegal calculations, possible null pointer references, etc. After years of development, various static analysis techniques have become relatively mature. There are many static analy...

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/36G06N3/00
Inventor 谢康王立进张玲李伟李星马艳彬徐勤
Owner BEIJING SAFE CODE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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