Online form verification of executable model
A propositional formula, statement technology, applied in the field of online formal verification of executable models, which can solve problems such as error-prone, time-consuming, and error-prone test cases.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0049]Embodiments described herein relate generally to systems and methods for formal verification of executable systems, and more particularly to systems and methods for automated formal verification of executable systems against specified portions of a specification. The systems and methods employ a claims-based authentication process that is scalable to any size system and configured to operate with or without direct access to the system (ie, online or offline, respectively).
[0050] An online method using a formal verification system to generate a suite of test cases to verify specific claims from a specification. Typically, a statement is a true-false statement used to verify some property of a variable contained in a specification. Test cases are simulated by the system and the results are sent to the claim monitor for evaluation and verification of claims.
[0051] Using an offline method of formal verification systems, a set of traces representing the sequence of sys...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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