![Formal methods / Metalogic / Logic in computer science / Electronic design automation / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / Conjunctive normal form / Mathematical proof / Mathematics / Theoretical computer science / Logic Formal methods / Metalogic / Logic in computer science / Electronic design automation / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / Conjunctive normal form / Mathematical proof / Mathematics / Theoretical computer science / Logic](https://www.pdfsearch.io/img/73872810558027cffa1ba4e5f0d682bd.jpg) Date: 2009-07-21 19:11:06Formal methods Metalogic Logic in computer science Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Conjunctive normal form Mathematical proof Mathematics Theoretical computer science Logic | | Proofs and Refutations, and Z3 Leonardo de Moura and Nikolaj Bjørner Microsoft Research Abstract Z3 [3] is a state-of-the-art Satisfiability Modulo Theories (SMT) solver freely available from Microsoft Research. It solvAdd to Reading ListSource URL: research.microsoft.comDownload Document from Source Website File Size: 107,15 KBShare Document on Facebook
|