发明名称 Digital circuit verification monitor
摘要 A method, a system and a computer readable medium for providing information relating to a verification of a digital circuit. The verification may be formal verification and comprise formally verifying that a plurality of formal properties is valid for a representation of the digital circuit. The method comprises replacing at least a first input value relating to the representation of the digital circuit by a first free variable, determining if at least one of the plurality of formal properties is valid or invalid after replacing the first input value by the first variable and indicating if the at least one of the plurality of formal property is valid or invalid. The use of a free or open variable that has not determined value can be directly in the description or representation of the digital circuit. It is not necessary to insert errors or to apply an error model.
申请公布号 US9032345(B2) 申请公布日期 2015.05.12
申请号 US201414228921 申请日期 2014.03.28
申请人 Onespin Solutions GmbH 发明人 Brinkmann Raik
分类号 G06F9/455;G06F17/50 主分类号 G06F9/455
代理机构 24IP Law Group 代理人 24IP Law Group ;DeWitt Timothy R
主权项 1. A method for providing information relating to the progress and quality of a verification of a digital circuit with model checking by using a computer, wherein the method verifies that a plurality (M) of assignments (si) in a set (S) of assignments are observation covered by a proven property (p) for a representation (D) of the digital circuit, each assignment (si) having a first side (li) and a second side (ri), the method comprising: a) introducing a guard input (gi) for each said assignment (si); b) introducing a free variable (vi) for each said assignment (si); c) replacing the second side (ri) of each assignment (si) with the expression gi ? ri: vi; d) making sure that for each model checking step each gi has the same value; e) adding a constraint one_hot(gl, gn) such that exactly one guard input (gi) is true and all others are false in any potential counter-example; f) checking for the existence of counter-examples (cj) for property (p); g) indicating, by using said computer, that an assignment (si) is covered when a counter-example (cj) is found where (gi) is true, that the assignment (si) is uncovered when no counter-example exists, and that the assignment (si) is uncovered for (k) model checking steps if the model checking result is inconclusive at (k) steps after hitting a resource limit; h) adding a constraint not (gi) if property (p) fails with a counter-example that makes guard input (gi) true while all other guard inputs are false; and i) iterating this process starting at f) until no more counter-examples exist, or a resource limit for model checking is reached.
地址 Munich DE