paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Towards data-driven vulnerability prediction for requirements

面向需求的数据驱动漏洞预测
FSE Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering2018匹配度 2/10 · 论文将数据驱动方法用于需求工程阶段的漏洞预测,属于机器学习与软件安全/需求工程的交叉,但并非用户核心关注的静态分析、形式化验证、浮点程序分析、贝叶斯程序分析,也未涉及 LLM/Agent 与程序语言的交叉。引用 7 inbox
Sayem Mohammad Imtiaz, Tanmay Bhowmik
crossref: 2026-09-12

AI 速览

一句话:提出在需求工程阶段利用数据驱动方法自动预测漏洞的框架,并给出初步验证。

现有基于静态代码分析和机器学习的漏洞预测多面向实现后的代码,难以在开发早期预防漏洞。本文针对漏洞可能源于需求规格且后期修复代价高的问题,提出一种数据驱动的自动化支持框架,目标是在需求工程阶段即对需求条目进行漏洞预测。作者还给出了框架的初步演示,观察到的结果较为积极,说明该研究方向具有潜力,并为后续在需求阶段开展预防性安全分析提供了新思路。

问题
现有漏洞预测方法主要针对实现后的代码,难以在需求阶段预防漏洞;而漏洞常可追溯到需求规格,后期修复成本高。
方法
提出一个数据驱动的自动化框架,在需求工程阶段对需求进行漏洞预测,并给出初步演示。
评估
通过初步演示展示框架,并报告了积极结果,用于说明该研究思路的价值;摘要未给出详细指标或数据集。
原文摘要(Abstract)

Due to the abundance of security breaches we continue to see, the software development community is recently paying attention to a more proactive approach towards security. This includes predicting vulnerability before exploitation employing static code analysis and machine learning techniques. Such mechanisms, however, are designed to detect post-implementation vulnerabilities. As the root of a vulnerability can often be traced back to the requirement specification, and vulnerability discovered later in the development life cycle is more expensive to fix, we need additional preventive mechanisms capable of predicting vulnerability at a much earlier stage. In this paper, we propose a novel framework providing an automated support to predict vulnerabilities for a requirement as early as during requirement engineering. We further present a preliminary demonstration of our framework and the promising results we observe clearly indicate the value of this new research idea.

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot4647,
  title = {Towards data-driven vulnerability prediction for requirements},
  author = {Sayem Mohammad Imtiaz and Tanmay Bhowmik},
  booktitle = {FSE},
  year = {2018},
  doi = {10.1145/3236024.3264836}
}