Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

review: Shingled graph disassembly: Finding the undecideable path #27

Open
mewmew opened this issue Sep 10, 2019 · 0 comments
Open

review: Shingled graph disassembly: Finding the undecideable path #27

mewmew opened this issue Sep 10, 2019 · 0 comments
Assignees
@mewmew
Labels
binary lifting review

Comments

@mewmew
Copy link
Member

mewmew commented Sep 10, 2019

R. Wartell, Y. Zhou, K. W. Hamlen, and M. Kantarcioglu, Shingled graph disassembly: Finding the undecideable path, in Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 273–285, Springer, 2014.

https://personal.utdallas.edu/~kxh060100/wartell13techrep.pdf
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@mewmew mewmew

Labels
binary lifting review
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@mewmew