A graph traversal based framework for sequential logic implication with an application to C-cycle redundancy identification

This paper presents a new graph traversal based framework for sequential logic implication called GRAPH-SIMP. Due to the prohibitive time and space cost, few previous works target the discovery of sequential indirect implications that span multiple time frames. By using an efficient graph data structure and incorporating a graph reduction step into the implication generation process, our approach provides an efficient support for sequential implication. Sequential logic implication has many useful applications, one of which is sequentially redundant fault identification. We show that sequential implications found by GRAPH SIMP allow us to find more sequential redundancies than previously reported. Results of testing our implication algorithm against ISCAS89 circuits show that high implication coverage is essential to identifying redundant faults