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

THE program dependence graph IN STATIC program TESTING

INFORMATION PROCESSING LETTERS 1987年第2期24卷 103-108页

作者： KOREL, B OAKLAND UNIV SCH ENGN & COMP SCIROCHESTERMI 48063

Some new techniques for static program testing are presented. These techniques are based on the program dependence graph, which models the structure of the program in terms of data and control dependences between program instructions. First, a new approach for redundant code detection is offered. The main idea is based on the observation that every program instruction should have influence on the output of the program, otherwise it is considered redundant. Second, an input-output relationship analysis, which reflects the influence of specific input data on specific output data of the program, is offered. It is demonstrated that the presented techniques can increase the number of detectable errors as compared with error detection through data flow analysis alone.

关键词： Static program testing program dependence graph data dependence control dependence redundant code input-output relation

来源：评论

学校读者我要写书评

暂无评论

program dependence graph Generation and Analysis for Source Code Plagiarism Detection;Generering och analys av programberoendegrafer f?r detektering av plagiat i k?llkod

Program Dependence Graph Generation and Analysis for Source ...

引用

作者： Holma, Niklas Linköping University

学位级别：master

Systems and tools that finds similarities among essays and reports are widely used by todays universities and schools to detect plagiarism. Such tools are however insufficient when used for source code comparisons since they are fragile to the most simplest forms of diguises. Other methods that analyses intermediate forms such as token strings, syntax trees and graph representations have shown to be more effective than using simple textual matching methods. In this master thesis report we discuss how program dependence graphs, an abstract representation of a programs semantics, can be used to find similar procedures. We also present an implementation of a system that constructs approximated program dependence graphs from the abstract syntax tree representation of a program. Matching procedures are found by testing graph pairs for either sub-graph isomorphism or graph monomorphism depending on whether structured transfer of control has been used. Under a scenario based evaluation our system is compared to Moss, a popular plagiarism detection tool. The result shows that our system is more or least as effective than Moss in finding plagiarized procedured independently on the type of modifications used.; System och verktyg som hittar likheter mellan uppsatser och rapporter anv?nds i stor omfattning av dagens universitet och skolor f?r att hitta plagiat bland studenters inl?mningar. S?dana verktyg ?r dock otillr?ckliga n?r de anv?nds f?r att j?mf?ra programkod eftersom de ?r svaga mot de enklaste formerna av modifikationer. Andra metoder som analyserar mellanstegsformer s?som tokenstr?ngar, syntaxtr?d och grafrepresentationer har visat sig vara mer effektiva ?n att anv?nda sig av enkla textuella metoder. I denna examensuppsats diskuterar vi hur programberoendegrafer, en abstrakt representation av en programs semantik, kan anv?ndas f?r att hitta j?mf?relsevis liknande procedurer. Vi presenterar ocks? ett system som konstruerar approximerade programberoendegrafer fr?n det

关键词： plagiarism program dependence graph Natural Sciences Computer and Information Science Computer Science Naturvetenskap Data- och informationsvetenskap Datavetenskap (datalogi) Technology teknik Datavetenskap vid LiTH Computer and information science at the Institute of Technology

来源：评论

学校读者我要写书评

暂无评论

Analyzing dependence locality for efficient construction of program dependence graph

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2000年第13期42卷 935-946页

作者： Ohata, F Nishimatsu, A Inoue, K Osaka Univ Grad Sch Engn Sci Osaka 5608531 Japan

A program dependence graph (PDG) is used for computing program slices. To construct a PDG, we need dependency analysis of statements, which is very expensive in terms of memory space and computation time. In order to increase the efficiency of this analysis, we propose an algorithm for constructing a PDG in which several statements share their dependency information. In order not to degrade the precision of the resulting slice, we investigate the dependency locality of statements to be shared. The effectiveness of this approach has been investigated. Our experimental results show that the space utility decreased by 6.72-49.79% and the analysis time decreased by 4.14-33.21%. Also, a criterion on the locality of statement merging has been studied. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： program slice program dependence graph

来源：评论

学校读者我要写书评

暂无评论

A Method for Multi-dimension Evaluation on Vulnerability Based on program dependence graph 5

A Method for Multi-dimension Evaluation on Vulnerability Bas...

引用

Fifth International Conference on Instrumentation & Measurement, Computer, Communication, and Control (IMCCC)

作者： Jia, Wen-chao Hu, Rong-gui Wang, Yong-yi Li, Xue-meng Inst Elect Engn Network Engn Dept Hefei Peoples R China

ISBN: (纸本)9781467377232

This Paper summarizes literature domestic and abroad about the vulnerability evaluation and analyzes the shortcomings of previous evaluation approaches. A novel method based on program dependence graph is presented to implement multi-dimension evaluation on vulnerability. Compared with the previous evaluation models, the new method can access the influence scope and patch fixed situation, which makes the evaluation results complete and accurate proved by the experiment successfully. Finally, we make a conclusion and propose the future research directions in this field.

关键词： vulnerability evaluation program dependence graph vulnerability timeliness

来源：评论

学校读者我要写书评

暂无评论

Fast Condensation of the program dependence graph 13

Fast Condensation of the Program Dependence Graph

引用

34th ACM SIGPLAN Conference on programming Language Design and Implementation (PLDI)

作者： Johnson, Nick P. Oh, Taewook Zaks, Ayal August, David I. Princeton Univ Princeton NJ 08544 USA Intel Corp Haifa Israel

ISBN: (纸本)9781450320146

Aggressive compiler optimizations are formulated around the program dependence graph (PDG). Many techniques, including loop fission and parallelization are concerned primarily with dependence cycles in the PDG. The Directed Acyclic graph of Strongly Connected Components (DAG(SCC)) represents these cycles directly. The naive method to construct the DAG(SCC) first computes the full PDG. This approach limits adoption of aggressive optimizations because the number of analysis queries grows quadratically with program size, making DAG(SCC) construction expensive. Consequently, compilers optimize small scopes with weaker but faster analyses. We observe that many PDG edges do not affect the DAG(SCC) and that ignoring them cannot affect clients of the DAG(SCC). Exploiting this insight, we present an algorithm to omit those analysis queries to compute the DAG(SCC) efficiently. Across 366 hot loops from 20 SPEC2006 benchmarks, this method computes the DAG(SCC) in half of the time using half as many queries.

关键词： Demand-driven analysis dependence analysis program dependence graph Strongly connected components

来源：评论

学校读者我要写书评

暂无评论

Identifying, Tailoring, and Suggesting Form Template Method Refactoring Opportunities with program dependence graph

Identifying, Tailoring, and Suggesting Form Template Method ...

引用

16th European Conference on Software Maintenance and Reengineering (CSMR)

作者： Hotta, Keisuke Higo, Yoshiki Kusumoto, Shinji Osaka Univ Grad Sch Informat & Sci Technol Suita Osaka 5650871 Japan

ISBN: (纸本)9780769546667

Many research efforts have been performed on removing code clones. Especially, it is highly expected that clone removal techniques by applying Form Template Method have high applicability because they can be applied to code clones that have some gaps. Consequently some researchers have proposed techniques to support refactoring with Form Template Method. However, previous research efforts still have some issues. In this paper, we propose a new technique with program dependence graph to resolve these issues. By using program dependence graph, we can handle trivial differences that are unrelated to behavior of a program. Consequently the proposed method can suggest more appropriate removal candidates than previously proposed techniques.

关键词： Code Clones Refactoring Form Template Method program dependence graph Software Maintenance

来源：评论

学校读者我要写书评

暂无评论

Source Code Authorship Attribution Using Hybrid Approach of program dependence graph and Deep Learning Model

引用

IEEE ACCESS 2019年 7卷 141987-141999页

作者： Ullah, Farhan Wang, Junfeng Jabbar, Sohail Al-Turjman, Fadi Alazab, Mamoun Sichuan Univ Coll Comp Sci Chengdu 610065 Sichuan Peoples R China Sichuan Univ Coll Comp Sci Sch Aeronaut & Astronaut Chengdu 610065 Sichuan Peoples R China Manchester Metropolitan Univ Dept Comp & Math Manchester M15 6BH Lancs England Near East Univ Artificial Intelligence Dept TR-99138 Nicosia Turkey Charles Darwin Univ Coll Engn IT & Environm Casuarina NT 0810 Australia

Source Code Authorship Attribution (SCAA) is to find the real author of source code in a corpus. Though, it is a privacy threat to open-source programmers, but, it may be significantly helpful to develop forensic based applications. Such as, ghostwriting detection, copyright dispute settlements, and other code analysis applications. The efficient features extraction is the key challenge for classifying real authors of specific source codes. In this paper, the program dependence graph with Deep Learning (PDGDL) methodology is proposed to identify authors from different programming source codes. First, the PDG is implemented to extract control and data dependencies from source codes. Second, the preprocessing technique is applied to convert PDG features into small instances with frequency details. Third, the Term Frequency Inverse Document Frequency (TFIDF) technique is used to zoom the importance of each PDG feature in source code. Fourth, Synthetic Minority Over-sampling Technique (SMOTE) is applied to tackle the class imbalance problem. Finally, the deep learning algorithm is applied to extract coding styles features for each programmer and to attribute the real authors. The deep learning algorithm is further fine-tuned with drop out layer, learning error rate, loss and activation function, and dense layers for better accuracy of results. The proposed work is analyzed on 1000 programmers data, collected from Google Code Jam (GCJ). The dataset contains three different programming languages, i.e., C, Java, C. The results are appreciable in outperforming the existing techniques from the perspective of classification accuracy, precision, recall, and f-measure metrics.

关键词： Feature extraction Encoding programming Malware Deep learning Forensics Code authorship attribution program dependence graph deep learning software forensics and security software plagiarism

来源：评论

学校读者我要写书评

暂无评论

Enhanced region scheduling on a program dependence graph 25

Enhanced region scheduling on a program dependence graph

引用

Proceedings of the 25th annual international symposium on Microarchitecture

作者： V. H. Allen J. Janardhan R. M. Lee M. Srinivas

来源：评论

学校读者我要写书评

暂无评论

GPLAG: detection of software plagiarism by program dependence graph analysis 06

GPLAG: detection of software plagiarism by program dependenc...

引用

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining

作者： Chao Liu Chen Chen Jiawei Han Philip S. Yu University of Illinois-UC Urbana IL IBM T. J. Watson Research Center Hawthorne NY

ISBN: (纸本)9781595933393

Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source projects for its own products. Although current plagiarism detection tools appear sufficient for academic use, they are nevertheless short for fighting against serious plagiarists. For example, disguises like statement reordering and code insertion can effectively confuse these tools. In this paper, we develop a new plagiarism detection tool, called GPLAG, which detects plagiarism by mining program dependence graphs (PDGs). A PDG is a graphic representation of the data and control dependencies within a procedure. Because PDGs are nearly invariant during plagiarism, GPLAG is more effective than state-of-the-art tools for plagiarism detection. In order to make GPLAG scalable to large programs, a statistical lossy filter is proposed to prune the plagiarism search space. Experiment study shows that GPLAG is both effective and efficient: It detects plagiarism that easily slips over existing tools, and it usually takes a few seconds to find (simulated) plagiarism in programs having thousands of lines of code.

关键词： program dependence graph software plagiarism detection graph mining

来源：评论

学校读者我要写书评

暂无评论

A Method for Multi-dimension Evaluation on Vulnerability Based on program dependence graph

A Method for Multi-dimension Evaluation on Vulnerability Bas...

引用

2015 Fifth International Conference on Instrumentation and Measurement,Computer,Communication and Control (IMCCC2015)(第五届仪器测量、计算机通信与控制国际会议)

作者： Wen-chao Jia Rong-gui Hu Yong-yi Wang Xue-meng Li Network Engineering Department Electronic Engineering Institute Hefei China

ISBN: (纸本)9781467377249

This Paper summarizes literature domestic and abroad about the vulnerability evaluation and analyzes the shortcomings of previous evaluation approaches.A novel method based on program dependence graph is presented to implement multidimension evaluation on *** with the previous evaluation models,the new method can access the influence scope and patch fixed situation,which makes the evaluation results complete and accurate proved by the experiment ***,we make a conclusion and propose the future research directions in this field.

关键词： vulnerability evaluation program dependence graph vulnerability timeliness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：