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

Formalized 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: 2021-05-07
EAST CHINA NORMAL UNIV
View PDF5 Cites 2 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
  • Formalized verification method of non-blocking algorithm based on memory recovery scheme
  • Formalized verification method of non-blocking algorithm based on memory recovery scheme
  • Formalized verification method of non-blocking algorithm based on memory recovery scheme

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0089] Such as figure 1 Shown is the 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 comprises the following steps:

[0090] Step A: According to the core ideas of the risk pointer scheme and the RCU synchronization mechanism, the overall design of the formal model of the non-blocking algorithm implemented by the scheme is carried out. 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 switching of each CPU is used as a sign of grace period detection, such as figure 2 As shown in , from top to bottom on the timeline, there are update threads or read threads on each CPU, and the dark rectangles represent threads related to the current grace period. Similarly, a circle represents a context switch, where ...

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 formalized verification method of a non-blocking algorithm based on a memory recovery scheme. Aiming at the memory recovery problem involved in the implementation of the non-blocking algorithm, two solutions, namely a risk pointer scheme based on a pointer and an RCU synchronization mechanism based on a time point, are analyzed, and a formalized model of the non-blocking algorithm applying the memory recovery scheme is established by using a formalized modeling language CIVL-C provided by a CIVL verification framework. The method also comprises analyzing security problems possibly occurring in a non-blocking algorithm at the same time, describing by using the same formalized verification language in combination with functions of a program, integrating a formalized model and properties into the same. cvh file, and performing formalized verification by using a CIVL verification tool; analyzing the correctness, safety and the like of the model according to a result given by a verification tool, namely whether the formalized model meets the property or not; If the verification result is correct, finishing verification, otherwise, modifying the algorithm according to a counter-example path given by the verification tool until 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 recovery scheme. Background technique [0002] With the rapid development of the Internet, software and programs have become more and more complex, and the guarantee of its correctness and security has always been the direction of efforts of the academic and industrial circles. 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 failure occurs, repairing it will affect the whole body. Limited knowledge and manpower cannot cope with this complex situation, so software engineering theory was born, which provides a set of engineering solutions for each cycle of the software development process. method to ensure software quality. However, it is also difficult to ensure that the software ...

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 Applications(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