Dramatic improvements in SAT solver technology over the last decade, and the growing need for more efficient and scalable verification solutions have fueled research in verification methods based on SAT solvers. This paper presents a survey of the latest developments in SAT-based formal verification, including incomplete methods such as
bounded model checking, and complete methods for model checking. We focus on how the surveyed techniques formulate the verification problem as a SAT problem, and how they exploit crucial aspects of a SAT solver, such as applicationspecific
heuristics and conflict-driven learning. Finally, we summarize the noteworthy achievements in this area so far, and note the major challenges in making this technology more pervasive in industrial design verification flows.