First Page | Document Content | |
---|---|---|
Date: 2012-01-21 06:40:38Theoretical computer science Logic in computer science Formal methods Mathematics Electronic design automation NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Solver Formal verification Model checking SMT | Introduction Applications SMT Solver Use Algorithms ConclusionAdd to Reading ListSource URL: user.it.uu.seDownload Document from Source WebsiteFile Size: 406,77 KBShare Document on Facebook |