IP Library Granted Patent US 7,743,352
Granted Patent B2
US 7,743,352 · App. 11/689,906 · Granted Jun 22, 2010

Computer implemented method of high-level synthesis for the efficient verification of computer software

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,743,352
App. No.
11/689,906
Granted
Jun 22, 2010
Kind
B2
Abstract

Verification friendly models for SAT-based formal verification are generated from a given high-level design wherein during construction the following guidelines are enforced: 1) No re-use of functional units and registers; 2) Minimize the use of muxes and sharing; 3) Reduce the number of control steps; 4) Avoid pipelines; 5) Chose functional units from “verification friendly” library; 6) Re-use operations; 7) Perform property-preserving slicing; 8) Support “assume” and “assert” in the language specification; and 8) Use external memory modules instead of register arrays.

Claims (12)

1. A computer-implemented method of verifying computer software comprising the steps of:

generating a verification aware model of the software using High-Level Synthesis (HLS) tools including the steps of:

prioritizing any HLS criteria wherein the criteria include: timing, area, power and verification performance; and

assigning the highest priority to the verification performance criteria irrespective of any effect that assignment has on the other criteria;

verifying the generated model using a formal verification methodology; and

outputting an indicia of correctness of the software resulting from the model verification.

2. The computer-implemented method of claim 1 wherein the generated model exhibits no re-use of functional units and registers.

3. The computer-implemented method of claim 1 wherein the generated model exhibits a minimal use of muxes and sharing.

4. The computer-implemented method of claim 1 wherein the generated model exhibits a reduced number of control steps.

5. The computer-implemented method of claim 1 wherein the generated model exhibits limited pipeline usage.

6. The computer-implemented method of claim 1 wherein the generated model uses external memory modules instead of register arrays.

7. The computer-implemented method of claim 1 wherein the generated model has a reduced number of reachable control states at each depth.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 7, 2011
From: NEC LABORATORIES AMERICA, INC.
To: NEC CORPORATION
Reel/Frame 025599/0212 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 23, 2007
From: GANAI, MALAY; GUPTA, AARTI
To: NEC LABORATORIES AMERICA, INC.
Reel/Frame 019056/0194 →