Hello,
I am a researcher in University College London and I develop Boolean satisfiability algorithms (SAT-Solvers).
I am looking for an application for my algorithms, and I’ve been told that SAT-Solvers are used throughout the Formal Verification process in the EDA industry, and I 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.
More specifically, in essence I'd like to know the commercial potential of a SAT-Solver that can perform better than current state-of-the-art in the FV industry.
1. How do you convert a FV test problem into SAT? (from a FV perspective – I’m very familiar with De Morgan’s law, etc)
2. What types of test problems are converted into SAT? (in layman’s)
3. How many problems are ran on SAT-Solvers per month for a given chip?
4. What percentage of the EDA/FV process is taken up using SAT?
5. What are the time and costs involved in the use of SAT solvers in FV?
6. How much benefit would a new SAT-Solver give to the FV process? Given that they are 10% 'faster' than other solvers, for instance.
Regards,
Daniel |