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

IEEE 38th Annual International Computers, Software and Applications Conference (COMPSAC)

作者： Lim, Hyun-il Kyungnam Univ Dept Comp Engn Gyeongsangnam Do South Korea

ISBN: (纸本)9781479935741

In this paper, we present an approach to comparing control flow graphs of binary programs by matching their basic blocks. We first set up an initial match and propagate it to reach a stable state. We consider the matched pairs to identify overall similarities. To evaluate the proposed method, we perform experiments on real-world Java applications, and compare their performance with previous structural matching method. In the experimental results, the proposed method shows more reliable results than previous method at distinguishing similar control flow graphs.

关键词： control flow graph binary program analysis software comparison

来源：评论

学校读者我要写书评

暂无评论

control flow graphS AND CODE COVERAGE

引用

INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE 2010年第4期20卷 739-749页

作者： Gold, Robert Ingolstadt Univ Appl Sci Fac Elect Engn & Comp Sci D-85049 Ingolstadt Germany

The control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced graphs and also about the paths in reduced graphs. Based on graphs, we define statement coverage and branch coverage such that coverage notions correspond to node coverage, and edge coverage, respectively.

关键词： directed graph control flow graph graph reduction software testing statement coverage branch coverage

来源：评论

学校读者我要写书评

暂无评论

Extended Differential control flow graphs for the Selection of Test Cases in Regression Testing 15

Extended Differential Control Flow Graphs for the Selection ...

引用

15th IEEE/ACIS International Conference on Computer and Information Science (ICIS)

作者： Akimoto, Shun Nakanishi, Shunta Yaegashi, Rihito Takagi, Tomohiko Kagawa Univ Grad Sch Engn Takamatsu Kagawa Japan Kagawa Univ Fac Engn Takamatsu Kagawa Japan

This paper shows an EDCFG (extended differential control flow graph) to improve the accuracy of UCNs (update complexity numbers) that are utilized for the selection of existing test cases in regression testing.

ISBN: (纸本)9781509008056

关键词： regression testing test case control flow graph program dependency graph

来源：评论

学校读者我要写书评

暂无评论

CFGCon: A Scheme for Accurately Generating control flow graphs of Smart Contracts 1

引用

7th Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) International Joint Conference on Web and Big Data

作者： Xia, Nengyu Zhang, Yixin Ren, Wei Chen, Xianyi China Univ Geosci Sch Comp Sci Wuhan Peoples R China Nanjing Univ Informat Sci & Technol Engn Res Ctr Digital Forens Minist Educ Nanjing Peoples R China

ISBN: (数字)9789819723874

ISBN: (纸本)9789819723867;9789819723874

Smart contracts are a significant component that allows decentralized applications (DApps) to automate the exchange of digital assets without third-party surveillance. To build trust, smart contracts are designed to be immutable, resulting in design flaws that may remain unrevealed in deployed contracts. Many analysis tools are developed to identify various vulnerabilities that could be targeted by hackers after deployment and thus cause financial losses. However, these approaches based on graph classification rely much on the quality of control flow graphs (CFGs) generated from the bytecode of smart contracts. In this paper, we propose a novel generator named CFGCon to convert byte-codes of smart contracts to CFGs. After targeting the difficulties for the existing CFG generators, a program counter is designed to deal with the opcodes with loops or instructions that need to read the current counter. Experimental results show that our proposed CFGCon reached a much higher success rate than other state-of-art CFG generators on the dataset containing 579 open source contracts and 10,000 non-open source contracts from Ethereum. At the same time, the analysis speed of CFGCon is similar to that of the current mainstream tools.

关键词： smart contract bytecode control flow graph

来源：评论

学校读者我要写书评

暂无评论

CompareCFG: Providing Visual Feedback on Code Quality Using control flow graphs 20

CompareCFG: Providing Visual Feedback on Code Quality Using ...

引用

25th Conference on Innovation and Technology in Computer Science Education

作者： Jiang, Lucy Rewcastle, Robert Denny, Paul Tempero, Ewan Univ Auckland Auckland New Zealand

ISBN: (纸本)9781450368742

The quality of the code impacts the cost of its maintenance, yet lcode qualityz is often not given attention in introductory programming courses, perhaps due to the difficulty of providing automated code quality feedback. We have been exploring how to provide automated feedback on complexity, one aspect of code quality. We have developed CompareCFG that provides feedback based on control flow graphs (CFGs). It generates visualisations of students' submissions and provides the means for a student to compare the CFG of their own code with CFGs of less complex submissions, helping to support their understanding of code complexity. CompareCFG also provides actionable feedback by indicating specific issues in a submission that can reduce its complexity. We evaluated CompareCFG in a pilot study. We found it provides useful feedback to participants that helped them reduce the complexity of their code. CompareCFG offers a convenient way to provide programming students with automated visual feedback on code quality.

关键词： code quality automatic assessment tools software maintenance control flow graph CFG

来源：评论

学校读者我要写书评

暂无评论

Fast Cross-Platform Binary Code Similarity Detection Framework Based on CFGs Taking Advantage of NLP and Inductive GNN

引用

Chinese Journal of Electronics 2024年第1期33卷 128-138页

作者： Jinxue PENG Yong WANG Jingfeng XUE Zhenyan LIU School of Computer Science and Technology Beijing Institute of Technology

Cross-platform binary code similarity detection aims at detecting whether two or more pieces of binary code are similar or not. Existing approaches that combine control flow graphs(CFGs)-based function representation and graph convolutional network(GCN)-based similarity analysis are the best-performing ones. Due to a large amount of convolutional computation and the loss of structural information, the use of convolution networks will inevitably bring problems such as high overhead and sometimes inaccuracy. To address these issues, we propose a fast cross-platform binary code similarity detection framework that takes advantage of natural language processing(NLP)and inductive graph neural network(GNN) for basic blocks embedding and function representation respectively by simulating extracting structural features and temporal features. GNN's node-centric and small batch is a suitable training way for large CFGs, it can greatly reduce computational overhead. Various NLP basic block embedding models and GNNs are evaluated. Experimental results show that the scheme with long short term memory(LSTM)for basic blocks embedding and inductive learning-based graph SAGE(GAE) for function representation outperforms the state-of-the-art works. In our framework, we can take only 45% overhead. Improve efficiency significantly with a small performance trade-off.

关键词： control flow graph Natural language processing Inductive graph neural network Binary code similarity detection

来源：评论

学校读者我要写书评

暂无评论

Overlaying control flow graphs on P4 Syntax Trees with Gremlin

引用

ACTA CYBERNETICA 2024年第3期26卷 593-619页

作者： Lukacs, Daniel Tejfel, Mate Eotvos Lorand Univ Fac Informat Budapest Hungary

Our overall research aim is to statically derive execution cost and other metrics from program code written in the P4 programming language. For this purpose, we extract a detailed control flow graph (CFG) from the code, that can be turned into a full, formal model of execution, to extract properties - such as execution cost - from the model. While CFG extraction and analysis is well researched area, details are dependent on code representation and therefore application of textbook algorithms (often defined over unstructured code listings) to real programming languages is often non-trivial. Our aim is to present an algorithm for CFG extraction over P4 abstract syntax trees (AST). During the extraction we create direct links between nodes of the CFG and the P4 AST: this way we can access all information in the P4 AST during CFG traversal. We are utilizing Gremlin, a graph query language to take advantage of graph databases, but also for compactness and to formally prove algorithm correctness.

关键词： control flow graph static analysis P4 Gremlin graph database proof of correctness

来源：评论

学校读者我要写书评

暂无评论

SEMIAUTOMATIC TEST SUITE GENERATION FROM ESTELLE

引用

SOFTWARE ENGINEERING JOURNAL 1992年第4期7卷 295-307页

作者： FORGHANI, B SARIKAYA, B BELL NO RES DEPT 7W21OTTAWA K1Y 4H7ONTARIOCANADA UNIV MONTREAL DEPT IRO CP6128MONTREAL H3C 3J7QUEBECCANADA

Overviews of the standard formal specification language Estelle and test suite specification language TTCN are provided. Steps involved in semi-automatic generation of TTCN test suites from Estelle are introduced. Details of TTCN test step generation from Estelle transitions are explained. Test cases are obtained from these test steps by way of ordering them using the control flow graph. The implementation of a software tool called TTCNGEN, which largely automates the methodology, is explained and examples are provided from the LAP-D protocol of the integrated services digital network. Related research is discussed, and various ideas are highlighted for future research.

关键词： Protocols software tools formal specification ISDN Network performance Software engineering techniques control flow graph LAP-D protocol specification languages semiautomatic test suite generation protocols conformance testing Estelle High level languages TTCNGEN test suite specification language TTCN formal specification language Estelle software tool integrated services digital network

来源：评论

学校读者我要写书评

暂无评论

TEST DATA SELECTION AND QUALITY ESTIMATION BASED ON THE CONCEPT OF ESSENTIAL BRANCHES FOR PATH TESTING

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1987年第5期13卷 509-517页

作者： CHUSHO, T Syst. Dev. Lab. Hitachi Ltd. Ohzenji Asao-ku Kawasaki 215 Japan

A new coverage measure is proposed for efficient and effective software testing. The conventional coverage measure for branch testing has such defects as overestimation of software quality and redundant test data selection because all branches are treated equally. These problems can be avoided by paying attention to only those branches essential for path testing. A testing tool is developed in order to discriminate essential branches from nonessential branches and to measure the coverage rate of these essential branches.

关键词： Test Data Selection Algorithm Branch Testing control flow graph Coverage Measure Path Testing Program Testing Quality Estimation

来源：评论

学校读者我要写书评

暂无评论

control flow-based opcode behavior analysis for Malware detection

引用

COMPUTERS & SECURITY 2014年 44卷 65-74页

作者： Ding, Yuxin Dai, Wei Yan, Shengli Zhang, Yumei Shenzhen Univ Town Harbin Inst Technol Shenzhen Grad Sch Shenzhen 518055 Peoples R China Chinese Acad Sci State Key Lab Comp Architecture Inst Comp Technol Beijing 100864 Peoples R China

Opcode sequences from decompiled executables have been employed to detect malware. Currently, opcode sequences are extracted using text-based methods, and the limitation of this method is that the extracted opcode sequences cannot represent the true behaviors of an executable. To solve this issue, we present a control flow-based method to extract executable opcode behaviors. The behaviors extracted by this method can fully represent the behavior characteristics of an executable. To verify the efficiency of control flow-based behaviors, we perform a comparative study of the two types of opcode behavior analysis methods. The experimental results indicate that the proposed control flow-based method has a higher overall accuracy and a lower false positive rate. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Opcode sequence Malicious code detection control flow graph Machine learning Classification Security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：