<--- Back to Details
First PageDocument Content
Theoretical computer science / Automated theorem proving / Concolic testing / Symbolic execution / KeY / Parallel computing / X86 / Type system / Algorithm / Data types / Formal methods / Computing
Date: 2014-02-15 14:07:11
Theoretical computer science
Automated theorem proving
Concolic testing
Symbolic execution
KeY
Parallel computing
X86
Type system
Algorithm
Data types
Formal methods
Computing

Unleashing M AYHEM on Binary Code Sang Kil Cha, Thanassis Avgerinos, Alexandre Rebert and David Brumley Carnegie Mellon University Pittsburgh, PA {sangkilc, thanassis, alexandre.rebert, dbrumley}@cmu.edu

Add to Reading List

Source URL: users.ece.cmu.edu

Download Document from Source Website

File Size: 386,97 KB

Share Document on Facebook

Similar Documents

Dependent Object Types Towards a foundation for Scala’s type system Nada Amin Adriaan Moors

Dependent Object Types Towards a foundation for Scala’s type system Nada Amin Adriaan Moors

DocID: 1xVKz - View Document

The Academic Failure with Alloy Alloy  Amazing Type System

The Academic Failure with Alloy Alloy Amazing Type System

DocID: 1xV4R - View Document

A Type System for Privacy Properties

A Type System for Privacy Properties

DocID: 1xTOq - View Document

A Verified Type System for CakeML Yong Kiam Tan Scott Owens  IHPC, A*STAR

A Verified Type System for CakeML Yong Kiam Tan Scott Owens IHPC, A*STAR

DocID: 1xTwi - View Document

Technical Report no. 2007:1  Integration of a Security Type System into a Program Logic Reiner H¨ahnle, Jing Pan, Philipp R¨ummer, Dennis Walter

Technical Report no. 2007:1 Integration of a Security Type System into a Program Logic Reiner H¨ahnle, Jing Pan, Philipp R¨ummer, Dennis Walter

DocID: 1vrAi - View Document