Check patentability & draft patents in minutes with Patsnap Eureka AI!

Method, system, and computer program product for generating automated assumption for compositional verification

A computer, finite automaton technology, applied in computer-aided design, computing, instrumentation, etc., that can solve problems such as no approximate boundaries

Inactive Publication Date: 2009-04-08
CADENCE DESIGN SYST INC
View PDF4 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the main drawback of this approach is that there is no approximate bound

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
  • Method, system, and computer program product for generating automated assumption for compositional verification
  • Method, system, and computer program product for generating automated assumption for compositional verification
  • Method, system, and computer program product for generating automated assumption for compositional verification

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] Several embodiments of the invention provide methods, systems and computer program products for generating automated hypotheses for combinatorial verification. see Figure 1A , at 152, the process begins by identifying a first set and a second set of behaviors of the electronic circuit design. The identified data will be used to characterize the design of the system (whether electronic hardware, software, or a combination of hardware and software) as a "finite automaton" (also known as a finite state machine) composed of A model of behavior composed of a finite number of states, transitions between those states, and operations.

[0023] Next, at 154, the process iteratively computes a smallest "Incomplete Deterministic Finite Automata" (IDFA) based on sampling the first and second sets of behaviors. A deterministic finite state machine is one that has one and only one transition to the next state for each pair of state and input symbol. In some cases, a finite state a...

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

Disclosed are methods, systems, and computer program products for computing an exact minimal automaton to act as an intermediate assertion in assume-guarantee reasoning. In one embodiment, the computing an exact minimal automaton is performed by using a sampling approach and a Boolean satisfiability, The methods described herein may be used as part of a tool for formal verification.

Description

Background technique [0001] In the context of hardware and software systems, software testing has been widely used to debug a system or demonstrate that the system exhibits certain characteristics. However, software testing by itself often cannot prove that a system is free of specific types of defects. And it cannot, by itself, demonstrate that a system exhibits a particular characteristic. Formal verification, on the other hand, enables the use of mathematical methods to adequately prove or disprove the correctness of software and hardware systems, thereby proving that the system of interest does not have certain defects, or exhibit certain properties. [0002] More specifically, by using abstract mathematical models, formal verification attempts to prove that a system of interest satisfies certain requirements, or that said system is capable of exhibiting certain properties or behaviors. That is, formal verification of such systems is performed by providing formal proofs ...

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): G06F17/50
CPCG06F17/504G06F30/3323
Inventor A·格普塔K·L·麦克米伦
Owner CADENCE DESIGN SYST INC
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com