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

A Survey on Mining program-graph Features for Malware Analysis 1

10th International ICST Conference on Security and Privacy in Communication Networks (SecureComm)

作者： Islam, Md Saiful Islam, Md Rafiqul Kayes, A. S. M. Liu, Chengfei Altas, Irfan Swinburne Univ Technol Melbourne Vic Australia Charles Sturt Univ Alburry NSW Australia Charles Sturt Univ Wagga Wagga NSW Australia

ISBN: (数字)9783319238029

ISBN: (纸本)9783319238029;9783319238012

Malware, which is a malevolent software, mostly programmed by attackers for either disrupting the normal computer operation or gaining access to private computer systems. A malware detector determines the malicious intent of a program and thereafter, stops executing the program if the program is malicious. While a substantial number of various malware detection techniques based on static and dynamic analysis has been studied for decades, malware detection based on mining program graph features has attracted recent attention. It is commonly believed that graph based representation of a program is a natural way to understand its semantics and thereby, unveil its execution intent. This paper presents a state of the art survey on mining program-graph features for malware detection. We have also outlined the challenges of malware detection based on mining program graph features for its successful deployment, and opportunities that can be explored in the future.

关键词： program graph graph features Malware detection

来源：评论

学校读者我要写书评

暂无评论

On Partitioning program graphs

引用

IEEE Transactions on Software Engineering 1977年第6期SE-3卷 386-393页

作者： Paige, Michael R. TheAnalytic Sciences Corporation (TASC) Reading MA 01867 United States

In recent years, applications of graph theory to computer software have given fruitful results and attracted more and more attention. A program graph is a graph structural model of a program exhibiting the flow relation or connection among the elements (statements) in the program. One particular aspect of graph analysis which is extremely useful for software is that of partitioning, since it both reduces the complexity of the system and highlights the actual system composition. The purpose of this paper is to review and discuss given approaches to partitioning program graphs. These techniques are best identified by the names of the units into which the program is grouped: segments, DD-paths, intervals, classes, and level-i paths. The objective here is to review these techniques on a fundamental level without exhausting all the uses and users of each approach. Copyright © 1977 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： Segments Classes DD Paths Directed graph Intervals Level I Paths Partitioning program graph

来源：评论

学校读者我要写书评

暂无评论

Applying multiple program graphs to modify specifications

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2000年第4期E83D卷 669-678页

作者： Nakanishi, T Saeki, M Tokyo Inst Technol Dept Comp Sci Tokyo 1528552 Japan

In a software maintenance phase, since quanity assurance engineers frequently only change source codes, the consistency between the source codes and their specification documents cannot be kept. In this paper we propose a supporting technique for changing specification documents automatically so that the specifications can be consistent with the source codes. In our technique, we represent a program with multiple graphs and we consider the changes on programs as the modification of the graphs. The modification of the graphs is formalized with a sequence of the operation on the graphs. We design the rules of how to relate the operations on program graphs to the operations on graphs that represent specification documents. By applying these rules, we can detect what modification and which parts of the specification document should be made to maintain the consistency between the specification and the program, when the program is modified.

关键词： program graph software maintenance software evolution reverse engineering

来源：评论

学校读者我要写书评

暂无评论

A MEASURE OF program COMPLEXITY

引用

COMPUTER LANGUAGES 1984年第3-4期9卷 203-208页

作者： STETTER, F FERNUNIV HAGEN FACHBEREICH MATH & INFORMATD-5800 HAGENFED REP GER

We propose a measure of program complexity which takes into account both the relationship between statements and the relationships between statements and data objects (constants and variables). This measure, called pr... 详细信息

关键词： Complexity measures Software metrics program graph

来源：评论

学校读者我要写书评

暂无评论

LANGUAGES AND TRANSLATION TECHNIQUES FOR EXTENSIVE USE OF PARALLEL OPERATIONS

引用

COMPUTING 1975年第1-2期14卷 15-27页

作者： HECHT, V RZEHAK, H UNIV STUTTGART INST INFORMATIKD-7000 STUTTGARTFED REP GER

The basic assumption for the following paper is the availability of as many processors as the possible parallelism in a program requires. Such a system e. g. may be a hybrid system. Based on the single assignment concept, some features and a necessary extention of a CSSL-type language are presented. Therefore a partitioning into the sequential and parallel part has to be performed. The interaction between the sequential and the parallel part is described. A well-suited internal form for the entire program is introduced and the transformation from the sequential program into a graph model for parallel computations is described.

关键词： Modelling Part Logical Variable Control Part Parallel Operation program graph

来源：评论

学校读者我要写书评

暂无评论

One way of estimating frequencies of jumps in a program

引用

Communications of the ACM 1968年第7期11卷 475-480页

作者： Král, Jaroslav Czechoslavak Academy of Sciences Prayne United States

For the segmentation of a program it is useful to have a reasonable estimation of the values of Sij, where Sij is the mean value of the number of jumps from the ith instruction on to the ith instruction in the run time. In the cases where the Sij, are estimated directly, the structure of the whole program must be generally taken into account; therefore it is very difficult for the programmer and/or the translator to obtain a good estimation of the Sij. It is easier to estimate not Sij, but the quantities pij = Sij·ci,/∑jN=1 Sij, where c, is an arbitrary positive constant for each i. Although the pij are, for each i, proportional to Sij, the estimation of pij is easier, because we must estimate only the "probabilities" of events where instruction lj, is executed after instruction li. This estimation can often be done without considering the structure of the whole program. In the first part of the paper, using the theory of the Markov chains, an algorithm for the computation of the Sij from the p , is found, and some ways of obtaining estimates of the pij are given. In the second part a variant of this algorithm is derived, avoiding the necessity of computation involving large matrices.

关键词： control transfers estimation jump frequencies jump frequencies estimation locally estimated jump frequencies Markov chain program correspondence object program reduction one-entry subgraph optimal program segmentation program graph program segmentation algorithm supervisor calls decreasing supervisor overheading decreasing

来源：评论

学校读者我要写书评

暂无评论

A Research of DD Path Automatically Generated System

A Research of DD Path Automatically Generated System

引用

2nd International Conference on Computer Science and Applications (CSA)

作者： Zhang, Juan Liu, Hong-xin Li, Yong-hua Feng, Yu-qing Wuhan Univ Technol Wuhan Hubei Peoples R China Wuhan Social Work Profess Coll Wuhan Hubei Peoples R China

ISBN: (纸本)9781479999613

This paper proposes a method to generate program graph and DD-paths automatically. Firstly, this method makes static analysis on the structured program to get the defining and using information of the variables and the structure of the program. Secondly, it draws the program graph. Thirdly, it generates the DD-paths set of each variable. Based on this method, software tester can generate DD-path automatically in white-box testing, which will reduce tester work burden greatly.

关键词： unit testing DD-paths program graph automated testing tools

来源：评论

学校读者我要写书评

暂无评论

Functional programming in graphs

引用

Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an 1987年第1期10卷 87-97页

作者： Huang, Wei-Teh Institute of Computer Science and Electronic Engineering National Central University Chungli 32054 Taiwan

The notation of functional programming (FP) provides a clear and general syntax for writing programs which have extremely simple semantics and exhibit a clear hierarchical structure. Unfortunately, functional languages have a reputation of being hard to learn. This paper suggests an FP style of programming in which programmers deal with graphs as primary representations in programming, editing and executing programs. programming becomes constructing system by which programs are built up as structured assemblies of functions. The programming technique developed in this paper follows four steps: (1) to define object types;(2) to define type clauses;(3) to construct program graphs;and (4) to automatically convert program graphs into FP programs. These programming processes help programmers easily form clear and correct mental images of a program’s structure and function. © 1987 Taylor & Francis Group, LLC.

关键词： Functional programming program graph Visual programming

来源：评论

学校读者我要写书评

暂无评论

An investigation of the parameters for register allocation during compilation

An investigation of the parameters for register allocation d...

引用

作者： Van Douglas Underwood Naval Postgraduate School

学位级别：硕士

Two established methods of code improvement, Day [U] and Kildall [7], are reviewed. The problems of optimal register allocation are discussed. A method is presented using Kilda1l's [7] optimization algorithm for specifying the active data items in a program. Demonstration of particular problems with register allocation are presented. Topics "for further consideration in a complete soluticn are discussed.

关键词： code improvement program graph register allocation data item active expressions register region basic block common subexpression elimination live variable

来源：评论

学校读者我要写书评

暂无评论

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-370

引用

2016年

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-370 by published by

关键词： basic blocks code code block constant area dataflow dataflow architecture firing rule graph input instruction instructions loop machine code machine graph machine instruction machine instructions mit-lcs-tr-370 program program graph token tokens

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：