![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Abstractions in Satisfiability Solvers
![]() Abstractions in Satisfiability SolversAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins. This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending Modern satisfiability solvers combine an elegant algorithm with clever heuristics and efficient engineering to achieve extremely high performance. I will show that the Conflict Driven Clause Learning algorithm in modern solvers has a natural characterisation in the framework of abstract interpretation. In particular, SAT solvers operate on a strict abstraction of propositional logic. This is surprising because an imprecise abstraction is used to obtain precise results. Time permitting, I will discuss how one may derive verification algorithms from satisfiability algorithms. I assume no background in either SAT solving or abstract interpretation. This talk is part of the Microsoft Research Cambridge, public talks series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsArchaeology Graduate Seminar Series Divinity Quantum condensate seminarsOther talksPoison trials, panaceas and proof: debates about testing and testimony in early modern European medicine Making Smart Decisions in Systems Design: How to Engineer Decisions in a Connected World? The potential of the non-state sector:what can be learnt from the PEAS example Virtual bargaining as a micro-foundation for communication CANCELLED - Mathematical methods in reacting flows: From spectral to Lyapunov analysis |