The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
BinHunt: Automatically Finding Semantic Differences in Binary Programs
Open accessOverview
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
Symbolic execution and program testing
King, J. C. (1976) · Communications of the ACM · doi:10.1145/360248.360252 · Cited by 3,031
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
Sankoff, D., & Kruskal, J. B. (1983) · Medical Entomology and Zoology · Cited by 1,915
Obfuscation of executable code to improve resistance to static disassembly
Linn, C., & Debray, S. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948149 · Cited by 602
A Decision Procedure for Bit-Vectors and Arrays
Ganesh, V., & Dill, D. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73368-3_52 · Cited by 585
Speech discrimination by dynamic programming
Vintsyuk, T. K. (1972) · Cybernetics · doi:10.1007/bf01074755 · Cited by 431
Maximum common subgraph isomorphism algorithms for the matching of chemical structures
Raymond, J. W., & Willett, P. (2002) · Journal of Computer-Aided Molecular Design · doi:10.1023/a:1021271615909 · Cited by 424
Journal of Computer-Aided Molecular Design
(2013) · Journal of Computer-Aided Molecular Design · doi:10.1007/10822.1573-4951 · Cited by 401
Automatic Patch-Based Exploit Generation is Possible: Techniques and Implications
Brumley, D., Poosankam, P., Song, D., & Zheng, J. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.17 · Cited by 281
Self-citationA note on the derivation of maximal common subgraphs of two directed or undirected graphs
Levi, G. (1973) · Calcolo · doi:10.1007/bf02575586 · Cited by 234
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
Self-citationDing, 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
discovRE: Efficient Cross-Architecture Identification of Bugs in Binary Code
Eschweiler, S., Yakdan, K., & Gerhards-Padilla, E. (2016) · Proceedings 2016 Network and Distributed System Security Symposium · doi:10.14722/ndss.2016.23185 · Cited by 302
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
Metadata
- Authors
- Gao, D., Reiter, M. K., & Song, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008
- Pages
- 238-255
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1690253345
- Cited by
- 255
- References
- 12
- FWCI
- 4.22
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: BinHunt: Automatically Finding Semantic Differences in Binary Programs. https://app.cochat.ai/papers/10.1007/978-3-540-88625-9_16
- The paper
- Gao, D., Reiter, M. K., & Song, D. (2008). BinHunt: Automatically Finding Semantic Differences in Binary Programs. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-88625-9_16
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.