{"id":2424,"date":"2022-08-04T17:52:02","date_gmt":"2022-08-04T17:52:02","guid":{"rendered":"https:\/\/www.cs.columbia.edu\/psl\/?p=2424"},"modified":"2022-08-04T17:52:03","modified_gmt":"2022-08-04T17:52:03","slug":"velvet-a-novel-ensemble-learning-approach-to-automatically-locate-vulnerable-statements","status":"publish","type":"post","link":"http:\/\/psl.cs.columbia.edu\/2022\/08\/04\/velvet-a-novel-ensemble-learning-approach-to-automatically-locate-vulnerable-statements\/","title":{"rendered":"VELVET: a noVel Ensemble Learning approach to automatically locate VulnErable sTatements"},"content":{"rendered":"\n

Yangruibo Ding, Sahil Suneja, Yunhui Zheng, Jim Laredo, Alessandro Morari, Gail Kaiser and Baishakhi Ray. VELVET: a noVel Ensemble Learning approach to automatically locate VulnErable sTatements. 29th IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)<\/em>, Virtual, March 2022. 36.2% accepted. https:\/\/doi.org\/10.1109\/SANER53432.2022.00114<\/a> Video at https:\/\/www.youtube.com\/watch?v=caoQkTaxyYc<\/a><\/p>\n\n\n\n

Automatically locating vulnerable statements in
source code is crucial to assure software security and alleviate
developers\u2019 debugging efforts. This becomes even more important
in today\u2019s software ecosystem, where vulnerable code can flow
easily and unwittingly within and across software repositories like
GitHub. Across such millions of lines of code, traditional static
and dynamic approaches struggle to scale. Although existing
machine-learning-based approaches look promising in such a
setting, most work detects vulnerable code at a higher granularity
\u2013 at the method or file level. Thus, developers still need to inspect
a significant amount of code to locate the vulnerable statement(s)
that need to be fixed.<\/p>\n\n\n\n

This paper presents VELVET, a novel ensemble learning
approach to locate vulnerable statements. Our model combines
graph-based and sequence-based neural networks to successfully
capture the local and global context of a program graph and
effectively understand code semantics and vulnerable patterns.
To study VELVET\u2019s effectiveness, we use an off-the-shelf synthetic
dataset and a recently published real-world dataset. In the static
analysis setting, where vulnerable functions are not detected in
advance, VELVET achieves 4.5\u00d7 better performance than the
baseline static analyzers on the real-world data. For the isolated
vulnerability localization task, where we assume the vulnerability
of a function is known while the specific vulnerable statement
is unknown, we compare VELVET with several neural networks
that also attend to local and global context of code. VELVET
achieves 99.6% and 43.6% top-1 accuracy over synthetic data and
real-world data, respectively, outperforming the baseline deep
learning models by 5.3-29.0%.<\/p>\n\n\n\n

@INPROCEEDINGS{velvet,
author={Ding, Yangruibo and Suneja, Sahil and Zheng, Yunhui and Laredo, Jim and Morari, Alessandro and Kaiser, Gail and Ray, Baishakhi},
booktitle={2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)},
title={{VELVET: a noVel Ensemble Learning approach to automatically locate VulnErable sTatements}},
year={2022},
month={March},
volume={},
number={},
pages={959-970},
doi={10.1109\/SANER53432.2022.00114},
url={https:\/\/doi.org\/10.1109\/SANER53432.2022.00114},
}<\/p>\n","protected":false},"excerpt":{"rendered":"

Yangruibo Ding, Sahil Suneja, Yunhui Zheng, Jim Laredo, Alessandro Morari, Gail Kaiser and Baishakhi Ray. VELVET: a noVel Ensemble Learning approach to automatically locate VulnErable sTatements. 29th IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), Virtual, March 2022. 36.2% accepted. https:\/\/doi.org\/10.1109\/SANER53432.2022.00114 Video at https:\/\/www.youtube.com\/watch?v=caoQkTaxyYc Automatically locating vulnerable statements insource code is crucial to […]<\/p>\n","protected":false},"author":144,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":null,"categories":[3],"tags":[],"class_list":["post-2424","post","type-post","status-publish","format-standard","hentry","category-publications"],"acf":[],"thumbnail":null,"mentioned":null,"_links":{"self":[{"href":"http:\/\/psl.cs.columbia.edu\/wp-json\/wp\/v2\/posts\/2424","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/psl.cs.columbia.edu\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/psl.cs.columbia.edu\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/psl.cs.columbia.edu\/wp-json\/wp\/v2\/users\/144"}],"replies":[{"embeddable":true,"href":"http:\/\/psl.cs.columbia.edu\/wp-json\/wp\/v2\/comments?post=2424"}],"version-history":[{"count":1,"href":"http:\/\/psl.cs.columbia.edu\/wp-json\/wp\/v2\/posts\/2424\/revisions"}],"predecessor-version":[{"id":2425,"href":"http:\/\/psl.cs.columbia.edu\/wp-json\/wp\/v2\/posts\/2424\/revisions\/2425"}],"wp:attachment":[{"href":"http:\/\/psl.cs.columbia.edu\/wp-json\/wp\/v2\/media?parent=2424"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/psl.cs.columbia.edu\/wp-json\/wp\/v2\/categories?post=2424"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/psl.cs.columbia.edu\/wp-json\/wp\/v2\/tags?post=2424"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}