Invention Grant
- Patent Title: Optimizing constraint solving by rewriting at least one bit-slice constraint
-
Application No.: US14881029Application Date: 2015-10-12
-
Publication No.: US10372856B2Publication Date: 2019-08-06
- Inventor: Ngai Ngai William Hung , Qiang Qiang , Guillermo R. Maturana , Jasvinder Singh , Dhiraj Goswami
- Applicant: Synopsys, Inc.
- Applicant Address: US CA Mountain View
- Assignee: SYNOPSYS, INC.
- Current Assignee: SYNOPSYS, INC.
- Current Assignee Address: US CA Mountain View
- Agency: Park, Vaughan, Fleming & Dowler LLP
- Agent Laxman Sahasrabuddhe
- Main IPC: G06F17/50
- IPC: G06F17/50 ; G06F17/11 ; G06F7/58

Abstract:
Methods and apparatuses are described for assigning random values to a set of random variables so that the assigned random values satisfy a set of constraints. A constraint solver can receive a set of constraints that is expected to cause performance problems when the system assigns random values to the set of random variables in a manner that satisfies the set of constraints. For example, modulo constraints and bit-slice constraints can cause the system to perform excessive backtracking when the system attempts to assign random values to the set of random variables in a manner that satisfies the set of constraints. The system can rewrite the set of constraints to obtain a new set of constraints that is expected to reduce and/or avoid the performance problems. The system can then assign random values to the set of random variables based on the new set of constraints.
Public/Granted literature
- US20160034624A1 OPTIMIZING CONSTRAINT SOLVING BY REWRITING AT LEAST ONE BIT-SLICE CONSTRAINT Public/Granted day:2016-02-04
Information query