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 in...
详细信息
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.
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 th...
详细信息
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.
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 propo...
详细信息
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.
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 language...
详细信息
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.
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...
详细信息
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 program flow complexity, can be calculated from the source text of a program in an easy way.
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 relati...
详细信息
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 conc...
详细信息
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.
暂无评论