First Page | Document Content | |
---|---|---|
Date: 2014-05-29 15:38:01Theoretical computer science Computing Software engineering Automated theorem proving Concolic testing Formal methods Symbolic execution Parallel computing Satisfiability modulo theories KeY Symbolic X86 | Unleashing Mayhem on Binary CodeAdd to Reading ListSource URL: users.ece.cmu.eduDownload Document from Source WebsiteFile Size: 843,12 KBShare Document on Facebook |