Synopsys, Inc.

Naiyong Jin

Alfred Koelbl

Roy Armoni

Sudipta Kundu

Hong Xiang Liang

Dana Fisman Ofek

A security verification system performs security verification of a circuit design. The security verification system simplifies formal security verification of the circuit design by replacing circuit blocks of the circuit with black box circuit blocks. The security verification system instruments the circuit design so that black-boxing can be performed for security verification without changing the security decision over the data paths. The security verification system uses dependence information of the inputs and outputs of the black box to connect inputs of the circuit block with outputs of the circuit block. The black-box circuit block keeps the logic inside the cone of influence of clocks and resets. The system performs security verification of the circuit design by proving a non-interference property of the instrumented circuit design.

Scalable formal security verification of circuit designs

A method and apparatus for structure analysis of a circuit design are described. In one exemplary embodiment, a functional specification of a circuit design is received, where the functional specification is defined based on a behavior layer abstraction. In addition, design codes for the circuit design are received, wherein in each design code of the design codes is defined based on the behavior layer abstraction. Furthermore, the design codes are searched, which is performed in the behavior layer abstraction, for one or more of the design codes that satisfy the functional specification. Each of the design codes that satisfy the functional specification is therefore recognized.

Sequential structure extraction by functional specification

A certain subset of temporal properties defined using local variables can be formally verified with complexity of PSPACE or less. A subset with this characteristic, referred to as a practical subset, is therefore feasible to formally verify. For example, it can be shown that temporal properties that possess an alternating automaton with no conflicts fall within a practical subset. Temporal properties are analyzed to determine whether they are a member of the practical subset. Members of the practical subset can then be feasibly formally verified.

Growing community of inventors

Shanghai, China

Naiyong Jin