Patents by Inventor Arturo Salz
Arturo Salz has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20240427691Abstract: Operation of an integrated circuit is simulated. The simulation includes tracking propagation of taint from source data (such as sensitive information or faults) by using taint indicators. The source data is marked as “tainted” by setting a value of a corresponding taint indicator to a taint value. Propagation of the source data along signal paths in the integrated circuit is simulated. The signal paths contain elements through which the source data is propagated. Propagation of the taint from the source data is simulated by calculating values of taint indicators corresponding to signals along the signal paths. These taint indicators indicate whether the taint of the source data has propagated to the corresponding signals. The values of these taint indicators are calculated based on the elements in the signal paths and on the input signals and/or output signals for these elements.Type: ApplicationFiled: June 23, 2023Publication date: December 26, 2024Inventor: Arturo Salz
-
Patent number: 11775716Abstract: A method of capturing signals during hardware verification of a circuit design utilizes at least one field-programmable gate array (FPGA) and includes selecting, at run time and using one or more pre-compiled macros, a group of signals to be captured during verification of the circuit design and storing values of the group of signals in at least first and second random access memories disposed in the at least one FPGA. The first and second random access memories may be addressable spaces of the same random access memory.Type: GrantFiled: January 28, 2021Date of Patent: October 3, 2023Assignee: Synopsys, Inc.Inventors: Arturo Salz, Ching-Ping Chou, Jean-Philippe Colrat, Sébastien Roger Delerse, Luc Francois Vidal, Arnold Mbotchak
-
Publication number: 20210150110Abstract: A method of capturing signals during hardware verification of a circuit design utilizes at least one field-programmable gate array (FPGA) and includes selecting, at run time and using one or more pre-compiled macros, a group of signals to be captured during verification of the circuit design and storing values of the group of signals in at least first and second random access memories disposed in the at least one FPGA. The first and second random access memories may be addressable spaces of the same random access memory.Type: ApplicationFiled: January 28, 2021Publication date: May 20, 2021Inventors: Arturo SALZ, Ching-Ping Chou, Jean-Philippe Colrat, Sebastien Roger Delerse, Luc Francois Vidal, Arnold Mbotchak
-
Patent number: 10949588Abstract: A method of capturing signals during hardware verification of a circuit design utilizes at least one field-programmable gate array (FPGA) and includes selecting, at run time and using one or more pre-compiled macros, a group of signals to be captured during verification of the circuit design and storing values of the group of signals in at least first and second random access memories disposed in the at least one FPGA. The first and second random access memories may be addressable spaces of the same random access memory.Type: GrantFiled: November 10, 2017Date of Patent: March 16, 2021Assignee: SYNOPSYS, INC.Inventors: Arturo Salz, Ching-Ping Chou, Jean-Philippe Colrat, Sébastien Roger Delerse, Luc François Vidal, Arnold Mbotchak
-
Patent number: 8650513Abstract: Methods and apparatuses are described for reducing or eliminating X-pessimism in gate-level simulation and/or formal verification. A system can identify a set of reconvergent inputs of a combinational block in a gate-level design. Next, the system can determine whether or not the combinational block is expected to exhibit X-pessimism during gate-level simulation. If the combinational block is expected to exhibit X-pessimism during gate-level simulation, the system can modify the gate-level design to reduce X-pessimism during gate-level simulation. In some embodiments, the system can build a model for the gate-level design by using unique free input variables to represent sources of indeterminate values. The system can then use the model to perform formal verification.Type: GrantFiled: June 30, 2011Date of Patent: February 11, 2014Assignee: Synopsys, Inc.Inventors: Arturo Salz, Guillermo R. Maturana, In-Ho Moon, Lisa R. McIlwain
-
Patent number: 8271914Abstract: One embodiment of the present invention provides a system that simulates behavioral constructs of a register transfer level design using indeterminate values. The system may receive hardware description language code which includes a construct that behaves differently depending on the value of an expression, e.g., the construct may execute different portions of code based on the value of a control expression, or it may store data in different storage locations based on the value of an index expression, etc. In response to determining that the expression's value is indeterminate, the system can execute two or more alternatives that are controlled by the expression, and then merge the results in some prescribed way. An embodiment of the present invention can enable a user to reduce the discrepancy between the results generated by a register transfer level simulation and the results generated by the associated gate level simulation.Type: GrantFiled: March 9, 2011Date of Patent: September 18, 2012Assignee: Synopsys, Inc.Inventors: Guillermo Maturana, Arturo Salz, Joseph T. Buck
-
Publication number: 20120072876Abstract: Methods and apparatuses are described for reducing or eliminating X-pessimism in gate-level simulation and/or formal verification. A system can identify a set of reconvergent inputs of a combinational block in a gate-level design. Next, the system can determine whether or not the combinational block is expected to exhibit X-pessimism during gate-level simulation. If the combinational block is expected to exhibit X-pessimism during gate-level simulation, the system can modify the gate-level design to reduce X-pessimism during gate-level simulation. In some embodiments, the system can build a model for the gate-level design by using unique free input variables to represent sources of indeterminate values. The system can then use the model to perform formal verification.Type: ApplicationFiled: June 30, 2011Publication date: March 22, 2012Applicant: SYNOPSYS, INC.Inventors: Arturo Salz, Guillermo R. Maturana, In-Ho Moon, Lisa R. Mcllwain
-
Publication number: 20110161897Abstract: One embodiment of the present invention provides a system that simulates behavioral constructs of a register transfer level design using indeterminate values. The system may receive hardware description language code which includes a construct that behaves differently depending on the value of an expression, e.g., the construct may execute different portions of code based on the value of a control expression, or it may store data in different storage locations based on the value of an index expression, etc. In response to determining that the expression's value is indeterminate, the system can execute two or more alternatives that are controlled by the expression, and then merge the results in some prescribed way. An embodiment of the present invention can enable a user to reduce the discrepancy between the results generated by a register transfer level simulation and the results generated by the associated gate level simulation.Type: ApplicationFiled: March 9, 2011Publication date: June 30, 2011Applicant: SYNOPSYS, INC.Inventors: Guillermo Maturana, Arturo Salz, Joseph T. Buck
-
Patent number: 7934183Abstract: One embodiment of the present invention provides a system that simulates behavioral constructs of a register transfer level design using indeterminate values. The system may receive hardware description language code which includes a construct that behaves differently depending on the value of an expression, e.g., the construct may execute different portions of code based on the value of a control expression, or it may store data in different storage locations based on the value of an index expression, etc. In response to determining that the expression's value is indeterminate, the system can execute two or more alternatives that are controlled by the expression, and then merge the results in some prescribed way. An embodiment of the present invention can enable a user to reduce the discrepancy between the results generated by a register transfer level simulation and the results generated by the associated gate level simulation.Type: GrantFiled: April 25, 2008Date of Patent: April 26, 2011Assignee: Synopsys, Inc.Inventors: Guillermo Maturana, Arturo Salz, Joseph T. Buck
-
Publication number: 20090271748Abstract: One embodiment of the present invention provides a system that simulates behavioral constructs of a register transfer level design using indeterminate values. The system may receive hardware description language code which includes a construct that behaves differently depending on the value of an expression, e.g., the construct may execute different portions of code based on the value of a control expression, or it may store data in different storage locations based on the value of an index expression, etc. In response to determining that the expression's value is indeterminate, the system can execute two or more alternatives that are controlled by the expression, and then merge the results in some prescribed way. An embodiment of the present invention can enable a user to reduce the discrepancy between the results generated by a register transfer level simulation and the results generated by the associated gate level simulation.Type: ApplicationFiled: April 25, 2008Publication date: October 29, 2009Applicant: SYNOPSYS, INC.Inventors: Guillermo Maturana, Arturo Salz, Joseph T. Buck