First Page | Document Content | |
---|---|---|
![]() Date: 2006-08-26 05:21:04Mathematics Metalogic Logic in computer science Electronic design automation NP-complete problems Automated theorem proving Satisfiability Modulo Theories John Rushby Model checking Theoretical computer science Formal methods Logic | Source URL: fm.csl.sri.comDownload Document from Source WebsiteFile Size: 58,63 KBShare Document on Facebook |