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

20th Working Conference on Reverse Engineering

作者： Xing, Zhenchang Xue, Yinxing Jarzabek, Stan Nanyang Technol Univ Singapore 639798 Singapore Natl Univ Singapore Singapore Singapore

ISBN: (纸本)9781479929313

Clone detectors find similar code fragments and report large numbers of them for large systems. Textually similar clones may perform different computations, depending on the program context in which clones occur. Understanding these contextual differences is essential to distill useful clones for a specific maintenance task, such as refactoring. Manual analysis of contextual differences is time consuming and error-prone. To mitigate this problem, we present an automated approach to helping developers find and analyze contextual differences of clones. Our approach represents context of clones as program dependence graphs, and applies a graph differencing technique to identify required contextual differences of clones. We implemented a tool called CloneDifferentiator that identifies contextual differences of clones and allows developers to formulate queries to distill candidate clones that are useful for a given refactoring task. Two empirical studies show that CloneDifferentiator can reduce the efforts of post-detection analysis of clones for refactorings.

关键词： Clone analysis program dependence graph graph matching

来源：评论

学校读者我要写书评

暂无评论

LLVM-Based Code Clone Detection Framework 10

LLVM-Based Code Clone Detection Framework

引用

Tenth International Conference on Computer Science and Information Technologies Revised Selected Papers CSIT

作者： Avetisyan, Arutyun Kurmangaleev, Shamil Sargsyan, Sevak Arutunian, Mariam Belevantsev, Andrey Russian Acad Sci Inst Syst Programming Moscow Russia

ISBN: (纸本)9781467375627

Existed methods of code clones detection have some restrictions. Textual and lexical approaches cannot detect strongly modified fragments of code. Syntactic and metrics based approaches detect strong modifications with low accuracy. On the contrary, semantic approach accurately detects the cloned fragments of code with small changes as well as the strongly modified ones. Methods based on this approach are not scalable for analysis of large projects. This paper describes LLVM-based code clone detection framework, which uses program semantic analysis. It has high accuracy and is scalable for analysis million lines of source code. The tool embeds a testing system, which allows generating code clones for the project automatically. It is used for determining the developed algorithms accuracy. The instrument is applicable for all languages that can be compiled to LLVM bitcode. Proposed method was compared with two widely used tools MOSS and CloneDR. Results show that it has higher accuracy. The tool is scalable for analysis of linux-2.6 kernel, which has about fourteen millions lines of source code.

关键词： code clone program dependence graph LLVM

来源：评论

学校读者我要写书评

暂无评论

CCgraph: a PDG-based code clone detector with approximate graph matching 35

CCGraph: a PDG-based code clone detector with approximate gr...

引用

35th IEEE/ACM International Conference on Automated Software Engineering (ASE)

作者： Zou, Yue Ban, Bihuan Xue, Yinxing Xu, Yun Univ Sci & Technol China Sch Comp Sci & Technol Hefei Peoples R China Univ Sci & Technol China Sch Data Sci Hefei Peoples R China Key Lab High Performance Comp Hefei Anhui Peoples R China

ISBN: (纸本)9781450367684

Software clone detection is an active research area, which is very important for software maintenance, bug detection, etc. The two pieces of cloned code reflect some similarities or equivalents in the syntax or structure of the code representations. There are many representations of code like AST, token, PDG, etc. The PDG (program Dependency graph) of source code can contain both syntactic and structural information. However, most existing PDG-based tools are quite time-consuming and miss many clones because they detect code clones with exact graph matching by using subgraph isomorphism. In this paper, we propose a novel PDG-based code clone detector, CCgraph, that uses graph kernels. Firstly, we normalize the structure of PDGs and design a two-stage filtering strategy by measuring the characteristic vectors of codes. Then we detect the code clones by using an approximate graph matching algorithm based on the reforming WL (Weisfeiler-Lehman) graph kernel. Experiment results show that CCgraph retains a high accuracy, has both better recall and F1-score values, and detects more semantic clones than other two related state-of-the-art tools. Besides, CCgraph is much more efficient than the existing PDG-based tools.

关键词： Clone detection program dependence graph WL graph kernel

来源：评论

学校读者我要写书评

暂无评论

CCSharp: An Efficient Three-phase Code Clone Detector Using Modified PDGs 24

CCSharp: An Efficient Three-phase Code Clone Detector Using ...

引用

24th Asia-Pacific Software Engineering Conference (APSEC)

作者： Wang, Min Wang, Pengcheng Xu, Yun Univ Sci & Technol China Sch Comp Sci Hefei 230027 Anhui Peoples R China Natl Univ Def Technol Lab High Performance Comp Anhui Prov Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Collaborat Innovat Ctr High Performance Comp Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781538636817

Detecting code clones in software systems is becoming more and more important with the blossom of open source projects. In spite of numerous active researches, there is still a lack of detecting clones especially high-level clones efficiently and accurately. In this paper, we present CCSharp, a three-phase PDG-based clone detector which can detect much more clones besides high-level ones in software systems. To solve the problem of PDG-based tool's high time cost, we adopt two strategies to decrease the overall computing quantity of our tool: PDG's structure modification and characteristic vector filtering. In PDG's structure modification, we propose a novel technique to merge procedure invocation nodes which can make clone detection get rid of influence of procedure's parameters and disguise as well as downscale PDG's structure. We proceed clone detection on both real-world and artificial codebase by CCSharp along with other three state-of-the-art tools. Experiment results show that CCSharp has both high recall and precision, and can detect much more unique clones compared with the other three tools.

关键词： code clone detection program dependence graph PDG modification characteristic vector filtering

来源：评论

学校读者我要写书评

暂无评论

Decentralizing execution of composite web services

Decentralizing execution of composite web services

引用

19th Conference on Object-Oriented programming, Systems, Languages, and Applications

作者： Nanda, MG Chandra, S Sarkar, V IBM Corp TJ Watson Res Ctr Armonk NY 10504 USA

Distributed enterprise applications today are increasingly being built from services available over the web. A unit of functionality in this framework is a web service;a software application that exposes a set of "typed" connections that can be accessed over the web using standard protocols. These units can then be composed into a composite web service. BPEL (Business Process Execution Language) is a high-level distributed programming language for creating composite web services. Although a BPEL program invokes services distributed over several servers, the orchestration of these services is typically under centralized control. Because performance and throughput are major concerns in enterprise applications, it is important to remove the inefficiencies introduced by the centralized control. In a distributed, or decentralized orchestration, the BPEL program is partitioned into independent sub-programs that interact with each other without any centralized control. Decentralization can increase parallelism and reduce the amount of network traffic required for an application. This paper presents a technique to partition a composite web service written as a single BPEL program into an equivalent set of decentralized processes. It gives a new code partitioning algorithm to partition a BPEL program represented as a program dependence graph, with the goal of minimizing communication costs and maximizing the throughput of multiple concurrent instances of the input program. In contrast, much of the past work on dependence-based partitioning and scheduling seeks to minimize the completion time of a single instance of a program running in isolation. The paper also gives a cost model to estimate the throughput of a given code partition. Experimental results show that decentralized execution can substantially increase the throughput of example composite services, with improvements of approximately 30% under normal system loads and by a factor of two under high system loads.

关键词： workflow business process program dependence graph

来源：评论

学校读者我要写书评

暂无评论

Compilation techniques for a reconfigurable LIW architecture

引用

The Journal of Supercomputing 1989年第4期3卷 271-304页

作者： Gupta, Rajiv Soffa, Mary Lou Philips Laboratories North American Philips Corporation Briarcliff Manor 10510 NY 345 Scarborough Road United States Department of Computer Science University of Pittsburgh Pittsburgh 15260 PA United States

Matching an application to an architecture in structure and size is a way of achieving higher computation speed. This paper presents a combination of a compiler and a reconfigurable long instruction word (RLIW) architecture as an approach to the matching problem. Configurations suitable for the execution of different parts of a program are determined by a compiler, and code is generated for both reconfiguring the hardware and performing the computation. The RLIW machine, consisting of multiple processing and global data memory modules, effectively utilizes the fine-grained parallelism detected in programs by a compiler. The long word instructions control the operation of processing and memory modules in the system. To reduce the data transfer between processing modules and data memory modules, we provide reconfigurable interconnections among the processing modules which permit direct communication. The compiler uses new techniques, including region scheduling, generation of code for reconfiguration of the system, and memory allocation techniques, to achieve improved performance. Algorithms for packing operations into long word instructions and techniques for effectively assigning memory modules to the operands required by an instruction are developed. Results of the experiments to evaluate the system indicate that speedups of 60-300% can be obtained for both scientific and nonscientific programs. The reconfigurable architecture is responsible for much of the speedup. Also, the results indicate that the major problem of memory bottleneck faced in designing parallel systems is successfully attacked. © 1989 Kluwer Academic Publishers.

关键词： code optimizations code scheduling fine-grained parallelism long instruction word parallel memories program dependence graph reconfigurable architecture

来源：评论

学校读者我要写书评

暂无评论

Experiences with PDG-Based IFC 10

Experiences with PDG-Based IFC

引用

2nd International Symposium on Engineering Secure Software and Systems

作者： Hammer, Christian Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9783642117466

Information flow control systems provide the guarantees that are required in today's security-relevant systems. While the literature has produced a wealth of techniques to ensure a given security policy, there is only a small number of implementations, and even these are mostly restricted to theoretical languages or a subset of an existing language. Previously, we presented the theoretical foundations and algorithms for dependence-graph-based information flow control (IFC). As a complement, this paper presents the implementation and evaluation of our new approach, the first implementation of a dependence-graph based analysis that accepts full Java bytecode. It shows that the security policy can be annotated in a succinct manner;and the evaluation shows that the increased runtime of our analysis-a result of being flow-, context-, and object-sensitive-is mitigated by better analysis results and elevated practicability. Finally, we show that the scalability of our analysis is not limited by the sheer size of either the security lattice or the dependence graph that represents the program.

关键词： software security noninterference program dependence graph information flow control evaluation

来源：评论

学校读者我要写书评

暂无评论

A Collaborative dependence Analysis Framework

A Collaborative Dependence Analysis Framework

引用

IEEE/ACM International Symposium on Code Generation and Optimization (CGO)

作者： Johnson, Nick P. Fix, Jordan Beard, Stephen R. Oh, Taewook Jablin, Thomas B. August, David I. Princeton Univ Princeton NJ 08544 USA UIUC Multicoreware Princeton NJ USA

ISBN: (纸本)9781509049318

Compiler optimizations discover facts about program behavior by querying static analysis. However, developing or extending precise analysis is difficult. Some prior works implement analysis with a single algorithm, but the algorithm becomes more complex as it is extended for greater precision. Other works achieve modularity by implementing several simple algorithms and trivially composing them to report the best result from among them. Such a modular approach has limited precision because it employs only one algorithm in response to one query, without synergy between algorithms. This paper presents a framework for dependence analysis algorithms to collaborate and achieve precision greater than the trivial combination of those algorithms. With this framework, developers can achieve the high precision of complex analysis algorithms through collaboration of simple and orthogonal algorithms, without sacrificing the ease of implementation of the modular approach. Results demonstrate that collaboration of simple analyses enables advanced compiler optimizations.

关键词： Collaborative analysis Demand-driven analysis dependence analysis program dependence graph

来源：评论

学校读者我要写书评

暂无评论

A STUDY OF program SLICING TECHNIQUES FOR SOFTWARE DEVELOPMENT APPROACHES 1

A STUDY OF PROGRAM SLICING TECHNIQUES FOR SOFTWARE DEVELOPME...

引用

1st International Conference on Next Generation Computing Technologies (NGCT)

作者： Chandra, Alaknanda Singhal, Abhishek Bansal, Abhay Amity Univ Dept CSE Sect 125 Noida Uttar Pradesh India

ISBN: (纸本)9781467368094

program Slicing minimizes the program to sub-statements, which produces the same behaviour where the subset of the program also called the program slice comprises of the chunks or statements of the program which impact the values calculated at a point of absorption called as the slicing criterion. The concept of slicing was introduced by Weiser using a data-flow diagram [1]. If you look at static slicing, it does not make any suppositions about the input of a particular program, whereas the dynamic slicing counts on a distinct test case. Object-oriented programming is an extensively used software development technique. In this paper, we will create an approach to compute a static slice as well as a dynamic slice of a set of programs by creating an intermediary representation of the program, i.e. a Java program dependence graph and Java system dependence graph (JSysDG) (in case of multiple functions) and then use it as input and apply the slicing algorithm in order to compute slice of the program with respect to the slicing criterion and analyze the results as well.

关键词： program Slicing program dependence graph System dependence graph Static Slicing Dynamic Slicing Slicing criterion

来源：评论

学校读者我要写书评

暂无评论

program Plagiarism Detection with Dynamic Structure 7

Program Plagiarism Detection with Dynamic Structure

引用

7th IEEE International Symposium on Next-Generation Electronics (ISNE) - Next-Generation Electronics for AI and 5G Communications

作者： Kuo, Jong-Yih Cheng, Hsuan-Kuei Wang, Ping-Feng Natl Taipei Univ Technol Dept Comp Sci & Informat Engn Taipei 106 Taiwan Inst Informat Ind Taipei 106 Taiwan

ISBN: (纸本)9781538614457

The paper proposed an automated program alignment system, SPDS (Structure Plagiarism Detection System) which allows users to determine whether there is any possibility of plagiarism among them. The dynamic slicing was used to analyze the behavior of the function, combining the combinatorial decision coverage to generate valid inputs, and convert the results to the program dependence graph to calculate the similarity of the behavioral part. The similarity of the variable and comment are calculated by cosine similarity and winnowing algorithm. Finally, the weight of each similarity can be adjusted by the user or decided by the system depends on the different situation. The experimental result shows that our proposed system can have better similarity measure result than JPlag, MOSS, and SPD.

关键词： program Plagiarism Dynamic Slicing Plagiarism Detection program dependence graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：