<--- Back to Details
First PageDocument Content
Software engineering / Automated theorem proving / Concolic testing / Symbolic execution / KeY / X86 / Parallel computing / Function / Type system / Mathematics / Computing / Data types
Date: 2014-05-29 15:38:01
Software engineering
Automated theorem proving
Concolic testing
Symbolic execution
KeY
X86
Parallel computing
Function
Type system
Mathematics
Computing
Data types

Unleashing Mayhem on Binary Code

Add to Reading List

Source URL: users.ece.cmu.edu

Download Document from Source Website

File Size: 843,12 KB

Share Document on Facebook

Similar Documents

Input/output / Writing / Text / Typing / Traffic collision / Words per minute / Human communication / Language

Psychomotor function measured via online activity predicts motor vehicle fatality risk

DocID: 1xVY9 - View Document

2009 Edition Page 103 CHAPTER 2C. WARNING SIGNS AND OBJECT MARKERS Section 2C.01 Function of Warning Signs

DocID: 1xVTu - View Document

Computer programming / Computing / Mathematics / Theoretical computer science / Boolean algebra / Error detection and correction / Compiler construction / Hash function / Avalanche effect / Optimizing compiler / Recursion / MD5

Cryptographic Function Detection in Obfuscated Binaries via Bit-precise Symbolic Loop Mapping Dongpeng Xu The Pennsylvania State University University Park, USA Email:

DocID: 1xVGY - View Document

Computing / Computer architecture / Computer security / Software bugs / Machine code / X86 architecture / X86 instructions / Return-oriented programming / Stack buffer overflow / PaX / Shellcode / Buffer overflow

Full version of an extended abstract published in Proceedings of ACM CCS 2007, ACM Press, The Geometry of Innocent Flesh on the Bone: Return-into-libc without Function Calls (on the x86) Hovav Shacham∗ hovav@cs.

DocID: 1xVpL - View Document

Computer programming / Recursion / Mathematical logic / Software engineering / Computability theory / Theory of computation / Theoretical computer science / -recursive function / Recursive definition / Well-founded relation / Functional programming / Pattern matching

Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with very

DocID: 1xVds - View Document