Back to Results
First PageMeta Content
NP-complete problems / Subgraph isomorphism problem / Maximum common subgraph isomorphism problem / Matching / Induced subgraph isomorphism problem / Graph isomorphism problem / NP-complete / Theoretical computer science / Computational complexity theory / Mathematics


BinHunt: Automatically Finding Semantic Differences in Binary Programs Debin Gao1 , Michael K. Reiter2 , and Dawn Song3 1 2
Add to Reading List

Document Date: 2013-03-28 20:19:28

Open Document

File Size: 529,88 KB

Share Result on Facebook

/

Facility

University of North Carolina / University of California / Chapel Hill / /

IndustryTerm

graph-matching algorithms / software difficult / software vendors / efficient algorithm / graph isomorphism algorithm / nd software vulnerabilities / software analysis applications / exploit-generation tool / /

NaturalFeature

Chapel Hill / /

Organization

University of California / Berkeley / University of North Carolina / /

Person

L. Chen / /

ProvinceOrState

North Carolina / California / /

Technology

backtracking algorithm / efficient algorithm / ing algorithm / graph isomorphism algorithm / graph-matching algorithms / 5.2 Backtracking Algorithm / /

SocialTag