Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

39 results about "Semantic equivalence" patented technology

In computer metadata, semantic equivalence is a declaration that two data elements from different vocabularies contain data that has similar meaning.

Semantic-level protocol format inference method based on execution trace

InactiveCN103200203AEase of ensuring completenessReduce difficultyData switching networksProgram instructionGranularity
The invention provides a semantic-level protocol format inference method based on an execution trace. The semantic-level protocol format inference method is characterized in that the protocol format adopted by a message is inferred according to a binary instruction execution trace generated in message analysis. The semantic-level protocol format inference method comprises the following steps of: firstly, transferring an intermediate language: transferring the instruction execution trace of a protocol entity program in analyzing of a communication message into the form of the intermediate language; secondly, implementing dynamic taint analysis of fine granularity: carrying out the dynamic taint analysis of the fine granularity based on the execution trace in form of the intermediate language, in order to analyze the process of the protocol entity program in analyzing the message, and mastering the spread and the influence of each message byte serving as the input in the system along with the execution of a program instruction; and thirdly, inferring the semantic-level protocol format: gaining the complete protocol message format based on the characteristics of the semantic-level protocol at the analysis stage; and the working process in the intermediate language transfer stage is that a binary instruction in the execution trace is individually converted into a simple and semantic equivalence type intermediate language instruction, and an abstract execution trace based on the intermediate language is generated.
Owner:PLA UNIV OF SCI & TECH

System evaluation method, intelligent evaluation system and computer-readable storage medium

ActiveCN107862423AService level is realObjective and comprehensive systematic evaluationResourcesCommerceStatistical analysisSemantic equivalence
The invention discloses a system evaluation method, an intelligent evaluation system and a computer-readable storage medium. The method comprises a step of obtaining a conversation record generated bythe communication between an intelligent customer service system and a customer, a step of counting and analyzing a semantic equivalence probability of a question consulted by each customer, the number of rounds of conversations of each customer and a probability that the customer transfers to staff customer service to obtain statistical data, and a step of comprehensively evaluating the servicelevel of the intelligent customer service system according to the statistical data so as to obtain an evaluation result. According to the system evaluation method, the intelligent evaluation system and the computer-readable storage medium, the evaluation mode of the manually evaluating the intelligent customer service system is changed, an automated system evaluation mechanism is adopted, the objective and comprehensive systematic evaluation of the intelligent customer service system is achieved from the overall perspective of the intelligent customer service system, the subjectivity and curvelimitations of manual evaluation are avoided so as to obtain a real and effective evaluation result of the service level of the intelligent customer service system, thus the accuracy of an evaluationeffect is improved, the real service level of the intelligent customer service system is fed, and thus the evaluation efficiency is improved.
Owner:WEIKUN (SHANGHAI) TECH SERVICE CO LTD

A binary translation intermediate representation correctness test method and device based on semantic equivalence verification

The invention belongs to the technical field of computer transplantation, and particularly relates to a binary translation intermediate representation correctness testing method and device based on semantic equivalence verification, and the method comprises the steps: building a mapping rule between a source platform instruction and an intermediate representation; Performing state initialization on the intermediate representation, and constructing a test case; And for the test case, independently executing the source platform instruction and the intermediate representation respectively, and judging whether the semantics between the source platform instruction and the intermediate representation are equivalent or not according to an independent execution result. According to the invention,an intermediate code correctness test irrelevant to a specific system architecture can be realized; a black box and white box testing method is combined; The method can quickly, efficiently and accurately locate the problems existing in the binary translation intermediate representation, improves the test accuracy and efficiency, further shortens the software development test period, guarantees the software quality and reliability, and has a certain guiding significance for binary translation tests between different platforms and the computer software cross-platform transplantation technology.
Owner:PLA STRATEGIC SUPPORT FORCE INFORMATION ENG UNIV PLA SSF IEU

Credible sorting method of synchronous data flow procedures based on formal verification

The invention discloses a credible sorting method of synchronous data flow procedures based on formal verification. The credible sorting method comprises a Lustre parallel program and a serial C program obtained after sorting of the Lustre parallel program. For any two Lustre programs meeting the requirement for topological sorting, execution semantic equivalence of a Lustre program before topological sorting and a Lustre program after topological sorting is proved, and a C program after sorting and the Lustre program before sorting are equivalent in semantic execution. The credible sorting method of synchronous data flow procedures based on formal verification is developed and achieved based on a formalized language and with a 'vertex topological sorting algorithm with the in-degree as zero' as the theoretical basis. By means of the provement that any two programs meeting the topological sorting property are equivalent in serial semantic execution, during formal verification, all the situations in the process that a parallel language is converted into a serial language, each situation is proved, the program after sorting meets the topological sorting property, so that correctness of a scheme is ensured, and safety and reliability of a whole software system are improved.
Owner:CHINA TECHENERGY +1

MSVL (modeling, simulation and verification language) linear constraint system and implementation method thereof

The invention discloses an MSVL (modeling, simulation and verification language) linear constraint system and an implementation method thereof and belongs to the technical field of formal modeling and constraint solving. The MSVL linear constraint system comprises a constraint definition subsystem and a constraint solving subsystem, and the grammatical structure of every statement module in the constraint definition subsystem is applicable to semantic equivalence rules and state transition rules in the constraint solving subsystem. The implementation method of the MSVL linear constraint system includes selecting corresponding statement modules to model problems to be solved as MSVL program M, simplifying the M to be in the form of w Lambada q by utilizing the semantic equivalence rules, implementing the state program w in the current state by utilizing the state transition rules, then simplifying the time sequence program q to be in the next state to continue implementation by utilizing interstate transition rules and finally proposing a solution. Linear constraint structure is expanded in interval logic language, so that the implementation method has huge expression ability and is more convenient for solving the problems of scheduling, computer vision, combinatorial optimization and the like which relate to the linear constraint system in industrial applications.
Owner:XIDIAN UNIV

A Trusted Sorting Method for Synchronous Data Flow Programs Based on Formal Verification

The invention discloses a credible sorting method of synchronous data flow procedures based on formal verification. The credible sorting method comprises a Lustre parallel program and a serial C program obtained after sorting of the Lustre parallel program. For any two Lustre programs meeting the requirement for topological sorting, execution semantic equivalence of a Lustre program before topological sorting and a Lustre program after topological sorting is proved, and a C program after sorting and the Lustre program before sorting are equivalent in semantic execution. The credible sorting method of synchronous data flow procedures based on formal verification is developed and achieved based on a formalized language and with a 'vertex topological sorting algorithm with the in-degree as zero' as the theoretical basis. By means of the provement that any two programs meeting the topological sorting property are equivalent in serial semantic execution, during formal verification, all the situations in the process that a parallel language is converted into a serial language, each situation is proved, the program after sorting meets the topological sorting property, so that correctness of a scheme is ensured, and safety and reliability of a whole software system are improved.
Owner:CHINA TECHENERGY +1
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products