Unformatted text preview: scenarios early can help to avoid future backtracks. Such knowledge can be incor-porated into line #1 of the D-Alg-Recursion() shown in Algorithm 6. In particular, static and dynamic implications can be used to identify such potential conflicts, and they are used extensively to enhance the performance of the D algorithm (as Algorithm 5 D-Algorithm( C , f ) 1: initialize all gates to don’t-cares; 2: set a fault-effect ( D or D ) on line with fault f and insert it to the D-frontier; 3: J-frontier = ± ; 4: result = D-Alg-Recursion( C ); 5: if result == success then 6: print out values at the primary inputs; 7: else 8: print fault f is untestable; 9: end if...
View Full Document
- Spring '08
- Gate, The Circuit, Boolean-valued function