Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Verifying sequential equivalence using ATPG techniques
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
SAT-Based Verification without State Space Traversal
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Checking Safety Properties Using Induction and a SAT-Solver
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Verification of Synchronous Sequential Machines Based on Symbolic Execution
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Design replacements for sequential circuits
Design replacements for sequential circuits
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Sequential equivalence checking based on structural similarities
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Use of C/C++ models for architecture exploration and verification of DSPs
Proceedings of the 43rd annual Design Automation Conference
Proceedings of the 44th annual Design Automation Conference
Merging nodes under sequential observability
Proceedings of the 45th annual Design Automation Conference
Recording synthesis history for sequential verification
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Improving testability and soft-error resilience through retiming
Proceedings of the 46th Annual Design Automation Conference
Simulation-based equivalence checking between SystemC models at different levels of abstraction
Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
| Hi-index | 0.01 |
This article is a general survey of conceptual and algorithmic approaches to sequential-equivalence checking. Although this fundamental problem is very complex, recent advances in satisfiability solvers and ATPG approaches are making good headway.