74 results about "Formal language" patented technology

Presented is a system and method for converting or translating expressions in a natural language such as English into machine executable expressions in a formal language. This translation enables a transformation from the syntactic structures of a natural language into effective algebraic forms for further exact processing. The invention utilizes algorithms employing a reduction of sequences of terms defined over an extensible lexicon into formal syntactic and semantic structures. This term reduction incorporates both syntactic type and semantic context to achieve an effective formal representation and interpretation of the meaning conveyed by any natural language expression.

A device for using information on malicious application behaviors is provided. The device includes a capability-monitoring unit that monitors application capabilities, a behavior-monitoring unit that monitors application behaviors, an mBDL-generating unit that generates a document in a formal language specifying the application capabilities and the application behaviors, and a controlling unit that controls execution of application using the formal language.

This invention comprises a series of steps which transforms one or more natural language expressions into a single, well-formed formal language representation. Each natural language expression is partially parsed into simple fragments, each of which is then associated with one or more short formal expressions. Each formal expression is constructed in such a way as to contain one or more placeholder variables, each of which is associated with one or more attributes to constrain the types of entities that each variable can potentially represent. The resulting plurality of formal expressions is then filtered for relevance within a given context, and the surviving expressions manipulated based upon a plurality of rules, which are cognizant of the attributes associated with each variable contained therein. A user is then presented with the resulting plurality of formal expressions, whereupon the user optionally selects, rejects, adds to, logically connects and otherwise manipulates each member of said plurality. When the user is satisfied that the plurality represents an intended meaning, the formal expressions are combined into a single, formal representation.

The present invention provides a system and method of producing a description of the flight intent of an aircraft expressed using a formal language. The description may be used to generate a predicted aircraft trajectory, for example by air traffic management. Rules are used in association with information provided to express the flight intent of the aircraft in a formal language. The flight intent describes a flight in terms of flight segments, and provides information of the path to be flown and how it is to be flown. The flight intent does not necessarily define unambiguously the aerodynamic configuration of the aircraft and the motion of the aircraft during the flight. The flight intent is used alongside other information to generate the aircraft intent that does describe unambiguously the aircraft's trajectory.

The present invention relates to a formal technique-based verification apparatus and method for verifying software-defined networking. In accordance with an embodiment, a formal verification apparatus for Software-Defined Networking (SDN), includes a formal language creation unit for collecting flow table information for an entire network topology in response to a request of a SDN control unit, and creating description code in a predefined formal language based on the collected flow table information. A Symbolic Transition Graph (STG) generation unit generates a symbolic transition graph using the created description code in the formal language. A verification execution unit performs verification by applying formal verification technology to the symbolic transition graph.

The invention belongs to the field of formalization methods, and discloses a blockchain system modeling and safety verification method and system based on an MSVL. The method comprises the following steps: modeling a blockchain system by using the MSVL in MC, and representing the blockchain system by a program p; describing the property of the blockchain system by using a PPTL, and expressing theproperty by a formula phi; and in the MC, adding a modeling program p of the MSVL and the property phi described by using the PPTL, and verifying the safety of the blockchain system. According to theblockchain system modeling and safety verification method based on the MSVL provided by the invention, the blockchain is modeled by using an MSVL program, and the safety property of the blockchain isdescribed by using the PPTL; the PPTL is a proposition subset of PTL, and the MSVL is an executable subset of the PTL, so that the MSVL and the PPTL can be executed in the MC in a unified mode; compared with other methods, the method does not need to use another formal languages and also does not need to call other tools and a lot of manual certifications, and only needs to provide a PPTL formulaof the property to be verified, so that the proof process is automatically completed by the MC.

Presently described is a formal language for describing the function of biochemical networks. Because it is a language, it includes a method of parsing, or understanding the language, which is a highly complex recursive algorithm. This formal language, the Cell Language, is described both informally, so that it may be written, and formally, so that it may be parsed. The Cell Language makes it possible to model all the interactions in a cell in a single diagram, with only a few representations of each molecule. The notation is compact and modular, in the sense that complex interactions composed of many subparts may be annotated with the same symbols as the simplest interactions composed of individual molecules or genes.

The invention discloses an Internet of Things protocol security automatic analysis method and system based on formal verification, and the method comprises the steps: building a security attribute needing to be satisfied by a protocol based on an Internet of Things protocol state machine, and automatically achieving the formal description of an Internet of Things protocol and the security attribute needing to be satisfied by the Internet of Things protocol; modeling attacker ability by applying two attack scenes, and formal verification being realized based on a dynamic priority strategy. According to the Internet of Things protocol security automatic analysis method based on formal verification, protocol state machines, deployed on a plurality of Internet of Things platforms, of MQTT, CoAP and AMQP protocols can be efficiently converted into formal languages, and automatic and systematic security analysis is carried out.

The invention discloses a cartoon manufacture method and device. In the invention, digital image processing technology and fractal geometry principle are used for parting off cartoon components from an image; dynamic and logic cartoon characteristics and the like are extracted according to dynamic geometry principle and combinational logic principle; moreover, a dynamic logic relationship is usedfor representing cartoon characteristics to describe the cartoons through formal languages; and then cartoon files with different styles can be manufactured and generated according to the cartoon components, the cartoon characteristics and the logic relationship. Compared with a traditional cartoon manufacture method, the invention greatly reduces the requirements on storage space, and is suitable for being realized on a wireless data transmission system with limited bandwidth and an embedded terminal with limited calculation capacity and store resources.

A test-program generator capable of implementing a methodology, based on a formal language, for scheduling system-level transactions in generated test programs. A system to be tested may be composed of multiple processors, busses, bus-bridges, shared memories, etc. The scheduling methodology is based on an exploration of scheduling abilities in a hardware system and features a Hierarchical Scheduling Language for specifying transactions and their ordering. Through a grouping hierarchy, which may also be expressed in the form of an equivalent tree, the Hierarchical Scheduling Language combines the ability to stress related logical areas of the system with the possibility of applying high-level scheduling requests. A method for generating testcases based on request-files written in the Hierarchical Scheduling Language is also presented.

The present disclosure provides a computer-implemented method of generating a description of aircraft intent expressed in a formal language that provides an unambiguous description of an aircraft's intended motion and configuration during a period of flight. A description of flight intent is parsed to provide instances of flight intent, each instance of flight intent spanning a flight segment. For each flight segment, an associated flight segment description is generated that comprises one or more instances of flight intent that describe the aircraft's motion in at least one degree of freedom of motion. Flight segment descriptions are compared with constraints and/or objectives and the associated flight segment descriptions are enriched with information describing relevant constraints and/or objectives. The enriched flight intent is converted into aircraft intent by ensuring that the flight segment descriptions close all degrees of freedom of the aircraft during the period of flight.

A formal language for specifying and implementing multicast communication, named MSIL, comprises a set of constructs that are specific to multicast communication. The language provides semantic structures for repetitive, conditional, sequential, and parallel execution. It supports message passing, is extendible and domain independent. The language is flexible enough to be used for translating high-level multicasting requirements into abstractions, as well as implementing low-level systems supporting these requirements. MSIL can also be used as a command and communication language to control node behavior for multicast communication. The requirements, syntax and semantics of MSIL, together with the ontology for multicast communication are described. A selected set of high-level requirements, for multicast network management, is analyzed to determine the corresponding MSIL specifications. A simplified QoS Manager, capable of providing multicast QoS to a restricted wireless network, has been coded in MSIL to demonstrate its suitability for system development.

The invention is directed to method of generating database encoded software for controlling operation of a data processing device. The method comprises providing a formal language specification representative of source code for the software, translating said formal language specification into data suitable for storing in database structures and in a form suitable for being queried by a database query language and storing said data in database structures of a database. The method includes using a software development tool in a software development and testing environment to manipulate the database encoded software using a database query language such as SQL and XQuery to develop new software features. The query language can also be used to control replication and/or synchronization of the database encoded software with the contents of a data processing device control program database by way of installing said control program on said device or upgrading the control program software of said device.

The invention provides a technical proposal for performing effective performance evaluation on a complex embedded system. In order to handle the performance evaluation problem of the embedded system becoming more complex, the invention provides a thought, a method and a technical proposal for performance analysis and evaluation of the complex embedded system according to a verification result after a novel interactive Markov chain (IMC) performance model is adopted to abstract the complex embedded system, an improved formal language namely action based continuous simulation language (aCSL) is adopted to describe performance specification, and IMC model detector software is utilized to automatically verify the performance specification of the embedded system. The thought is novel and practical, the method solves problems at high speed, has not high requirement on computation space, and saves computation cost, and the proposal has clear and definite process and strong operability; and the automatic verification and analysis functions of a model detector can give an accurate performance index range of the embedded system. The invention provides an accurate quantizing proposal for evaluating the complex embedded system, and has good assistance for evaluation and improvement of a development model of the embedded system.

The invention provides a knowledge graph Chinese question answer retrieval method based on a dynamic programming algorithm. The method aims at modeling the original question answering process comprising three substeps into the same process in a unified mode, the entity recognition process and the question answer retrieval process are modeled with a same model by integrating thoughts of a state machine in form language, the entity recognition process is modeled into the process of transferring the state of the system from the original state 0 to the state 1, and the question answer retrieval process is modeled into the process of transferring the state from the state 1 to the state 2. The precise and the scope of an answer are guaranteed, and the overall question answering process can be subjected to unified modeling macroscopically. In addition, the target entity transferring process in the question answering process is modeled into the state transferring process in the state machine,a transfer entity is modeled to be in an intermediate state, and a final answer is modeled to be in a termination state. On the basis, the transfer process of all the states achieves decision supporting as a whole through the dynamic programming algorithm, and meanwhile the operation efficiency of the system is guaranteed.

In certain embodiments, a method for modifying a file written in a formal language comprises: (1) parsing an input file written in a formal language to generate a data structure of the input file; (2) issuing, during generation of the data structure, one or more queries to a rule engine for evaluation of one or more rules for modifying the input file; and (3) generating the data structure according to the evaluation of the one or more rules.

The invention provides a problem solving demonstration method and apparatus. The method comprises the steps of firstly obtaining a to-be-solved problem; then, determining a problem solving method according to the problem attribute information corresponding to the problem to be solved; secondly, according to the to-be-solved question and the question solving method, generating a question solving step described by adopting a formal language; and finally, generating a problem solving dynamic picture corresponding to the problem to be solved based on the problem solving step described by adoptingthe formal language. The problem solving method is determined according to the problem attribute information corresponding to the problem to be solved; the problem solving step described by adopting the formal language is generated, and the problem solving dynamic picture corresponding to the problem to be solved is generated based on the problem solving step described by adopting the formal language, so that the corresponding problem solving dynamic picture can be automatically displayed for any given problem, the understanding of a user is facilitated, and the learning efficiency is improved.

This teaching method uses this one-two-sided learning aid, called the ONE-PAGE-BOOK, a combination of two languages in which the syntax of the target language is set up to allow the student to learn how to speak, think, write, read and understand the target language. This portable, always accessible and easy-to-use learning aid will allow the student to spontaneously communicate within 120 hours of formal language training by just following the numerical sequence found in the learning aid. This new teaching method does not require memorization, repetition or the use of grammar as the main way to teach the target language. With the use of the learning aid no additional textbooks would be needed.

The invention provides a method of testing a firewall for a communications network, and an equivalent apparatus. More specifically, the method allows a high-level firewall policy model to be defined based on input provided by a firewall administrator without specialised knowledge in mathematically formal languages. The firewall policy model represents an idealisation of the firewall under test, the firewall policy, and the network environment in which the firewall is deployed. One or more sets of test cases is generated based on the policy mode. The generated test case set includes at least one test case comprising a specification of a packet to be processed by the firewall under test and the expected outcome of processing the packet by a firewall compliant with the policy. Preferably, the generated test case set allows potential failure of the firewall under test to implement the policy correctly to be detected. The test packets specified in the test cases are subsequently provided to the firewall under test for processing. The outcome of the processing is monitored, and the observed packets compared with the expected results to determine whether the firewall under test is functioning according to the firewall policy.