检索结果-内蒙古大学图书馆

Vulnerability Localization Based On intermediate code Representation and Feature Fusion

COMPUTER JOURNAL 2024年第9期67卷 2749-2762页

作者： Zhu, Chenguang Wei, Renzheng Chen, Liwei Wu, Tongshuai Du, Gewangzi Shi, Gang Chinese Acad Sci Inst Informat Engn Beijing 100095 Peoples R China Univ Chinese Acad Sci Sch Cyber Secur Beijing 100049 Peoples R China Huawei Technol Co Ltd Beijing Res Inst Beijing 100095 Peoples R China

Vulnerability localization can assist security professionals in vulnerability validation and analysis. This study proposes an intelligent vulnerability localization method based on fine-grained program representation and feature fusion. Firstly, we generate efficient fine-grained program representations of the program. This involves transforming the source code into intermediate code. We use abstract syntax tree characteristics to correspond to the points of interest of the intermediate code. We slice the intermediate code file based on the point of interest and program dependency relationships. Subsequently, we use the word2vec model to the vectorization of the intermediate code slices. Then, we propose a vulnerability localization framework based on a feature fusion method, which can better combine the advantages of bidirectional gate recurrent unit and convolutional neural network to capture the syntax and semantics of program representation. Through comparing different program representations, we have discovered that the fine-grained representation based on intermediate code in this study provides a more accurate portrayal of program semantics. By comparing various methods, the proposed feature fusion approach in this paper improves vulnerability localization. We also conducted a visualization display of vulnerability localization. Furthermore, we have validated the effectiveness of this method in localizing vulnerabilities across five common vulnerability types.

关键词： vulnerability location intermediate code feature fusion

来源：评论

学校读者我要写书评

暂无评论

Java code Clone Detection by Exploiting Semantic and Syntax Information From intermediate code-Based Graph

引用

IEEE TRANSACTIONS ON RELIABILITY 2023年第2期72卷 511-526页

作者： Yuan, Dawei Fang, Sen Zhang, Tao Xu, Zhou Luo, Xiapu Macau Univ Sci & Technol Sch Comp Sci & Engn Taipa 999078 Macao Peoples R China Chongqing Univ Sch Big Data & Software Engn Chongqing 400030 Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China

code clone detection plays a critical role in the field of software engineering. To achieve this goal, developers are required to have rich development experience for finding the "functional" clone code. However, this is unfriendly to novice developers. Although many approaches were proposed to automatically detect code clones, the results are not satisfactory. A major reason is that it is difficult to extract syntax and semantic information from the source code. To resolve this problem, in this article, we develop a novel graph representation approach based on intermediate code to detect the functional code clones. This graph representation is built based on intermediate code compiled from the source code. By using it, we can easily utilize graph embedding techniques to extract syntactic and semantic features from abstract syntax tree, control flow graph, and DFG generated from intermediate code. After that, we use the Softmax classifier to detect functional code clone pairs. We evaluate the performance of the proposed graph representation approach based on intermediate code for the code clone detection task on the BigCloneBench dataset. In order to improve performance, the embedded representation of intermediate code is initialized based on pretrained vectors learned from the collected LLVM IR dataset in advance. The experimental results show that our proposed intermediate code-based graph approach performs better than existing functional code clone detection approaches. Especially for the type-4 code clone detection, our approach outperforms the baseline approaches by an average of 33.49% in the term of F1 score.

关键词： codes Cloning Syntactics Semantics Data mining Task analysis Feature extraction Abstract syntax tree (AST) clone code detection control flow graph (CFG) data flow graph (DFG) graph embedding intermediate code

来源：评论

学校读者我要写书评

暂无评论

INFORMATION-FLOW CERTIFICATION USING AN intermediate code PROGRAM REPRESENTATION

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1981年第6期7卷 594-607页

作者： MENNIE, AL MACEWEN, GH ANDYNE COMP LTD KINGSTONONTARIOCANADA QUEENS UNIV DEPT COMP & INFORMAT SCIKINGSTON K7L 3N6ONTARIOCANADA

Control of information flow is one of the issues in the area of computer and data security. A mechanism has been devised to supply control at compile time that will certify that all objects a program wishes to access will rightfully be made available to the program. The essence of the information flow control (IFC) mechanism, which is based on the lattice model and certification mechanism of Denning, is a partial ordering of security classes, along with a specification of permissible information flows. IFC is placed after semantic analysis and before optimization or code generation. This placement enables the certification mechanism to use the full processing power of previous passes of the compiler. It also permits the separation of the enforcement of security from the compilation process. This permits the separate development of the certification mechanism, eliminating the need to make changes to an existing compiler. Mathematical notation.

关键词： Security Certification Compilation Information Flow intermediate code Protection

来源：评论

学校读者我要写书评

暂无评论

USING PEEPHOLE OPTIMIZATION ON intermediate code

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 1982年第1期4卷 21-36页

作者： TANENBAUM, AS VANSTAVEREN, H STEVENSON, JW Department of Mathematics Vrije Universiteit Postbus 7161 1007 MC Amsterdam The Netherlands Department of Mathematics Vrije Universiteit Postbus 7161 1007 MC Amsterdam The Netherlands Arsycom BV Kabelweg 43 Amsterdam The Netherlands

Many portable compilers generate an intermediate code that is subsequently translated into the target machine's assembly language. In this paper a stack-machine-based intermediate code suitable for algebraic languages (e.g., PASCAL, C, FORTRAN) and most byte-addressed mini- and microcomputers is described. A table-driven peephole optimizer that improves this intermediate code is then discussed in detail and compared with other local optimization methods. Measurements show an improvement of about 15 percent, depending on the precise metric used. © 1982, ACM. All rights reserved.

关键词： abstract machine intermediate code peephole optimizer

来源：评论

学校读者我要写书评

暂无评论

A FORTRAN LANGUAGE SYSTEM FOR MUTATION-BASED SOFTWARE TESTING

引用

SOFTWARE-PRACTICE & EXPERIENCE 1991年第7期21卷 685-718页

作者： KING, KN OFFUTT, AJ CLEMSON UNIV DEPT COMP SCI CLEMSON SC 29631 USA

Mutation analysis is a powerful technique for testing software systems. The Mothra software testing project uses mutation analysis as the basis for an integrated software testing environment. Mutation analysis requires executing many slightly differing versions of the same program to evaluate the quality of the data used to test the program. The current version of Mothra includes a complete language system that translates a program to be tested into intermediate code so that it and its mutated versions can be executed by an interpreter. In this paper, we discuss some of the unique requirements of a language system used in a mutation-based testing environment. We then describe how these requirements affected the design and implementation of the Fortran 77 version of the Mothra system. We also describe the intermediate language used by Mothra and the features of the language system that are needed for software testing. The appendices contain a full description of the intermediate language and the mutation operators used by Mothra. The design and implementation techniques that were developed for Mothra are applicable for constructing not just software testing systems, but any type of program analysis system or language system for a special-purpose application. In particular, we discuss decisions made and techniques developed by the Mothra team that can be useful in such applications as debuggers, program measurement tools, software development environments and other types of program analysis systems.

关键词： FORTRAN intermediate code INTERPRETERS MOTHRA MUTATION ANALYSIS SOFTWARE TESTING

来源：评论

学校读者我要写书评

暂无评论

An automated approach to reducing test suites for testing retargeted C compilers for embedded systems

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2011年第12期84卷 2053-2064页

作者： Chae, Heung Seok Woo, Gyun Kim, Tae Yeon Bae, Jung Ho Kim, Won-Young Pusan Natl Univ Dept Comp Sci & Engn Pusan 609735 South Korea Elect & Telecommun Res Inst Taejon 305700 South Korea

With widespread use of embedded processors, there is an increasing need to develop compilers for them in a timely manner. Retargeting has been an effective approach to constructing new compilers by modifying the back-end of existing compilers. An efficient testing method for retargeted compilers using intermediate codes is proposed in this paper. The concepts of the intermediate-code-based approach are described, and it is demonstrated that the proposed approach is efficient and effective enough. We have developed an automated tool, PLOOSE, which generates test suites based on source-code coverage criteria and then reduces them based on intermediate-code coverage. In addition, case studies are presented which reveal that a test suite based on source codes can be considerably reduced using intermediate codes. Moreover, by mutation analysis, it was found that the size of the test suite has been reduced by over 90% on average, but the fault detection capability of the reduced test suites is still approximately 80% of that of the original test suites. In particular, the proposed reduction method can be useful for testing compilers in the early stage of the development of retargeted compilers. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Test suite generation and reduction Compiler testing Retargeted compilers intermediate code Grammar coverage

来源：评论

学校读者我要写书评

暂无评论

code GENERATION WITH A RECURSIVE OPTIMIZER

引用

SOFTWARE-PRACTICE & EXPERIENCE 1980年第5期10卷 393-403页

作者： STEVENSON, G Micro Focus Limited 58 Acacia Road London NW8 6AG U.K.

This paper describes a general purpose optimizer used to construct a new code generator for an existing Coral 66 compiler. The optimizer is recursive and gives the one pass code generator some of the advantages of a m... 详细信息

关键词： Optimizer Compilers code generation intermediate code Coral RTL/2

来源：评论

学校读者我要写书评

暂无评论

A COMPUTER ARCHITECTURE SUITED TO MULTIPLEX WIRING SYSTEMS IN CARS

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROPROGRAMMING 1987年第1期19卷 1-4页

作者： JOHANSSON, LT CHALMERS UNIV TECHNOL DEPT COMP TECHNOLS-41296 GOTHENBURGSWEDEN

The system level architecture for a computer system of the Local Area Network type is described. The system designed is intended to implement Multiplex Wiring systems in cars. It is realized with a large number of rom Single Chip Microcomputers. The microcomputers contain Interpreters which directly interpret an Application Oriented Language compiled to an intermediate code with a very compact representation. When the system is started the intermediate code programs are loaded into the rams of the Single Chip Microcomputers from one node in the Local Area Network. Thus only one microcomputer has to contain different programs in different car models. The Application Oriented Language is especially developed for Multiplex Wiring systems in cars.

关键词： Cars Multiplex wiring Local Area Network Application Oriented Language intermediate code Interpreter Single Chip Microcomputers Flexibility Cost efficiency

来源：评论

学校读者我要写书评

暂无评论

Algorithm Classification Using Worst-Case Execution Time

Algorithm Classification Using Worst-Case Execution Time

引用

2nd IEEE International Conference on Computer Science and Information Technology

作者： Mehrotra, Mudit Goel, Ankur Agarwal, Nipun Bindu, M. Hima Sharma, Bhudev Jaypee Inst Informat Technol Univ Dept Comp Sci & Engn Noida India

ISBN: (纸本)9781424445189

Problems in computer science require some time to produce an output. Some can be executed in few seconds or minutes. Others require hours, days or even centuries to produce an output. In this paper, we propose a technique to classify a problem in any of the above two categories without executing the input source code for a large test case. First, a Control Flow Graph is generated from the intermediate code of the input source code. Then, this CFG is reduced and a set of linear equations is framed. The solution of these linear equations along with execution count of the loops is used to determine Worst Case Execution Time. This WCET is compared with a threshold to classify the problem as either having a definite or indefinite execution time. The main advantage of this approach is that control flow analysis is automatic and user annotations in terms of markers and scope are not required in the input code.

关键词： Worst Case Execution Time Control Flow Graph intermediate code Symbol Table

来源：评论

学校读者我要写书评

暂无评论

Transforming procedural code for streaming environments 25

Transforming procedural code for streaming environments

引用

25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)

作者： Brabec, Michal Bednarek, David Charles Univ Prague Dept Software Engn Prague Czech Republic

ISBN: (纸本)9781509060580

Streaming environments and similar parallel platforms are widely used in image, signal, or general data processing as a means of achieving high performance. Unfortunately, they are often associated with specific programming languages and, thus, hardly accessible for non-experts. In this paper, we present a framework for transformation of a C# procedural code to a Hybrid Flow Graph - a novel intermediate code which employs the streaming paradigm and can be further converted into a streaming application. This approach will allow creating streaming applications or their parts using a widely known imperative language instead of an intricate language specific to streaming. In this paper, we focus on the transformation of control flow which represents the main difference between procedural code, driven by control flow constructs, and streaming environments, driven by data. Since the use of a streaming platform automatically enables parallelism and vectorization, we were able to demonstrate that the streaming applications generated by our method may outperform their original C# implementation.

关键词： code transformation intermediate code parallel programming vectorization streaming systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：