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

First-order logic formula program verification method and system based on SMT solver

A logic formula and program verification technology, applied in the field of computer proof, can solve the problems of unfavorable user reading and understanding, poor readability, etc., and achieve the effect of improving proof ability, reducing burden and improving credibility

Pending Publication Date: 2021-01-15
安徽中科国创高可信软件有限公司 +1
View PDF3 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When converting WhyML and Boogie to the back-end automatic theorem prover input language OCaml or SMT2 at the same time, the readability of the content of the converted proof file is poor, which is not conducive to users' reading and understanding

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
  • First-order logic formula program verification method and system based on SMT solver
  • First-order logic formula program verification method and system based on SMT solver
  • First-order logic formula program verification method and system based on SMT solver

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0062] It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

[0063] The present invention provides a first-order logic formula verification method based on an SMT solver, the method is applied to a server, and the server is connected to at least one client; comprising:

[0064] receiving a program formal verification data interaction request sent by any one of the at least one client;

[0065] Based on the obtained data verification request content, extract the first-order logic formula in the data interaction request;

[0066] Proof of solving the first-order logic formula in the above data interaction request based on the SMT solver.

[0067] The first-order logic formula verification method based on the SMT solver of the present invention realizes the automatic verification of the first-order logic formula based on the SMT solver, so that the formal verification system can ...

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 first-order logic formula program verification method and system based on an SMT solver. The method comprises the steps: receiving a program formal verification data interaction request sent by any client in at least one client; extracting a first-order logic formula in the data verification request based on the obtained data verification request content; performing satisfiability solving on the first-order logic formula in the data verification request based on an SMT solver. According to the method, automatic certification of the first-order logic formula is realized based on the SMT solver, so that the formal verification system can automatically verify the program, and the credibility of software is improved.

Description

technical field [0001] The invention relates to the technical field of computer proof methods, in particular to a first-order logic formula program verification method and system based on an SMT solver. Background technique [0002] Formal verification based on deductive reasoning is mainly used to improve the credibility of software. During the verification process of formal verification system, a large number of first-order logic formulas will be generated. By proving the correctness of the first-order logic formula, it is proved whether the behavior of the program conforms to the formal description of the programmer, and then the correctness of the program is proved. [0003] In the prior art, why3 and boogie are widely used in the field of program verification. They are mainly used as the middle layer of the program verification tool. The program verification tool converts the first-order logic formula obtained through verification into WhyML or Boogie language descripti...

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): G06F11/36G06F16/242G06F16/2453
CPCG06F11/3608G06F16/2448G06F16/24534
Inventor 王浩纪金龙都云鑫
Owner 安徽中科国创高可信软件有限公司
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