Fetching the paper…
Reading the bibliography…
When reverse engineering a binary, the analyst must first understand the semantics of the binary's functions through either manual or automatic analysis.
1906
Earlier work this paper cites.
L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: Bringing order to the web.” Stanford InfoLab, Technical Report 1999-66, November 1999, previous number = SIDL-WP-1999-0120. [Online]. Available: http://ilpubs.stanford.edu:8090/422/
1999
Earlier work this paper cites.
T. Kamiya, S. Kusumoto, and K. Inoue, “Ccfinder: A multilinguistic token-based code clone detection system for large scale source code,” IEEE Trans. Softw. Eng. , vol. 28, no. 7, pp. 654–670, Jul. 2002. [Online]. Available: https://doi.org/10.1109/TSE.2002.1019480
2002
Earlier work this paper cites.
C. Lattner and V. Adve, “Llvm: A compilation framework for lifelong program analysis & transformation,” in Proceedings of the International Symposium on Code Generation and Optimization: Feedback-directed and Runtime Optimization , ser. CGO ’04. Washington, DC, USA: IEEE Computer Society, 2004. [Online]. Available: http://dl.acm.org/citation.cfm?id=977395.977673
2004
Earlier work this paper cites.
P. Royal, M. Halpin, D. Dagon, R. Edmonds, and W. Lee, “Polyunpack: Automating the hidden-code extraction of unpack-executing malware,” in Computer Security Applications Conference, 2006. ACSAC’06. 22nd Annual . IEEE, 2006, pp. 289–300
2006
Earlier work this paper cites.
L. Jiang, G. Misherghi, Z. Su, and S. Glondu, “Deckard: Scalable and accurate tree-based detection of code clones,” in Proceedings of the 29th International Conference on Software Engineering , ser. ICSE ’07. Washington, DC, USA: IEEE Computer Society, 2007, pp. 96–105. [Online]. Available: https://doi.org/10.1109/ICSE.2007.30
2007
Earlier work this paper cites.
M. G. Kang, P. Poosankam, and H. Yin, “Renovo: A hidden code extractor for packed executables,” in Proceedings of the 2007 ACM Workshop on Recurring Malcode , ser. WORM ’07. New York, NY, USA: ACM, 2007, pp. 46–53. [Online]. Available: http://doi.acm.org/10.1145/1314389.1314399
2007
Earlier work this paper cites.
N. Nethercote and J. Seward, “Valgrind: A framework for heavyweight dynamic binary instrumentation,” SIGPLAN Not. , vol. 42, no. 6, p. 89–100, Jun. 2007. [Online]. Available: https://doi.org/10.1145/1273442.1250746
2007
Earlier work this paper cites.
D. Brumley, P. Poosankam, D. Song, and J. Zheng, “Automatic patch-based exploit generation is possible: Techniques and implications,” in Proceedings of the 2008 IEEE Symposium on Security and Privacy , ser. SP ’08. Washington, DC, USA: IEEE Computer Society, 2008, pp. 143–157. [Online]. Available: https://doi.org/10.1109/SP.2008.17
2008
Earlier work this paper cites.
M. Gabel, L. Jiang, and Z. Su, “Scalable detection of semantic clones,” in Proceedings of the 30th International Conference on Software Engineering , ser. ICSE ’08. New York, NY, USA: ACM, 2008, pp. 321–330. [Online]. Available: http://doi.acm.org/10.1145/1368088.1368132
2008
Earlier work this paper cites.
A. Dinaburg, P. Royal, M. Sharif, and W. Lee, “Ether: Malware analysis via hardware virtualization extensions,” in Proceedings of the 15th ACM Conference on Computer and Communications Security , ser. CCS ’08. New York, NY, USA: ACM, 2008, pp. 51–62. [Online]. Available: http://doi.acm.org/10.1145/1455770.1455779
2008
Earlier work this paper cites.
P. Godefroid, A. Kiezun, and M. Y. Levin, “Grammar-based whitebox fuzzing,” in Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation , ser. PLDI ’08. New York, NY, USA: ACM, 2008, pp. 206–215. [Online]. Available: http://doi.acm.org/10.1145/1375581.1375607
2008
Earlier work this paper cites.
A. Sæbjørnsen, J. Willcock, T. Panas, D. Quinlan, and Z. Su, “Detecting code clones in binary executables,” in Proceedings of the Eighteenth International Symposium on Software Testing and Analysis , ser. ISSTA ’09. New York, NY, USA: ACM, 2009, pp. 117–128. [Online]. Available: http://doi.acm.org/10.1145/1572272.1572287
2009
Earlier work this paper cites.
U. Bayer, P. M. Comparetti, C. Hlauschek, C. Kruegel, and E. Kirda, “Scalable, behavior-based malware clustering.” in NDSS , vol. 9. Citeseer, 2009, pp. 8–11
2009
Earlier work this paper cites.
L. Jiang and Z. Su, “Automatic mining of functionally equivalent code fragments via random testing,” in Proceedings of the Eighteenth International Symposium on Software Testing and Analysis , ser. ISSTA ’09. New York, NY, USA: ACM, 2009, pp. 81–92. [Online]. Available: http://doi.acm.org/10.1145/1572272.1572283
2009
Earlier work this paper cites.
R. M. Stallman and G. DeveloperCommunity, Using The Gnu Compiler Collection: A Gnu Manual For Gcc Version 4.3.3 . Paramount, CA: CreateSpace, 2009
2009
Earlier work this paper cites.
J. Jang, M. Woo, and D. Brumley, “Towards automatic software lineage inference,” in Presented as part of the 22nd USENIX Security Symposium (USENIX Security 13) . Washington, D.C.: USENIX , 2013, pp. 81–96. [Online]. Available: https://www.usenix.org/conference/usenixsecurity13/technical-sessions/papers/jang
2013
Earlier work this paper cites.
R. Johnson and A. Stavrou, “Forced-path execution for android applications on x86 platforms,” in 2013 IEEE Seventh International Conference on Software Security and Reliability Companion . IEEE, 2013, pp. 188–197
2013
Earlier work this paper cites.
M. Egele, M. Woo, P. Chapman, and D. Brumley, “Blanket execution: Dynamic similarity testing for program binaries and components,” in 23rd USENIX Security Symposium ( USENIX Security 14) . San Diego, CA: USENIX Association, 2014, pp. 303–317. [Online]. Available: https://www.usenix.org/conference/usenixsecurity14/technical-sessions/presentation/egele
2014
Earlier work this paper cites.
F. Peng, Z. Deng, X. Zhang, D. Xu, Z. Lin, and Z. Su, “X-force: force-executing binary programs for security applications,” in 23rd { \{ USENIX } \} Security Symposium ( { \{ USENIX } \} Security 14) , 2014, pp. 829–844
2014
Earlier work this paper cites.
M. Allamanis, E. T. Barr, C. Bird, and C. Sutton, “Learning natural coding conventions,” in Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering . ACM, 2014, pp. 281–293
2014
Earlier work this paper cites.
A. Saebjornsen, Detecting fine-grained similarity in binaries . University of California, Davis, 2014
2014
Earlier work this paper cites.
T. Rid and B. Buchanan, “Attributing cyber attacks,” Journal of Strategic Studies , vol. 38, no. 1-2, pp. 4–37, 2015
2015
Cited alongside, same era.
J. Pewny, B. Garmany, R. Gawlik, C. Rossow, and T. Holz, “Cross-architecture bug search in binary executables,” in 2015 IEEE Symposium on Security and Privacy . IEEE, 2015, pp. 709–724
2015
Cited alongside, same era.
M. Zalewski. (2015) American fuzzy lop. [Online]. Available: http://lcamtuf.coredump.cx/afl/
2015
Cited alongside, same era.
V. Le, C. Sun, and Z. Su, “Finding deep compiler bugs via guided stochastic program mutation,” in Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ser. OOPSLA 2015. New York, NY, USA: ACM, 2015, pp. 386–399. [Online]. Available: http://doi.acm.org/10.1145/2814270.2814319
2015
Cited alongside, same era.
Y. David, N. Partush, and E. Yahav, “Similarity of binaries through re-optimization,” in ACM SIGPLAN Notices , vol. 52, no. 6. ACM, 2017, pp. 79–94
2017
Later among the works it cites.
U. Karg é n and N. Shahmehri, “Towards robust instruction-level trace alignment of binary code,” in Proceedings of the 32Nd IEEE/ACM International Conference on Automated Software Engineering , ser. ASE 2017. Piscataway, NJ, USA: IEEE Press, 2017, pp. 342–352. [Online]. Available: http://dl.acm.org/citation.cfm?id=3155562.3155608
2017
Later among the works it cites.
J. Ming, D. Xu, Y. Jiang, and D. Wu, “Binsim: Trace-based semantic binary diffing via system call sliced segment equivalence checking,” in 26th USENIX Security Symposium ( USENIX Security 17) . Vancouver, BC: USENIX Association, 2017, pp. 253–270. [Online]. Available: https://www.usenix.org/conference/usenixsecurity17/technical-sessions/presentation/ming
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Milewicz, R. Vanka, J. Tuck, D. Quinlan, and P. Pirkelbauer, “Runtime checking c programs,” in Proceedings of the 30th Annual ACM Symposium on Applied Computing . ACM, 2015, pp. 2107–2114
2015
Cited alongside, same era.
P. Junod, J. Rinaldini, J. Wehrli, and J. Michielin, “Obfuscator- LLVM – software protection for the masses,” in Proceedings of the IEEE/ACM 1st International Workshop on Software Protection, SPRO’15 , Firenze, Italy, May 19th, 2015 , B. Wyseur, Ed. IEEE, 2015, pp. 3–9
2015
Cited alongside, same era.
X. Meng and B. P. Miller, “Binary code is not easy,” in Proceedings of the 25th International Symposium on Software Testing and Analysis . ACM, 2016, pp. 24–35
2016
Cited alongside, same era.
Y. David, N. Partush, and E. Yahav, “Statistical similarity of binaries,” in Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation , ser. PLDI ’16. New York, NY, USA: ACM, 2016, pp. 266–280. [Online]. Available: http://doi.acm.org/10.1145/2908080.2908126
2016
Cited alongside, same era.
Y. Shoshitaishvili, R. Wang, C. Salls, N. Stephens, M. Polino, A. Dutcher, J. Grosen, S. Feng, C. Hauser, C. Kruegel et al. , “Sok:(state of) the art of war: Offensive techniques in binary analysis,” in 2016 IEEE Symposium on Security and Privacy (SP) . IEEE, 2016, pp. 138–157
2016
Cited alongside, same era.
G. Grieco, M. i. n. Ceresa, and P. Buiras, “Quickfuzz: An automatic random fuzzer for common file formats,” in Proceedings of the 9th International Symposium on Haskell , ser. Haskell 2016. New York, NY, USA: ACM, 2016, pp. 13–20. [Online]. Available: http://doi.acm.org/10.1145/2976002.2976017
2016
Cited alongside, same era.
S. Banescu, C. Collberg, V. Ganesh, Z. Newsham, and A. Pretschner, “Code obfuscation against symbolic execution attacks,” in Proceedings of the 32nd Annual Conference on Computer Security Applications . ACM, 2016, pp. 189–200
2016
Cited alongside, same era.
M. Chandramohan, Y. Xue, Z. Xu, Y. Liu, C. Y. Cho, and H. B. K. Tan, “Bingo: Cross-architecture cross-os binary search,” in Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering , ser. FSE 2016. New York, NY, USA: ACM, 2016, pp. 678–689. [Online]. Available: http://doi.acm.org/10.1145/2950290.2950350
2016
Cited alongside, same era.
B. Liu, W. Huo, C. Zhang, W. Li, F. Li, A. Piao, and W. Zou, “ α \alpha diff: Cross-version binary code similarity detection with dnn,” in Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering , ser. ASE 2018. New York, NY, USA: ACM, 2018, pp. 667–678. [Online]. Available: http://doi.acm.org/10.1145/3238147.3238199
2018
Later among the works it cites.
Google. (2018) Oss-fuzz. [Online]. Available: https://github.com/google/oss-fuzz
2018
Later among the works it cites.
——. (2018) honggfuzz. [Online]. Available: https://github.com/google/honggfuzz
2018
Later among the works it cites.
H. Peng, Y. Shoshitaishvili, and M. Payer, “T-fuzz: fuzzing by program transformation,” in 2018 IEEE Symposium on Security and Privacy (SP) . IEEE, 2018, pp. 697–710
2018
Later among the works it cites.
P. Chen and H. Chen, “Angora: Efficient fuzzing by principled search,” in 2018 IEEE Symposium on Security and Privacy (SP) . IEEE, 2018, pp. 711–725
2018
Later among the works it cites.
J. Gao, X. Yang, Y. Fu, Y. Jiang, and J. Sun, “Vulseeker: A semantic learning based vulnerability seeker for cross-platform binary,” in Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering , ser. ASE 2018. New York, NY, USA: ACM, 2018, pp. 896–899. [Online]. Available: http://doi.acm.org/10.1145/3238147.3240480
2018
Later among the works it cites.
H. Liu, Z. Yang, C. Liu, Y. Jiang, W. Zhao, and J. Sun, “Eclone: Detect semantic clones in ethereum via symbolic transaction sketch,” in Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering , ser. ESEC/FSE 2018. New York, NY, USA: ACM, 2018, pp. 900–903. [Online]. Available: http://doi.acm.org/10.1145/3236024.3264596
2018
Later among the works it cites.
Y. David, N. Partush, and E. Yahav, “Firmup: Precise static detection of common vulnerabilities in firmware,” in Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems . ACM, 2018, pp. 392–404
2018
Later among the works it cites.
zynamics. (2019) Bindiff. [Online]. Available: https://www.zynamics.com/bindiff.html
2019
Closest in time.
S. HexRays. (2019) Interactive disassembler. [Online]. Available: https://www.hex-rays.com/index.shtml
2019
Closest in time.
radare. (2019) radare. [Online]. Available: https://www.radare.org/r/
2019
Closest in time.
musl libc. (2019) musl libc. [Online]. Available: https://www.musl-libc.org/
2019
Closest in time.
W. Xu, H. Moon, S. Kashyap, P. Tseng, and T. Kim, “Fuzzing file systems via two-dimensional input space exploration,” in 2019 2019 IEEE Symposium on Security and Privacy (SP) , vol. 00, 2017, pp. 577–593. [Online]. Available: doi.ieeecomputersociety.org/10.1109/SP.2019.00035
2019
Closest in time.
D. Song, F. Hetzelt, D. Das, C. Spensky, Y. Na, S. Volckaert, G. Vigna, C. Kruegel, J.-P. Seifert, and M. Franz, “Periscope: An effective probing and fuzzing framework for the hardware-os boundary,” in 2019 Network and Distributed Systems Security Symposium (NDSS) . Internet Society, 2019, pp. 1–15
2019
Closest in time.
C. Aschermann, S. Schumilo, T. Blazytko, R. Gawlik, and T. Holz, “Redqueen: Fuzzing with input-to-state correspondence,” 2019. [Online]. Available: https://www.ndss-symposium.org/ndss-paper/redqueen-fuzzing-with-input-to-state-correspondence/
2019
Closest in time.
LLVM. (2019) libfuzzer. [Online]. Available: https://llvm.org/docs/LibFuzzer.html
2019
Closest in time.
P. Chen, J. Liu, and H. Chen, “Matryoshka: Fuzzing deeply nested branches,” in Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security , ser. CCS ’19. New York, NY, USA: Association for Computing Machinery, 2019, p. 499–513. [Online]. Available: https://doi.org/10.1145/3319535.3363225
2019
Closest in time.
F. Zuo, X. Li, P. Young, L. Luo, Q. Zeng, and Z. Zhang, “Neural machine translation inspired binary code similarity comparison beyond function pairs,” in Proceedings of the 2019 Network and Distributed Systems Security Symposium (NDSS) , 2019
2019
Closest in time.