The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
discovRE: Efficient Cross-Architecture Identification of Bugs in Binary Code
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
CCFinder: a multilinguistic token-based code clone detection system for large scale source code
Kamiya, T., Kusumoto, S., & Inoue, K. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1019480 · Cited by 1,711
(1993) · doi:10.5555/313559.313789 · Cited by 998
Modeling and Discovering Vulnerabilities with Code Property Graphs
Yamaguchi, F., Golde, N., Arp, D., & Rieck, K. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.44 · Cited by 808
A graph distance metric based on the maximal common subgraph
Bunke, H., & Shearer, K. (1998) · Pattern Recognition Letters · doi:10.1016/s0167-8655(97)00179-7 · Cited by 754
Pixy: a static analysis tool for detecting Web application vulnerabilities
Jovanovic, N., Kruegel, C., & Kirda, E. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.29 · Cited by 722
Unleashing Mayhem on Binary Code
Cha, S. K., Avgerinos, T., Rebert, A., & Brumley, D. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.31 · Cited by 518
CP-Miner: a tool for finding copy-paste and related bugs in operating system code
Li, Z., Lu, S., Myagmar, S., & Zhou, Y. (2004) · Cited by 333
Recognizing functions in binaries with neural networks
Shin, E. C. R., Song, D. X., & Moazzezi, R. (2015) · USENIX Security Symposium · Cited by 322
Large-scale malware indexing using function-call graphs
Hu, X., Chiueh, T.-C., & Shin, K. G. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653736 · Cited by 312
Backtrack search algorithms and the maximal common subgraph problem
McGregor, J. J. (1982) · Software: Practice and Experience · doi:10.1002/spe.4380120103 · Cited by 297
Static disassembly of obfuscated binaries
Kruegel, C., Robertson, W., Valeur, F., & Vigna, G. (2004) · Cited by 279
BinHunt: Automatically Finding Semantic Differences in Binary Programs
Gao, D., Reiter, M. K., & Song, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88625-9_16 · Cited by 255
ReDeBug: Finding Unpatched Code Clones in Entire OS Distributions
Jang, J., Agrawal, A., & Brumley, D. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.13 · Cited by 246
Generalized vulnerability extrapolation using abstract syntax trees
Yamaguchi, F., Lottmann, M., & Rieck, K. (2012) · Proceedings of the 28th Annual Computer Security Applications Conference · doi:10.1145/2420950.2421003 · Cited by 229
Luo, L., Ming, J., Wu, D., Liu, P., & Zhu, S. (2014) · Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering · doi:10.1145/2635868.2635900 · Cited by 220
AEG: Automatic Exploit Generation
Avgerinos, T., Kil, S., Hao, B. L. T., & Brumley, D. (2018) · doi:10.1184/r1/6468296 · Cited by 202
A Generic Approach to Automatic Deobfuscation of Executable Code
Yadegari, B., Johannesmeyer, B., Whitely, B., & Debray, S. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.47 · Cited by 195
K-gram based software birthmarks
Myles, G., & Collberg, C. (2005) · Proceedings of the 2005 ACM symposium on Applied computing · doi:10.1145/1066677.1066753 · Cited by 187
Structural Comparison of Executable Objects
Flake, H. (2004) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-2007 · Cited by 182
BYTEWEIGHT: Learning to Recognize Functions in Binary Code
Bao, T., Burket, J., Woo, M., Turner, R., & Brumley, D. (2018) · Figshare · doi:10.1184/r1/6468464 · Cited by 160
WYSINWYX: What You See Is Not What You eXecute
Balakrishnan, G., Reps, T., Melski, D., & Teitelbaum, T. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69149-5_22 · Cited by 157
Nearest Neighbour Searches and the Curse of Dimensionality
MARIMONT, R. B., & SHAPIRO, M. B. (1979) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/24.1.59 · Cited by 146
Blanket Execution: Dynamic Similarity Testing for Program Binaries and Components
Egele, M., Woo, M., Chapman, P., & Brumley, D. (2018) · KiltHub Repository · doi:10.1184/r1/6468446 · Cited by 136
Tracelet-based code search in executables
David, Y., & Yahav, E. (2014) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2594291.2594343 · Cited by 134
Fast location of similar code fragments using semantic 'juice'
Lakhotia, A., Preda, M. D., & Giacobazzi, R. (2013) · doi:10.1145/2430553.2430558 · Cited by 93
Obfuscation resilient binary code reuse through trace-oriented programming
Zeng, J., Fu, Y., Miller, K. A., Lin, Z., Zhang, X., & Xu, D. (2013) · doi:10.1145/2508859.2516664 · Cited by 56
Expose: Discovering Potential Binary Code Re-use
Ng, B. H., & Prakash, A. (2013) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac.2013.83 · Cited by 45
Cited by
Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection
Xu, X., Liu, C., Feng, Q., Yin, H., Song, L., & Song, D. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134018 · Cited by 530
Ding, S. H. H., Fung, B. C. M., & Charland, P. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00003 · Cited by 438
Scalable Graph-based Bug Search for Firmware Images
Feng, Q., Zhou, R., Xu, C., Cheng, Y., Testa, B., & Yin, H. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978370 · Cited by 401
Detecting Vulnerability on IoT Device Firmware: A Survey
Feng, X., Zhu, X., Han, Q.-L., Zhou, W., Wen, S., & Xiang, Y. (2023) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.105860 · Cited by 185
A stratified approach to function fingerprinting in program binaries using diverse features
Alrabaee, S. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.116384 · Cited by 8
Metadata
- Authors
- Eschweiler, S., Yakdan, K., & Gerhards-Padilla, E.
- Venue
- Proceedings 2016 Network and Distributed System Security Symposium
- Publisher
- Internet Society
- Published
- 2016
- OpenAlex
- W2577142429
- Cited by
- 302
- References
- 28
- FWCI
- 17.08
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.