44 results about "Theorem provers" patented technology

A system and method that translates sentences of natural language text into sets of axioms of formal logic that are consistent with parses resulting from NLP and acquired constraints as they accumulate. The system and method further present these axioms so as to facilitate further disambiguation of such sentences and produces axioms of formal logic suitable for processing by automated reasoning technologies, such as first-order or description logic suitable for processing by various reasoning algorithms, such as logic programs, inference engines, theorem provers, and rule-based systems.

In a system for statically analyzing a specified computer, a verification condition generator converts the program into a logical equation, called a verification condition, and inserts program flow control labels into the sub-equations of the verification condition. The flow control labels identify conditional branch points in the specified computer program. A theorem prover is applied to the logical equation to determine truth of the logical equation, and when the truth of the logical equation cannot be proved, the theorem prover generates at least one counter-example identifying one of the conditions, one or more variable values inconsistent with that condition, and any of the flow control labels for conditional branch points of the program associated with the identified variable values. A post processing module converts each counter-example into an error message that includes a program trace when the counter-example identifies one or more of the flow control labels.

System and method for formal verification of a graphical program. A graphical program comprising a plurality of interconnected nodes is created in response to input. One or more correctness assertions regarding program state of the graphical program are specified in response to user input, and a proof obligation generated based on the graphical program and the correctness assertions, which is usable by a theorem prover to determine correctness of the graphical program. The proof obligation may be generated by compiling the graphical program to generate an object-level diagram, parsing the correctness assertions to generate an intermediate logical form of the one or more correctness assertions, and analyzing the object-level diagram, the intermediate logical form, and/or semantics of the graphical programming language in which the graphical program is written to generate the proof obligation. A theorem prover may then process the proof obligation to determine whether the graphical program is correct.

Systems, methods and apparatus are provided through which in some embodiments, automata learning algorithms and techniques are implemented to generate a more complete set of scenarios for requirements based programming. More specifically, a CSP-based, syntax-oriented model construction, which requires the support of a theorem prover, is complemented by model extrapolation, via automata learning. This may support the systematic completion of the requirements, the nature of the requirement being partial, which provides focus on the most prominent scenarios. This may generalize requirement skeletons by extrapolation and may indicate by way of automatically generated traces where the requirement specification is too loose and additional information is required.

The invention discloses a CPS (Cyber Physical Systems) adaptability verification method based on Hybrid UML (Unified Modeling Language) and theorem proving, which is mainly used for solving the problem that the formal verification method is too high in theoretical property to be popularized. The method comprises the following steps of: firstly, modeling the CPS through a Hybrid UML view; transforming a Hybrid UML specification into an input-QHP (Quantitative Hybrid Program) of a theorem prover KeYmaera; in combination with the generated QHP, specifying the to-be-verified attribute in a manner of Qdl (Quantitative differential dynamic logic) formula, and then, executing automatic verification by the KeYmaera; before executing model transformation, needing to define meta models of the Hybrid UML and the QHP, while executing model transformation, firstly, eliminating the hierarchy of a top layer Mode, wherein the model obtained after transformation is named as Flat Mode, then, determining a transformation rule according to the consistency of macro semantics and meta semantics between the Flat Mode and the QHP, describing the transformation rule with the ATL (ATLAS Transformation Language), realizing the transformation from a Flat Mode model to a QHP medium model, and realizing the transformation from the QHP medium model to the QHP codes through a customized template language.

The invention discloses a theorem proving-based formal verification method. The method is applied to the field of secure operating systems. The invention aims to solve the security problem of an existing operating system. The theorem proving-based formal verification method comprises the following steps that: source codes are reconstructed; formal modeling is conducted on a function; theorem description is conducted on the function; and finally, formal certification is conducted. According to the method of the invention, the semi-automatic proving of human-computer interaction is adopted; by means of an isomorphic relationship between a type system and logic, a proof constructing process is converted into a program writing process; proof correctness check is changed into a type check problem; although a large amount of manual labor is needed to construct the proof, the method provided by the invention does not need to sacrifice the expression ability of protocols and codes, particularly logic with very strong expression ability can be used in a program to realize representation; the proof itself has display representation in a machine; the correctness of the proof itself can be automatically checked; and a verified conclusion is more credible.

The invention discloses a local sensitive program analysis method based on an abstract syntax tree and theorem proof. The local sensitive program analysis method comprises the steps of constructing the abstract syntax tree AST without syntax errors for program codes; traversing an abstract syntax tree AST of the program code, collecting a to-be-detected node and related nodes of the to-be-detectednode, forming a related logic expression of the to-be-detected node according to the to-be-detected node and related node information, and inputting the related logic expression into a theorem prover; and the theorem prover solves the to-be-detected node through the logic expression, and if an abnormal condition exists in the solved to-be-detected node value, judging that the program has a semantic defect. According to the method, by collecting the local context and the local path information of the program node, some wrong alarms are avoided, the usability is improved, semantic defect detection of the program code is achieved, and the problem that a traditional symbolic execution tool is long in time consumption for analyzing the code due to path explosion is solved.

The invention provides a method for verifying the stability of a robot fractional order PID control system by means of high-order logical theorem proving formalization method. For a robot fractional order PID controller, the method comprises the steps that a high-order logical formalized model of fractional order Laplace transformation and a high-order logical formalized model of the fractional order PID controller are established, a high-order logical formalized model of a fractional order closed-loop control system is established on this basis, and the stability of the robot fractional order PID control system is verified by means of the formalized model and theorems. According to the method, a guarantee is provided for the high reliability of the robot fractional order PID control system through formalized verification of a high-order logical theorem prover, and a firm foundation is provided for the safety of a man-machine interaction robot.

The invention discloses a Coq-based robot control system time sequence safety verification method. The method comprises the following steps of S10, abstracting system behaviors; s20, making a semanticmodel; and S30, carrying out formalization of variables, formalization of transfer rules, formalization of expected properties and verification of properties. According to the method, the problem ofverifying the time sequence safety of the embedded system based on the C language by utilizing the theorem prover is solved.

A method of using temporal logic technique to verify and validate blood safety workflows, the method includes creating a model workflow of blood supply chain process, wherein humans and machines are included as workflow constructs where involved, translating regulations governing blood safety into statements in temporal logic formula, wherein components satisfying a temporal logic formula correspond to satisfying the translated regulation, combining the translated regulations with the created blood supply chain model workflow, and validating that all translated regulations have been satisfied using a theorem prover.

The invention provides an unmanned aerial vehicle anti-interference control method based on an internal model control principle. A physical system of an unmanned aerial vehicle is considered. The intelligent control method comprises the steps of establishing an unmanned aerial vehicle dynamics model with external disturbance, building an external disturbance system, designing an unmanned aerial vehicle distributed control algorithm with external disturbance based on theoretical knowledge such as graph theory and convex analysis, further designing a Lyapunov function. The convergence of the designed algorithm is proved through the Lyapunov theorem, it is guaranteed that the state variables of the unmanned aerial vehicle converge to the target, finally the effectiveness and feasibility of the method are verified again through a numerical simulation example, and dynamic tracking of the unmanned aerial vehicle and formation of the unmanned aerial vehicle can be well achieved under the disturbance condition. The control precision of the unmanned aerial vehicle system is improved, and the method has certain practical value in both civil and military aspects.

The invention discloses a privacy protection and mean convergence control method for a multi-agent system. An intelligent agent system is easy to suffer from network attacks, and meanwhile, the problem of privacy leakage of node information exists. The method comprises the following steps of: providing a distributed network node information processing mechanism based on differential privacy to ensure the privacy of initial state values of all nodes; in combination with an event trigger control method, the initial state value of the node can be protected and the mean convergence control can be achieved under the DoS attack; graph theory knowledge and strict mathematical theorem prove that conditions for realizing convergence control when the system suffers from DoS attack are analyzed. According to the method, the situation that only differential privacy and only DoS attacks are researched is overcome, the differential privacy is combined with event trigger control, it is guaranteed that the system achieves mean convergence while privacy protection is achieved, and the influence of the DoS attacks existing in the network can be immune.

The invention relates to the technical field of adaptive non-linear control, particularly discloses a reinforcement learning optimization formation control method for random non-linear multi-agent, and designs an adaptive identifier for estimating unknown random power based on the function approximation capability of a neural network. Then, optimization control is obtained by constructing an evaluation network and executing reinforcement learning through the network; in the invention, the reinforcement learning algorithm is obtained by executing a gradient descent method on a simple positive function, and the function is designed according to the partial derivative of an HJB equation, so that the optimal control is simpler than the traditional method, and can be more conveniently applied to a random nonlinear multi-agent system; and finally, verifying from two aspects of theorem proving and computer simulation, so that the proposed optimization method can realize an expected target.

The invention discloses an automatic theorem proving method and device based on conflict deduction and a storage medium. The method comprises the following steps: when conflict deduction conditions are met, acquiring virtual clauses, unit clause sets and candidate clauses based on a first-order logic clause set S to construct a deduction clause set Q, and performing paradox separation on the Q to obtain a separation formula R; when the R is an empty clause, performing conflict analysis to obtain a learning clause, and proving a theorem when the learning clause is an empty clause; otherwise, when the R is a unit clause and meets the limiting condition, selecting a deduced clause in the S according to the R, adding the deduced clause into the Q, and continuing to select the clause in the Q for deduction; and when the R is a non-unit clause or does not meet the limiting condition, returning to the previous deduction step, and re-selecting a clause in the Q for deduction. Through the implementation of the method, different virtual clauses are flexibly selected to simplify the deduction separation, the path search space of multivariate deduction can be effectively reduced, the deduction efficiency can be improved, and the first-order logic automatic theorem proving capability of a multivariate deduction reasoning system is enhanced.

The invention discloses a finite field GF (2 ^ n) element based on a theorem prover Coq, a formal description method of operation on the finite field GF (2^n) element, and a method for carrying out formal verification on defined operation key properties. According to the invention, the strictness and reliability of the theorem prover Coq are utilized to solve the disadvantage that the previous method cannot ensure the availability of a specific operation result or a corresponding operation rule. The method mainly comprises the following steps: (1) formally defining any finite field GF(2^n) element and an operation on the GF(2^n) element in Coq, wherein the method comprises operations of addition, multiplication and multiplication inverse element solving; (2) defining an equivalence relation for judging the element equivalence of the finite field GF(2^n); (3) completing formal verification of additive properties suitable for any finite field GF(2^n) in Coq; and (4) performing formalizedverification of related properties suitable for multiplication of any finite field GF(2^n) in Coq.

The invention discloses an Android access control modeling and security analysis method based on a method B. According to the method, a formalized language B is used for stipulating and modeling security attributes and key operations in Android access control, and the security is verified through model detection. The method provides a new method for Android access control modeling and security analysis, formalized abstraction is carried out on an authority mechanism, a component entity abstraction machine is designed, a basic model is constructed, and an extension model based on a call chain,IPC tracking and a fine-grained strategy is established on the basis of the basic model. And finally, the security of the access control is analyzed according to theorem proof and a model detection result, and a practical and effective way is provided for security mechanism modeling and system security proof of the operating system.