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

CONCURRENT PROCESS MONITORING WITH NO REFERENCE SIGNATURES

IEEE TRANSACTIONS ON COMPUTERS 1994年第4期43卷 475-480页

作者： UPADHYAYA, SJ RAMAMURTHY, B Department of Electrical and Computer Engineering State University of New York Buffalo NY USA

A simple, inexpensive and time/space efficient signature technique for process monitoring is presented. In this technique, a known signature function is applied to the instruction stream at compilation phase and when the accumulated signature forms an m-out-of-n code, the corresponding instructions are tagged. Error checking is done at run-time by monitoring the signatures accumulated at the tagged locations to determine whether they form m-out-of-n codes. This approach of signature checking does not require the embedding of reference signatures at compilation, thereby leading to savings in memory as well as in execution time. The m-out-of-n code approach offers high error coverage and controllable latency. The results of the experiments conducted to verify the controllability of the latency are discussed. One of the distinguishing features of the proposed scheme is the elimination of reference signatures, which are the main source of memory and time overhead in the existing techniques.

关键词： BIT ERRORS BRANCH-FREE INTERVAL control flow graph ERROR COVERAGE ERROR LATENCY SEQUENCING ERRORS SIGNATURE ANALYSIS WATCHDOG PROCESSOR

来源：评论

学校读者我要写书评

暂无评论

Improvements of Directed Automated Random Testing in Test Data Generation for C plus plus Projects

引用

INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING 2019年第9期29卷 1279-1312页

作者： Duc-Anh Nguyen Tran Nguyen Huong Hieu Vo Dinh Pham Ngoc Hung VNU Univ Engn & Technol Hanoi Vietnam

This paper improves the breadth-first search strategy in directed automated random testing (DART) to generate a fewer number of test data while gaining higher branch coverage, namely Static DART or SDART for short. In addition, the paper extends the test data compilation mechanism in DART, which currently only supports the projects written in C, to generate test data for C++ projects. The main idea of SDART is when it is less likely to increase code coverage with the current path selection strategies, the static test data generation will be applied with the expectation that more branches are covered earlier. Furthermore, in order to extend the test data compilation of DART for C++ context, the paper suggests a general test driver technique for C++ which supports various types of parameters including basic types, arrays, pointers, and derived types. Currently, an experimental tool has been implemented based on the proposal in order to demonstrate its efficacy in practice. The results have shown that SDART achieves higher branch coverage with a fewer number of test data in comparison with that of DART in practice.

关键词： Directed automated random testing concolic testing test data compilation test data generation control flow graph C plus SMT-Solver

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A framework for quantitative evaluation of parallel control-flow obfuscation

引用

COMPUTERS & SECURITY 2012年第8期31卷 886-896页

作者： Huang, Yu-Lun Tsai, Hsin-Yi Natl Chiao Tung Univ Inst Elect Control Engn Hsinchu Taiwan

Software obfuscation is intended to protect a program by thwarting reverse engineering. Several types of software obfuscation have been proposed, and control-flow obfuscation is a commonly adopted one. In this paper, we present a framework to evaluate parallel control-flow obfuscation, which raises difficulty of reverse engineering by increasing parallelism of a program. We also define a control flow graph of a program and some atomic operators for obfuscating transformations. The proposed framework comprises three phases: parsing, formalization and evaluation. A program is first parsed to a control flow graph. Then, we formalize a parallel control-flow obfuscating transformation based on our atomic operators. By selecting target code blocks in the control flow graph and applying obfuscating transformations to the target code blocks, the original program is then obfuscated. In the third phase, we define a measure to calculate the program complexity. The measure can be considered as a degree to which an obfuscating transformation can confuse a human trying to understand the obfuscated program. Such a measure can also be used as the base of the potency metric to estimate the capability of the obfuscated program against reverse engineering. Our novel framework helps efficiently examine a control-flow obfuscating transformation in a systematic manner and helps select an appropriate obfuscating transformation among a number of candidates to better protect a program. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Software obfuscation Security evaluation Reverse engineering Software metrics control flow graph

来源：评论

学校读者我要写书评

暂无评论

MalGNE: Enhancing the Performance and Efficiency of CFG-Based Malware Detector by graph Node Embedding in Low Dimension Space

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2024年 19卷 4881-4896页

作者： Peng, Hao Yang, Jieshuai Zhao, Dandan Xu, Xiaogang Pu, Yuwen Han, Jianmin Yang, Xing Zhong, Ming Ji, Shouling Zhejiang Normal Univ Coll Comp Sci & Technol Jinhua 321004 Peoples R China Zhejiang Normal Univ Key Lab Intelligent Educ Technol & Applicat Jinhua 321004 Peoples R China Zhejiang Univ Inst Cyberspace Res Hangzhou 310027 Zhejiang Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310027 Zhejiang Peoples R China Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

The rich semantic information in control flow graphs (CFGs) of executable programs has made graph Neural Networks (GNNs) a key focus for malware detection. However, existing CFG-based detection techniques face limitations in node feature extraction, such as information loss, neglect of execution sequence information, and redundancy in representation vectors. These limitations compromise the balance between high efficiency and precision when training detectors. Addressing this, we introduce an innovative Malware CFG Node Embedding (MalGNE) method. This approach utilizes a novel instruction encoding rule to address the Out-Of-Vocabulary(OOV) problem, generates high-quality initial vectors. Then, it employs aggregation layer and sequence layer to extract node aggregation feature and execution sequence feature, in conjunction with GNNs to develop a pre-trained node embedding model. The model maps the semantic information of node assembly instruction sequences into a compact, low-dimensional continuous space, ensuring high-quality feature extraction, and enhancing the performance and efficiency of the detector. We trained the MalGNE model using the BIG 2015 dataset and validated MalGNE-enhanced detector on the SOREL-20M and BODMAS datasets. MalGNE-enhanced detector demonstrates outstanding performance and efficiency in low-dimensional spaces, especially when the dimensionality of the node feature vector is reduced to 16. MalGNE-enhanced detector not only maintains a high detection accuracy of 95.49%. sacrificing only about 1.7% of accuracy to save approximately 73% of training time compared to 128 dimensions.

关键词： Malware detection node embedding control flow graph graph neural network

来源：评论

学校读者我要写书评

暂无评论

Symbolic execution based test-patterns generation algorithm for hardware Trojan detection

引用

COMPUTERS & SECURITY 2018年 78卷 267-280页

作者： Shen, Lixiang Mu, Dejun Cao, Guo Qin, Maoyuan Blackstone, Jeremy Kastner, Ryan Northwestern Polytech Univ Sch Automat Xian 710072 Shaanxi Peoples R China Changzhou Inst Technol Sch Comp Informat & Engn Changzhou 213032 Jiangsu Peoples R China Northwestern Polytech Univ Sch Management Xian 710072 Shaanxi Peoples R China Changzhou Inst Technol Sch Econ & Management Changzhou 213032 Jiangsu Peoples R China Univ Calif San Diego Dept Comp Sci & Engn San Diego CA 92093 USA

Hardware Trojan detection is a very difficult challenge. However, the combination of symbolic execution and metamorphic testing is useful for detecting hardware Trojans in Verilog code. In this paper, symbolic execution and metamorphic testing were combined to detect internal conditionally triggered hardware Trojans in the register-transfer level design. First, control flow graphs of Verilog code were generated. Next, parallel symbolic execution and satisfiability modulo theories solver generated test patterns. Finally, metamorphic testing detected the hardware Trojans. The work used Trust-Hub benchmarks in experiments. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Hardware Trojan Symbolic execution Satisfiability modulo theory Metamorphic testing control flow graph

来源：评论

学校读者我要写书评

暂无评论

CoSS: Leveraging Statement Semantics for Code Summarization

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2023年第6期49卷 3472-3486页

作者： Shi, Chaochen Cai, Borui Zhao, Yao Gao, Longxiang Sood, Keshav Xiang, Yong Deakin Univ Sch Informat Technol Geelong Vic 3220 Australia Qilu Univ Technol Shandong Acad Sci Jinan 250103 Shandong Peoples R China

Automated code summarization tools allow generating descriptions for code snippets in natural language, which benefits software development and maintenance. Recent studies demonstrate that the quality of generated summaries can be improved by using additional code representations beyond token sequences. The majority of contemporary approaches mainly focus on extracting code syntactic and structural information from abstract syntax trees (ASTs). However, from the view of macro-structures, it is challenging to identify and capture semantically meaningful features due to fine-grained syntactic nodes involved in ASTs. To fill this gap, we investigate how to learn more code semantics and control flow features from the perspective of code statements. Accordingly, we propose a novel model entitled CoSS for code summarization. CoSS adopts a Transformer-based encoder and a graph attention network-based encoder to capture token-level and statement-level semantics from code token sequence and control flow graph, respectively. Then, after receiving two-level embeddings from encoders, a joint decoder with a multi-head attention mechanism predicts output sequences verbatim. Performance evaluations on Java, Python, and Solidity datasets validate that CoSS outperforms nine state-of-the-art (SOTA) neural code summarization models in effectiveness and is competitive in execution efficiency. Further, the ablation study reveals the contribution of each model component.

关键词： Attention mechanism code summarization control flow graph graph neural network

来源：评论

学校读者我要写书评

暂无评论

THE COMBINING DAG - A TECHNIQUE FOR PARALLEL DATA-flow ANALYSIS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1994年第8期5卷 805-813页

作者： KRAMER, R GUPTA, R SOFFA, ML Department of Computer Science University of Pittsburgh Pittsburgh PA USA

As the number of available multiprocessors increases, so does the importance of providing software support for these systems, including parallel compilers. Data flow analysis, an important component of software tools, may be computed many times during the compilation of a program, especially when compiling for a multiprocessor. Although converting a sequential data flow algorithm to a parallel algorithm can present some opportunities for computing data flow in parallel, more parallelism can be exposed by the development of new parallel data flow algorithms. In this paper, we present a technique that computes rapid data flow problems in parallel and thus is applicable for commonly used classical data flow problems, including reaching definitions, reachable uses, available expressions, and very busy expressions. Unlike previous techniques, our technique exploits the inherent parallelism in the data flow computation that occurs across independent paths, within linear paths, and in paths through loops of a control flow graph. The technique first changes cyclic structures in a control flow graph to acyclic structures and then builds a combining directed acyclic graph (DAG) that represents the paths through the control flow graph needed to compute data flow. Data flow is then computed using two passes over the DAG by computing the data flow for the nodes on each level of the DAG in parallel. We also present experimental results comparing the performance of our algorithm with a sequential algorithm and a parallelized sequential algorithm.

关键词： DATA flow ANALYSIS control flow graph ITERARTIVE METHOD STRUCTURED ANALYSIS NODE LISTINGS

来源：评论

学校读者我要写书评

暂无评论

BCGen: a comment generation method for bytecode

引用

AUTOMATED SOFTWARE ENGINEERING 2023年第1期30卷 1-31页

作者： Huang, Yuan Huang, Jinbo Chen, Xiangping He, Kunning Zhou, Xiaocong Sun Yat Sen Univ Sch Software Engn Zhuhai 519000 Guangdong Peoples R China Sun Yat Sen Univ Sch Journalism & Commun Guangdong Key Lab Big Data Anal & Simulat Publ Opi Guangzhou 510000 Guangdong Peoples R China Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou 510000 Guangdong Peoples R China

Bytecode is a form of instruction set designed for efficient execution by a software interpreter. Unlike human-readable source code, bytecode is even harder to understand for programmers and researchers. Bytecode has been widely used in various software tasks such as malware detection and clone detection. In order to understand the meaning of the bytecode more quickly and accurately and further help programmers in more software activities, we propose a bytecode comment generation method (called BCGen) using neural language model. Specifically, to get the structured information of the bytecode, we first generate the control flow graph (CFG) of the bytecode, and serialize the CFG with bytecode semantic information. Then a transformer model combining gate recurrent unit is proposed to learn the features of bytecode to generate comments. We obtain the bytecode by building the Jar packages of the well-known open-source projects in the Maven repository and construct a bytecode dataset to train and evaluate our model. Experimental results show that the BLEU of BCGen can reach 0.26, which outperforms several baselines and proves the effectiveness and practicability of our method. It is concluded that it is possible to generate natural language comments directly from the bytecode. Meanwhile, it is important to take structured and semantic information into account in generating bytecode comments.

关键词： Bytecode Comments generation control flow graph Program comprehension

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：