I am a researcher in University College London and I develop Boolean satisfiability algorithms (SAT-Solvers).
I am looking for an application for them and I’ve been told that SAT-Solvers are used throughout the Formal Verification process in the EDA industry, and would like to know more about it.
Could anyone tell me more about how SAT is applied to the FV process. Who uses it? Why is it used? How is it used? How much is it used? Names and numbers would be very helpful.