Fetching the paper…
Reading the bibliography…
Binary code similarity approaches compare two or more pieces of binary code to identify their similarities and differences.
M. J. Rochkind, “The Source Code Control System,” IEEE Transactions on Software Engineering , no. 4, pp. 364–370, 1975
1975
Earlier work this paper cites.
W. F. Tichy, “RCS - A System for Version Control,” Software: Practice and Experience , vol. 15, no. 7, pp. 637–654, 1985
1985
Earlier work this paper cites.
C. Reichenberger, “Delta Storage for Arbitrary Non-Text Files,” in Proceedings of the 3rd ACM International Workshop on Software Configuration Management , 1991
1991
Earlier work this paper cites.
“RTPatch,” 1991, http://pocketsoft.com/rtpatch_binary_diff.html
1991
Earlier work this paper cites.
K. Coppieters, “A Cross-platform Binary Diff,” 1995
1995
Earlier work this paper cites.
S. Forrest, S. A. Hofmeyr, A. Somayaji, and T. A. Longstaff, “A sense of self for unix processes,” in IEEE Symposium on Security and Privacy . IEEE, 1996
1996
Earlier work this paper cites.
“Xdelta3,” 1998, http://xdelta.org/
1998
Earlier work this paper cites.
B. S. Baker, U. Manber, and R. Muth, “Compressing Differences of Executable Code,” in ACMSIGPLAN Workshop on Compiler Support for System Software , 1999
1999
Earlier work this paper cites.
Z. Wang, K. Pierce, and S. McFarling, “BMAT - A Binary Matching Tool,” in In Second ACM Workshop on Feedback-Directed and Dynamic Optimization , 1999
1999
Earlier work this paper cites.
A. Gionis, P. Indyk, R. Motwani et al. , “Similarity search in high dimensions via hashing,” in International Conference on Very Large Data Bases (VLDB) , 1999
1999
Earlier work this paper cites.
Z. Wang, K. Pierce, and S. McFarling, “BMAT – A Binary Matching Tool for Stale Profile Propagation,” The Journal of Instruction-Level Parallelism , vol. 2, p. 2000, 2000
2000
Earlier work this paper cites.
A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher, “Min-wise independent permutations,” Journal of Computer and System Sciences , vol. 60, no. 3, pp. 630–659, 2000
2000
Earlier work this paper cites.
“ROSE compiler infrastructure,” 2000, http://www.rosecompiler.org/
2000
Earlier work this paper cites.
V. A. Zakharov, “The Equivalence Problem for Computational Models: Decidable and Undecidable Cases,” in International Conference on Machines, Computations, and Universality , 2001
2001
Earlier work this paper cites.
A. Srivastava, A. Edwards, and H. Vo, “Vulcan: Binary Transformation In A Distributed Environment,” Tech. Rep., 2001
2001
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 Transactions on Software Engineering , vol. 28, no. 7, pp. 654–670, 2002
2002
Earlier work this paper cites.
C. B. Zilles, “Master/slave Speculative Parallelization And Approximate Code,” Univerisity of Wisconsin, USA, Tech. Rep., 2002
2002
Earlier work this paper cites.
C. Linn and S. Debray, “Obfuscation of Executable Code to Improve Resistance to Static Disassembly,” in ACM Conference on Computer and Communications Security . ACM, 2003
2003
Earlier work this paper cites.
H. Flake, “Structural comparison of executable objects,” in Detection of Intrusions and Malware & Vulnerability Assessment , 2004
2004
Earlier work this paper cites.
“Boomerang decompiler,” 2004, http://boomerang.sourceforge.net/
2004
Earlier work this paper cites.
“The LLVM Compiler Infrastructure,” 2004, http://llvm.org/
2004
Earlier work this paper cites.
C. Kruegel, E. Kirda, D. Mutz, W. Robertson, and G. Vigna, “Polymorphic Worm Detection Using Structural Information of Executables,” in Symopsium on Recent Advance in Intrusion Detection . Springer Berlin Heidelberg, 2005
2005
Earlier work this paper cites.
T. Dullien and R. Rolles, “Graph-based Comparison of Executable Objects,” in Symposium Sur La Securite Des Technologies De L’Information Et Des Communications , 2005
2005
Earlier work this paper cites.
J. Newsome, B. Karp, and D. Song, “Polygraph: Automatically generating signatures for polymorphic worms,” in IEEE Symposium on Security and Privacy , 2005
2005
Earlier work this paper cites.
G. Myles and C. Collberg, “K-gram Based Software Birthmarks,” in Symposium on Applied Computing . ACM, 2005
2005
Earlier work this paper cites.
“Pin - A Dynamic Binary Instrumentation Tool,” 2005, https://software.intel.com/en-us/articles/pin-a-dynamic-binary-instrumentation-tool
2005
Earlier work this paper cites.
D. Bruschi, L. Martignoni, and M. Monga, “Detecting Self-mutating Malware Using Control-flow Graph Matching,” in Detection of Intrusions and Malware and Vulnerability Assessment . Springer-Verlag, 2006
2006
Earlier work this paper cites.
E. Kirda, C. Kruegel, G. Banks, G. Vigna, and R. Kemmerer, “Behavior-based spyware detection.” in USENIX Security Symposium , 2006
2006
Earlier work this paper cites.
J. Kornblum, “Identifying Almost Identical Files Using Context Triggered Piecewise Hashing,” Digital Investigation , vol. 3, pp. 91–97, Sep. 2006
2006
Earlier work this paper cites.
Z. Li, M. Sanghi, Y. Chen, M.-Y. Kao, and B. Chavez, “Hamsa: Fast signature generation for zero-day polymorphic worms with provable attack resilience,” in IEEE Symposium on Security and Privacy , 2006
2006
Earlier work this paper cites.
“QEMU: an open source processor emulator,” 2006, http://www.qemu.org/
2006
Earlier work this paper cites.
S.-H. Cha, “Comprehensive Survey on Distance/Similarity Measures between Probability Density Functions,” vol. 1, 01 2007
2007
Earlier work this paper cites.
M. Christodorescu, S. Jha, and C. Kruegel, “Mining Specifications of Malicious Behavior,” in 6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on The Foundations of Software Engineering . ACM, 2007
2007
Earlier work this paper cites.
S. Choi, H. Park, H.-I. Lim, and T. Han, “A Static Birthmark of Binary Executables Based on API Call Structure,” in Asian Computing Science Conference on Advances in Computer Science: Computer and Network Security . Springer-Verlag, 2007
2007
Earlier work this paper cites.
V. Ganesh and D. L. Dill, “A Decision Procedure for Bit-vectors and Arrays,” in Conference on Computer Aided Verification . Springer-Verlag, 2007
2007
Earlier work this paper cites.
“Valgrind,” 2007, http://valgrind.org/
2007
Earlier work this paper cites.
D. Gao, M. K. Reiter, and D. Song, BinHunt: Automatically Finding Semantic Differences in Binary Programs . Springer Berlin Heidelberg, 2008
2008
Earlier work this paper cites.
Brumley, David and Poosankam, Pongsin and Song, Dawn and Zheng, Jiang, “Automatic patch-based exploit generation is possible: Techniques and implications,” in IEEE Symposium on Security and Privacy , 2008
2008
Earlier work this paper cites.
L. De Moura and N. Bjørner, “Z3: An Efficient SMT Solver,” in Conference on Tools and Algorithms for the Construction and Analysis of Systems . Springer-Verlag, 2008
2008
Earlier work this paper cites.
“Bitblaze: Binary Analysis For Computer Security,” 2008, http://bitblaze.cs.berkeley.edu/
2008
Earlier work this paper cites.
X. Hu, T.-c. Chiueh, and K. G. Shin, “Large-scale Malware Indexing Using Function-call Graphs,” in ACM Conference on Computer and Communications Security . ACM, 2009
2009
Earlier work this paper cites.
U. Bayer, P. M. Comparetti, C. Hlauschek, C. Kruegel, and E. Kirda, “Scalable, Behavior-Based Malware Clustering,” in Network and Distributed System Security Symposium , 2009
2009
Earlier work this paper cites.
G. Wicherski, “peHash: A Novel Approach to Fast Malware Clustering,” in Conference on Large-scale Exploits and Emergent Threats: Botnets, Spyware, Worms, and More . USENIX Association, 2009
2009
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 Symposium on Software Testing and Analysis . ACM, 2009
2009
Earlier work this paper cites.
L. Jiang and Z. Su, “Automatic Mining of Functionally Equivalent Code Fragments via Random Testing,” in Symposium on Software Testing and Analysis . ACM, 2009
2009
Earlier work this paper cites.
Z. Wang, X. Jiang, W. Cui, X. Wang, and M. Grace, “ReFormat: Automatic Reverse Engineering of Encrypted Messages,” in European Symposium on Research in Computer Security , 2009
2009
Cited alongside, same era.
“Dyninst: Putting the Performance in High Performance Computing,” 2009, http://www.dyninst.org/
2009
Cited alongside, same era.
S. seok Choi and S. hyuk Cha, “A survey of Binary similarity and distance measures,” Journal of Systemics, Cybernetics and Informatics , pp. 43–48, 2010
2010
Cited alongside, same era.
I. Santos, F. Brezo, J. Nieves, Y. K. Penya, B. Sanz, C. Laorden, and P. G. Bringas, “Idea: Opcode-Sequence-Based Malware Detection,” in Symposium on Engineering Secure Software and Systems . Springer Berlin Heidelberg, 2010
2010
Cited alongside, same era.
R. Perdisci, W. Lee, and N. Feamster, “Behavioral Clustering of HTTP-Based Malware and Signature Generation Using Malicious Network Traces,” in USENIX Symposium on Networked Systems Design and Implementation , 2010
Q. Feng, R. Zhou, C. Xu, Y. Cheng, B. Testa, and H. Yin, “Scalable Graph-based Bug Search for Firmware Images,” in ACM Conference on Computer and Communications Security . ACM, 2016
2016
Later among the works it cites.
M. Chandramohan, Y. Xue, Z. Xu, Y. Liu, C. Y. Cho, and H. B. K. Tan, “BinGo: Cross-architecture cross-OS Binary Search,” in International Symposium on Foundations of Software Engineering . ACM, 2016
2016
Later among the works it cites.
T. Kim, Y. R. Lee, B. Kang, and E. G. Im, “Binary executable file similarity calculation using function matching,” The Journal of Supercomputing , Dec 2016
2016
Later among the works it cites.
Y. Hu, Y. Zhang, J. Li, and D. Gu, “Cross-architecture binary semantics understanding via similar code comparison,” in Conference on Software Analysis, Evolution, and Reengineering . IEEE, 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
V. Roussev, “Data fingerprinting with similarity digests,” in IFIP International Conference on Digital Forensics . Springer, 2010
2010
Cited alongside, same era.
D. Brumley, I. Jager, T. Avgerinos, and E. J. Schwartz, “BAP: A binary analysis platform,” in Conference on Computer Aided Verification , 2011
2011
Cited alongside, same era.
M. Lindorfer, A. Di Federico, F. Maggi, P. M. Comparetti, and S. Zanero, “Lines of Malicious Code: Insights into the Malicious Software Industry,” in Annual Computer Security Applications Conference . ACM, 2012
2012
Cited alongside, same era.
M. Egele, T. Scholte, E. Kirda, and C. Kruegel, “A Survey on Automated Dynamic Malware-Analysis Techniques and Tools,” ACM computing surveys (CSUR) , vol. 44, no. 2, p. 6, 2012
2012
Cited alongside, same era.
C. Collberg, S. Martin, J. Myers, and J. Nagra, “Distributed Application Tamper Detection via Continuous Software Updates,” in 28th Annual Computer Security Applications Conference , 2012
2012
Cited alongside, same era.
B. Kang, T. Kim, H. Kwon, Y. Choi, and E. G. Im, “Malware Classification Method via Binary Content Comparison,” in Research in Applied Computation Symposium . ACM, 2012
2012
Cited alongside, same era.
W. Jin, S. Chaki, C. Cohen, A. Gurfinkel, J. Havrilla, C. Hines, and P. Narasimhan, “Binary function clustering using semantic hashes,” in International Conference on Machine Learning and Applications . IEEE, 2012
2012
Cited alongside, same era.
J. Caballero and Z. Lin, “Type Inference on Executables,” ACM Computing Surveys , vol. 48, no. 4, pp. 1–35, May 2016
2016
Later among the works it cites.
Y. Xiao, S. Cao, Z. Cao, F. Wang, F. Lin, J. Wu, and H. Bi, “Matching Similar Functions in Different Versions of a Malware,” in Trustcom/BigDataSE/ISPA, 2016 IEEE . IEEE, 2016
2016
Later among the works it cites.
N. Lageman, E. D. Kilmer, R. J. Walls, and P. D. McDaniel, “BinDNN: Resilient Function Matching Using Deep Learning,” in International Conference on Security and Privacy in Communication Systems . Springer, 2016
2016
Later among the works it cites.
S. H. Ding, B. C. Fung, and P. Charland, “Kam1N0: MapReduce-based Assembly Clone Search for Reverse Engineering,” in International Conference on Knowledge Discovery and Data Mining . ACM, 2016
2016
Later among the works it cites.
“Angr: The Binary Analysis Framework,” 2016, http://angr.io/
2016
Later among the works it cites.
H. Huang, A. M. Youssef, and M. Debbabi, “BinSequence: Fast, Accurate and Scalable Binary Code Reuse Detection,” in Asia Conference on Computer and Communications Security . ACM, 2017
2017
Later among the works it cites.
Q. Feng, M. Wang, M. Zhang, R. Zhou, A. Henderson, and H. Yin, “Extracting Conditional Formulas for Cross-Platform Bug Search,” in Asia Conference on Computer and Communications Security . ACM, 2017
2017
Later among the works it cites.
Y. David, N. Partush, and E. Yahav, “Similarity of Binaries Through Re-optimization,” in Conference on Programming Language Design and Implementation . ACM, 2017
2017
Later among the works it cites.
X. Xu, C. Liu, Q. Feng, H. Yin, L. Song, and D. Song, “Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection,” in ACM Conference on Computer and Communication Security . ACM, 2017
2017
Later among the works it cites.
Z. Xu, B. Chen, M. Chandramohan, Y. Liu, and F. Song, “SPAIN: Security Patch Analysis for Binaries Towards Understanding the Pain and Pills,” in International Conference on Software Engineering . IEEE Press, 2017
2017
Later among the works it cites.
U. Kargén and N. Shahmehri, “Towards Robust Instruction-level Trace Alignment of Binary Code,” in International Conference on Automated Software Engineering . IEEE Press, 2017
2017
Later among the works it cites.
L. Luo, J. Ming, D. Wu, P. Liu, and S. Zhu, “Semantics-based obfuscation-resilient binary code similarity comparison with applications to software and algorithm plagiarism detection,” IEEE Transactions on Software Engineering , no. 12, pp. 1157–1177, 2017
2017
Later among the works it cites.
Y. Hu, Y. Zhang, J. Li, and D. Gu, “Binary Code Clone Detection Across Architectures and Compiling Configurations,” in International Conference on Program Comprehension . IEEE Press, 2017
2017
Later among the works it cites.
L. Nouh, A. Rahimian, D. Mouheb, M. Debbabi, and A. Hanna, BinSign: Fingerprinting Binary Functions to Support Automated Analysis of Code Executables . Springer International Publishing, 2017
2017
Later among the works it cites.
P. Shirani, L. Wang, and M. Debbabi, “BinShape: Scalable and Robust Binary Library Function Identification Using Function Shape,” in Detection of Intrusions and Malware, and Vulnerability Assessment . Springer International Publishing, 2017
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 , 2017
2017
Later among the works it cites.
S. Wang and D. Wu, “In-memory Fuzzing for Binary Code Similarity Analysis,” in International Conference on Automated Software Engineering . IEEE Press, 2017
2017
Later among the works it cites.
D. Xu, J. Ming, and D. Wu, “Cryptographic Function Detection in Obfuscated Binaries via Bit-Precise Symbolic Loop Mapping,” in IEEE Symposium on Security and Privacy , 2017
2017
Later among the works it cites.
“Gartner says 8.4 billion connected things will be in use in 2017, up 31 percent from 2016,” 2017, https://www.gartner.com/newsroom/id/3598917
2017
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 Conference on Automated Software Engineering , ser. ASE 2018, 2018
2018
Later among the works it cites.
Y. David, N. Partush, and E. Yahav, “FirmUp: Precise Static Detection of Common Vulnerabilities in Firmware,” in Conference on Architectural Support for Programming Languages and Operating Systems . ACM, 2018
2018
Later among the works it cites.
P. Shirani, L. Collard, B. L. Agba, B. Lebel, M. Debbabi, L. Wang, and A. Hanna, “BINARM: Scalable and Efficient Detection of Vulnerabilities in Firmware Images of Intelligent Electronic Devices,” in Conference on Detection of Intrusions and Malware, and Vulnerability Assessment , 2018
2018
Later among the works it cites.
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 Conference on Automated Software Engineering . ACM, 2018
2018
Later among the works it cites.
H. Zhang and Z. Qian, “Precise and Accurate Patch Presence Test for Binaries,” in 27th USENIX Security Symposium , Baltimore, MD, 2018
2018
Later among the works it cites.
S. Alrabaee, P. Shirani, L. Wang, and M. Debbabi, “FOSSIL: A Resilient and Efficient System for Identifying FOSS Functions in Malware Binaries,” IEEE Transactions on Privacy and Security , vol. 21, no. 2, pp. 8:1–8:34, Jan. 2018
2018
Later among the works it cites.
“BinDiff,” 2018, https://www.zynamics.com/bindiff.html
2018
Later among the works it cites.
“Diaphora,” 2018, http://diaphora.re/
2018
Later among the works it cites.
“DarunGrim,” 2018, http://www.darungrim.org/
2018
Later among the works it cites.
I. U. Haq, S. Chica, J. Caballero, and S. Jha, “Malware Lineage in the Wild,” Elsevier Computer & Security , vol. 78, pp. 347–363, 2018
2018
Later among the works it cites.
F. Pagani, M. Dell’Amico, and D. Balzarotti, “Beyond Precision and Recall: Understanding Uses (and Misuses) of Similarity Hashes in Binary Analysis,” in Conference on Data and Application Security and Privacy . ACM, March 2018
2018
Later among the works it cites.
V. Karande, S. Chandra, Z. Lin, J. Caballero, L. Khan, and K. Hamlen, “BCD: Decomposing Binary Code Into Components Using Graph-Based Clustering,” in ACM ASIA Conference on Information, Computer and Communications Security , 2018
2018
Later among the works it cites.
“Themida,” 2018, https://www.oreans.com/themida.php/
2018
Later among the works it cites.
“VMProtect,” 2018, http://vmpsoft.com/products/vmprotect/
2018
Later among the works it cites.
“BeaEngine,” 2018, http://www.beaengine.org/
2018
Later among the works it cites.
“IDA,” 2018, https://www.hex-rays.com/products/ida/
2018
Later among the works it cites.
K. Redmond, L. Luo, and Q. Zeng, “A Cross-Architecture Instruction Embedding Model for Natural Language Processing-Inspired Binary Code Analysis,” in Workshop on Binary Analysis Research , San Diego, CA, USA, 2019
2019
Closest in time.
F. Zuo, X. Li, Z. Zhang, P. Young, L. Luo, and Q. Zeng, “Neural Machine Translation Inspired Binary Code Similarity Comparison beyond Function Pairs,” in Network and Distributed System Security Symposium , 2019
2019
Closest in time.
S. H. H. Ding, B. C. M. Fung, and P. Charland, “Asm2vec: Boosting static representation robustness for binary clone search against code obfuscation and compiler optimization,” in IEEE Symposium on Security and Privacy . San Francisco, CA: IEEE Computer Society, 2019
2019
Closest in time.
L. Massarelli, G. A. Di Luna, F. Petroni, R. Baldoni, and L. Querzoni, “SAFE: Self-Attentive Function Embeddings for Binary Similarity,” in Detection of Intrusions and Malware, and Vulnerability Assessment , 2019
2019
Closest in time.
“ReadyNAS2014 Firmware Image v6.1.6,” 2019, http://www.downloads.netgear.com/files/GDC/READYNAS-100/ReadyNASOS-6.1.6-arm.zip
2019
Closest in time.
“IDA Processor Support,” 2019, http://www.fysnet.net/newbasic.htm
2019
Closest in time.