2015 IEEE/ACM 37th IEEE International Conference on Software Engineering 2015
DOI: 10.1109/icse.2015.148
|View full text |Cite
|
Sign up to set email alerts
|

Approximating Attack Surfaces with Stack Traces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
40
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 38 publications
(41 citation statements)
references
References 33 publications
1
40
0
Order By: Relevance
“…We now give a brief overview of these algorithms and their use in this work. 1: Random Forest is shown to be relatively better than 21 other algorithms in the study by Lessmann et al [37] and it works well on imbalanced data [38]. Breiman [39] described Random Forest as a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest.…”
Section: Machine Learning Algorithmsmentioning
confidence: 99%
“…We now give a brief overview of these algorithms and their use in this work. 1: Random Forest is shown to be relatively better than 21 other algorithms in the study by Lessmann et al [37] and it works well on imbalanced data [38]. Breiman [39] described Random Forest as a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest.…”
Section: Machine Learning Algorithmsmentioning
confidence: 99%
“…The crash features were used to approximate the attack surface and predict which parts of the software are more prone to be vulnerable. Theisen et al found that crash history is a strong indicator of vulnerabilities-48.4% of the "crashed" binaries in Windows contain 94.6% of known vulnerabilities [8], and 15.8% of the "crashed" source code files in Mozilla Firefox contain 73.6% of known vulnerabilities [29]. The advantage of this approach is that it does not require the labeling of training data.…”
Section: Unsupervised Methodsmentioning
confidence: 99%
“…Using this data, we explore four research questions to see whether HARMLESS can better resolve the aforementioned limitations of traditional VPMs: RQ1: Can human inspection effort be saved by applying HARMLESS to find a certain percentage of vulnerabilities? Simulated on the Mozilla Firefox data without prior known vulnerabilities as training data, we show that 60, 70, 80, 90, 95, 99% of the known vulnerabilities can be found by inspecting around 6,8,10,16,20, 34% of the source code files, respectively. These results show that a good amount of human effort can be saved by applying HARMLESS.…”
Section: Introductionmentioning
confidence: 94%
See 2 more Smart Citations