Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 808

The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.

Modeling and Discovering Vulnerabilities with Code Property Graphs

Yamaguchi, Fabian, Golde, Nico, Arp, Daniel, Rieck, Konrad · 2014 · 2014 IEEE Symposium on Security and Privacy

Abstract

The vast majority of security breaches encountered today are a direct result of insecure code. Consequently, the protection of computer systems critically depends on the rigorous identification of vulnerabilities in software, a tedious and error-prone process requiring significant expertise. Unfortunately, a single flaw suffices to undermine the security of a system and thus the sheer amount of code to audit plays into the attacker's cards. In this paper, we present a method to effectively mine large amounts of source code for vulnerabilities. To this end, we introduce a novel representation of source code called a code property graph that merges concepts of classic program analysis, namely abstract syntax trees, control flow graphs and program dependence graphs, into a joint data structure. This comprehensive representation enables us to elegantly model templates for common vulnerabilities with graph traversals that, for instance, can identify buffer overflows, integer overflows, format string vulnerabilities, or memory disclosures. We implement our approach using a popular graph database and demonstrate its efficacy by identifying 18 previously unknown vulnerabilities in the source code of the Linux kernel.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/sp.2014.44

Cites

26 of 26 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 26 references

Research works printed but not linked: 21

  1. 10.1109/ICSM.1994.336777 · doi:10.1109/icsm.1994.336777
  2. 10.1145/53990.53994 · doi:10.1145/53990.53994
  3. 10.1145/512529.512539 · doi:10.1145/512529.512539
  4. 10.1109/MSP.2011.70 · doi:10.1109/msp.2011.70
  5. 10.1109/SP.2013.12 · doi:10.1109/sp.2013.12
  6. 10.1109/ACSAC.2007.27 · DOI
  7. 2002, Advances in format string exploitation, Phrack Magazine
  8. kupsch, 2009, Manual vs automated vulnerability assessment: A case study, Proc of Workshop on Managing Insider Security Threats (MIST), 83
  9. krinke, 1998, Validation of measurement software as an application of slicing and constraint solving, Information and Software Technology, 40, 661, 10.1016/S0950-5849(98)00090-1 · doi:10.1016/s0950-5849(98)00090-1
  10. woo, 2013, Scheduling blackbox mutational fuzzing, Proc of ACM Conference on Computer and Communications Security (CCS)
  11. wang, 2009, IntScope: Automatically detecting integer overflow vulnerability in x86 binary using symbolic execution, Proc of Network and Distributed System Security Symposium (NDSS)
  12. 10.1145/1029894.1029911 · doi:10.1145/1029894.1029911
  13. moore, 2013, Security flaws in universal plug and play: Unplug. Don't play, Technical Report
  14. 10.1145/2382196.2382215 · doi:10.1145/2382196.2382215
  15. oh, 2012, Recent Java exploitation trends and malware, Presentation at Black Hat Las Vegas
  16. esser, 2013, Mountain Lion/iOS vulnerabilities garage sale, Presentation at SyScan Conference
  17. eidemiller, 2012, Cwe-676 Use of Potentially Dangerous Function
  18. dekok, 2013, PScan A Limited Problem Scanner for C Source Files
  19. planet, 2010, A eulogy for format strings, Phrack Magazine
  20. chess, 2013, Rough auditing tool for security, Google Code
  21. 10.1109/52.976940 · doi:10.1109/52.976940

Cited by

Metadata

Authors
Yamaguchi, F., Golde, N., Arp, D., & Rieck, K.
Venue
2014 IEEE Symposium on Security and Privacy
Publisher
IEEE
Published
2014-05
Pages
590-604
ISSN
1081-6011 (ISSN-L)
OpenAlex
W1992114977
Cited by
808
References
26
FWCI
12.65
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.