期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到3篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
VulSCP: Automated Code Vulnerability Detection via Sequential Convolution and Parallel Attention Mechanism 认领 引用
1
作者 Zhe Wang Yu Yan +3 位作者 Junqi Tong Yijun Lin Dechun Yin Xiaoliang Zhao 《Computers, Materials & Continua》 SCIE EI 2026年第8期1057-1081,共25页
As software applications grow increasingly large and complex,traditional code vulnerability detection methods struggle with performance and efficiency.Although code visualization-based algorithms have demonstrated eff... As software applications grow increasingly large and complex,traditional code vulnerability detection methods struggle with performance and efficiency.Although code visualization-based algorithms have demonstrated effectiveness in capturing sparse features and complex workflows in large-scale source code,their capacity to extract global semantic information and intricate long-range dependencies remains limited.Recent large language model(LLM)-based approaches have shown promising accuracy by leveraging rich contextual information,but their high computational cost often limits practical efficiency.To address these challenges,we propose VulSCP,a new framework that integrates sequential convolution with a parallel attention mechanism.Specifically,VulSCP first constructs a semantically weighted graph from the source code,then employs sequential convolution to extract local vulnerability-related features,and finally enhances the global feature representation through parallel attention.Experimental results on large-scale C/C++function-level datasets show that VulSCP achieves an accuracy of 85.14%and a false positive rate of 17.25%,outperforming the best baseline in accuracy by 1.73 percentage points and reducing the false positive rate by 3.38 percentage points.Moreover,while maintaining high detection accuracy,VulSCP achieves a low average inference time of 1.89 s per sample,showing favorable efficiency compared with the evaluated LLM-based methods.These results suggest that VulSCP is a promising approach for vulnerability detection in large and complex software systems,offering a favorable balance between accuracy and efficiency.The source code of VulSCP is publicly available at http://gffzz188fe103f8f1460as0oo5o0o0pkq069ww.ffgz.tsg.suse.edu.cn/Hwzx-ZeL/VulSCP. 展开更多
关键词 Code vulnerability detection sequential convolution parallel attention program dependency graph semantic graph representation
暂未订购 下载PDF
THE Z SPECIFICATION DEPENDENCE GRAPH 认领 引用
2
作者 WuFangjun YiTong 《Journal of Electronics(China)》 2005年第2期201-204,共4页
The lack of existing solutions makes it really hard to understand formal specification languages since the application domain for representations is useful for the purpose of carrying out certain software engineering ... The lack of existing solutions makes it really hard to understand formal specification languages since the application domain for representations is useful for the purpose of carrying out certain software engineering operations such as slicing and the computation of program metrics.A Z specification dependence graph is presented in this letter. It draws on the strengths of a range of earlier works and adapts them, if necessary, to the Z language. 展开更多
关键词 Program Dependence Graph(PDG) System Dependence Graph(SDG) Formal specification language
暂未订购 下载PDF
Dependence Analysis Based on Dynamic Slicing for Debugging 认领 引用 被引量：3
3
作者 Chen Zhen qiang 1, Xu Bao wen 1,2 1 Department of Computer Science & Engineering, Southeast University, Nanjing 210096, China 2 State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, China 《Wuhan University Journal of Natural Sciences》 EI CAS 2001年第Z1期398-404,共7页
Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains only those statements that actually a... Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains only those statements that actually affect the variables in the slicing criterion. This paper proposes a dynamic slicing method based on static dependence analysis. It uses the program dependence graph and other static information to reduce the information needed to be traced during program execution. Thus, the efficiency is dramatically improved while the precision is not depressed. The slicing criterion is modified to fit for debugging. It consists of file name and the line number at which the statement is. 展开更多
关键词 program slice slicing criterion program dependence graph
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈