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

Formal verification method of non-blocking algorithm based on memory recovery scheme

A formal verification and memory recycling technology, applied in computing, computer-aided design, instrumentation, etc., to solve problems such as difficulty in providing test cases

Active Publication Date: 2022-07-08
EAST CHINA NORMAL UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, following the standardized development process is also difficult to ensure that the software is completely error-free, especially in the software testing phase, it is generally difficult to provide complete test cases
Especially in safety-critical systems, it is intolerable

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
  • Formal verification method of non-blocking algorithm based on memory recovery scheme
  • Formal verification method of non-blocking algorithm based on memory recovery scheme
  • Formal verification method of non-blocking algorithm based on memory recovery scheme

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0089] like figure 1 Shown is a schematic overall flow diagram of the formal verification method of the non-blocking algorithm based on the memory recycling scheme of the present invention, and the present invention includes the following steps:

[0090] Step A: According to the core idea of ​​the risk pointer scheme and the RCU synchronization mechanism, the overall design of the formal model is carried out for the non-blocking algorithm implemented by the application. The risk pointer scheme is designed based on non-blocking queues; the overall design of the RCU synchronization mechanism is based on the classic RCU scheme with multiple CPU cores, and only the context switch of each CPU is used as a sign of grace period detection, such as figure 2 As shown, the timeline is from top to bottom, and there are update threads or read threads on each CPU, where the dark rectangle represents the thread related to the current grace period. Similarly, the circles represent a context...

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 formal verification method of a non-blocking algorithm based on a memory recycling scheme. Aiming at the memory reclamation problem involved in the implementation of non-blocking algorithms, two types of solutions are analyzed—the pointer-based risk pointer scheme and the time-point-based RCU synchronization mechanism. The formal modeling language CIVL provided by the CIVL verification framework is used. ‑C establishes a formal model for the non-blocking algorithm that applies the memory recovery scheme, analyzes the possible security issues in the non-blocking algorithm, and uses the same formal verification language to describe the program’s functions, and formalizes the model and properties are integrated in the same .cvh file and formally verified using the CIVL verification tool. According to the results given by the verification tool, the correctness and security of the model are analyzed, that is, whether the formal model satisfies the properties. If the verification result is correct, the verification is completed, otherwise, the algorithm is modified according to the counterexample path given by the verification tool until the verification is completed.

Description

technical field [0001] The invention relates to the field of operating systems, in particular to a formal verification method of a non-blocking algorithm based on a memory recycling scheme. Background technique [0002] With the rapid development of the Internet, software and programs have become more and more complex, and the guarantee of their correctness and security has always been the direction of the efforts of academia and industry. As an important part of the computer and also a key core software system, the behavior of the operating system needs to be strictly and precisely defined and verified. Once a fault occurs, the repair will be affected by the whole body. Limited knowledge and manpower cannot cope with this complex situation, so the software engineering theory was born, which provides a set of engineering solutions for each cycle in the software development process. methods to ensure software quality. However, it is difficult to ensure that the software is ...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06F30/3308
CPCG06F30/3308
Inventor 郭建杨兰兰
Owner EAST CHINA NORMAL UNIV
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