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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On temporal path conditions in dependence graphs

On temporal path conditions in dependence graphs

引用

7th IEEE International Working Conference on Source Code Analysis and Manipulation

作者： Lochbihler, Andreas Snelting, Gregor Univ Karlsruhe TH Lehrstuhl Programmierparadigmen Karlsruhe Germany

ISBN: (纸本)0769528805

program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express more detailed circumstances of a particular flow;they provide precise necessary conditions for information flow along a path or chop in a dependence graph. Ordinary boolean path conditions, however, cannot express temporal properties, e.g. that for a specific flow it is necessary that some condition holds, and later another specific condition holds. In this contribution, we introduce temporal path conditions, which extend ordinary path conditions by temporal operators in order to express temporal dependencies between conditions for a flow. We present motivating examples, generation and simplification rules, application of model checking to generate witnesses for a specific flow, and a case study. We prove the following soundness property: if a temporal path condition for a path is satisfiable, then the ordinary boolean path condition for the path is satisfiable. The converse does not hold, indicating that temporal path conditions are more precise.

关键词： program dependence graph Path condition Temporal logic Security analysis

来源：评论

学校读者我要写书评

暂无评论

A Mocktail of Source Code Representations 36

A Mocktail of Source Code Representations

引用

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

作者： Vagavolu, Dheeraj Swarna, Karthik Chandra Chimalakonda, Sridhar Indian Inst Technol Tirupati Dept Comp Sci & Engn Tirupati Andhra Pradesh India

ISBN: (纸本)9781665403375

Efficient representation of source code is essential for various software engineering tasks such as code classification and code clone detection. Most recent approaches for representing source code still use AST and do not leverage semantic graphs such as CFG and PDG. One effective technique for representing source code involves extracting paths from the AST and using a learning model to capture program properties. Code2vec is one such path-based approach that uses an attention-based neural network to learn code embeddings which can then be used for various downstream tasks. However, this approach uses only AST and does not leverage CFG and PDG. Even though an integrated graph approach (Code Property graph) exists for representing source code, it has only been explored in the domain of software security. Moreover, it does not leverage the paths from the individual graphs. Our idea is to extend the path-based approach code2vec to include the semantic graphs CFG and PDG with AST, which is largely unexplored in software engineering. We evaluate our approach on the task of METHODNAMING using a C dataset of 730K methods collected from GitHub. In comparison to code2vec, our approach improves the Fl score by 11% on the full dataset and up to 100% with individual projects. We show that semantic features from the CFG and PDG paths drastically improve the performance of the software engineering tasks. We envision that looking at a mocktail of source code representations for various software engineering tasks can lay the foundation for a new line of research and a re-haul of existing research.

关键词： Abstract Syntax Tree Code Embeddings Control Flow graph Method Naming program dependence graph Source Code Representation

来源：评论

学校读者我要写书评

暂无评论

Algorithm for Control dependence Subgraph Construction

Algorithm for Control Dependence Subgraph Construction

引用

International Forum on Information Technology and Applications (IFITA 2009)

作者： Chen Duanzhi Wuhan Univ Sch Comp Wuhan 430072 Peoples R China

ISBN: (纸本)9780769536002

program slicing provides a new way to software maintenance, program understanding. It can give the programmer the statements only relevant to the computation of a given function. It can transform a large program into a smaller one. In this paper, we present a new algorithm to produce Control dependence Subgraph which is used in program slicing. The Control dependence Subgraph is used to collect the control dependence of the statements. The Data dependence Subgraph is used to collect the data dependence of the statements. With these two subgraphs we can construct the program dependence graph and compute the program slice through traversing the program dependence graph. The algorithm uses an input called F(p) which models each program in the form of an algebraic expression.

关键词： program slicing Control dependence Subgraph program dependence graph F(p) Algebraic expressions

来源：评论

学校读者我要写书评

暂无评论

Computation of dynamic slices for object-oriented concurrent programs

Computation of dynamic slices for object-oriented concurrent...

引用

12th Asia-Pacific Software Engineering Conference

作者： Lallchandani, JT Mall, R DD Univ Dept Comp Engg Nadiad India

ISBN: (纸本)0769524656

This paper proposes a novel dynamic slicing technique for object oriented concurrent programs. We introduce the notion of Object Oriented Concurrent program dependence graph (OOCPDG). Our dynamic slicing technique uses OOCPDG as the intermediate representation and is based on marking and unmarking the dependence edges as and when the dependences arise and cease at runtime. Our approach eliminates the use of trace files and is more efficient than existing algorithms. Besides, it encompasses different aspects of object oriented programming paradigm viz. inheritance, polymorphism from the slicing arena. It can handle dynamically created object based processes. It can also handle process interactions through shared memory and message passing. The updating to the intermediate representation is truly concurrent. Multiple processors execute different object based processes concurrently and require special handling. We also report a dynamic slicing tool called CDSOOCP (Concurrent Dynamic Slicer for Object Oriented Concurrent programs) which implements our dynamic slicing technique.

关键词： concurrent program program slicing static slicing dynamic slicing program dependence graph object-oriented concurrent program program debugging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：