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

26th ACM International Conference on Evaluation and Assessment in Software Engineering, EASE 2022

作者： Bertrand, Sébastien Favier, Pierre-Alexandre André, Jean-Marc Onepoint France University of Bordeaux IMS Laboratory UMR 5218 CNRS France

ISBN: (纸本)9781450396134

As a part of a research project concerning software maintainability assessment in collaboration with the development team, we were interested in the frequent use of metrics as predictors. Many metrics exist, often with opaque and arguable implementations. We claim metrics mix the assessment of presentation, structure and model. In order to focus on true detectable maintainability defects, we computed metrics solely based on the structure of the program. Our approach was to parse the source code of Java programs as a graph, and to compute metrics in a declarative query language. To this end, we developed Javanalyser and implemented 34 metrics using Spoon to parse Java programs and Neo4j as graph database. We will show that the program graph constitutes a steady basis to compute metrics and conduct future machine-learning studies to assess maintainability. © 2022 ACM.

关键词： program graphs Software Maintainability program Analysis

来源：评论

学校读者我要写书评

暂无评论

Improving Bug Detection via Context-Based Code Representation Learning and Attention-Based Neural Networks

引用

PROCEEDINGS OF THE ACM ON programMING LANGUAGES-PACMPL 2019年第OOPSLA期3卷 1–30页

作者： Li, Yi Wang, Shaohua Nguyen, Tien N. Son Van Nguyen New Jersey Inst Technol Dept Informat Newark NJ 07102 USA Univ Texas Dallas Comp Sci Dept 800 W Campbell Rd Richardson TX 75080 USA

Bug detection has been shown to be an effective way to help developers in detecting bugs early, thus, saving much effort and time in software development process. Recently, deep learning-based bug detection approaches have gained successes over the traditional machine learning-based approaches, the rule-based program analysis approaches, and mining-based approaches. However, they are still limited in detecting bugs that involve multiple methods and suffer high rate of false positives. In this paper, we propose a combination approach with the use of contexts and attention neural network to overcome those limitations. We propose to use as the global context the program Dependence Graph (PDG) and Data Flow Graph (DFG) to connect the method under investigation with the other relevant methods that might contribute to the buggy code. The global context is complemented by the local context extracted from the path on the AST built from the method's body. The use of PDG and DR;enables our model to reduce the false positive rate, while to complement for the potential reduction in recall, we make use of the attention neural network mechanism to put more weights on the buggy paths in the source code. That is, the paths that are similar to the buggy paths will be ranked higher, thus, improving the recall of our model. We have conducted several experiments to evaluate our approach on a very large dataset with +4.973M methods in 92 different project versions. The results show that our tool can have a relative improvement up to 160% on F-score when comparing with the state-of-the-art bug detection approaches. Our tool can detect 48 true bugs in the list of top 100 reported bugs, which is 24 more true bugs when comparing with the baseline approaches. We also reported that our representation is better suitable for bug detection and relatively improves over the other representations up to 206% in accuracy.

关键词： Bug Detection Deep Learning Code Representation Learning Network Embedding program graphs Attention Neural Networks

来源：评论

学校读者我要写书评

暂无评论

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-064

引用

2016年

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-064 by published by

关键词： cycle cycle free enabling function execution execution sequence execution sequences graph graphs input loop loop junction loop junctions loop output mit-lcs-tr-064 node nodes output link program program graph program graphs sequence

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT HEURISTIC ALGORITHM FOR MAPPING PARALLEL programS ONTO MULTICOMPUTERS

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROprogramMING 1993年第2期36卷 83-92页

作者： SELVAKUMAR, S MURTHY, CSR INDIAN INST TECHNOL DEPT COMP SCI & ENGNMADRAS 600036TAMIL NADUINDIA

Mapping, a crucial problem to be solved for optimal utilization of multicomputers, is the problem of allocating the tasks of a parallel program to the processors of a multicomputer in a way that minimizes the total completion time. Unfortunately, this problem is known to be NP-hard and hence we cannot optimally solve it in a reasonable amount of computation time. In this paper, we present a new heuristic algorithm for solving the mapping problem. Our heuristic move-exchange (HME) algorithm works by iterating a sequence of task moves followed by a task exchange in an efficient way and tries to minimize the completion time by minimizing a cost function. This function is a weighted sum of the cost of load imbalance and the cost of all communications. We then present two. competing algorithms, viz. the Simulated Annealing (SA) algorithm and the Recursive Mincut (RM) bipartitioning algorithm, and compare the performance of the HME algorithm with that of SA and RM algorithms. The results of our study clearly demonstrate that our HME algorithm is better than both SA and RM algorithms for solving the mapping problem.

关键词： MAPPING program graphs MULTICOMPUTERS HEURISTICS SIMULATED ANNEALING MINCUT BIPARTITIONING

来源：评论

学校读者我要写书评

暂无评论

PROCESSOR ALLOCATION FOR HORIZONTAL AND VERTICAL PARALLELISM AND RELATED SPEEDUP BOUNDS

引用

IEEE TRANSACTIONS ON COMPUTERS 1987年第4期36卷 410-420页

作者： POLYCHRONOPOULOS, CD BANERJEE, U UNIV ILLINOIS DEPT ELECT & COMP ENGNURBANAIL 61801 CONTROL DATA CORP DEPT ADV COMPILER PRODSUNNYVALECA 94089

The main aim of the paper is to study allocation of processors to, parallel programs executing on a multiprocessor system, and the resulting speedups. First, we consider a parallel program as a sequence of steps where each step consists of a set of parallel operations. General bounds on the speedup on a p- processor system are derived based on this model. Measurements of code parallelism for the, LINPACK numerical package are presented to support the belief that typical numerical programs contain much potential parallelism that can be discovered by a good restructuring compiler. Next, a parallel program is represented as a task graph whose nodes are do across loops (i.e., loops whose iterations can be partially, overlapped). It is shown how processors can be allocated to exploit horizontal and vertical parallelism in such graphs. Two processor allocation heuristic algorithms (WP and PA) are presented. PA is the heart of the WP and is used to obtain efficient processor allocations for a set of independent parallel tasks. WP allocates processors to general task graphs. Finally, a general formula for the speedup of a DO across loop is given that is more accurate than the known formula.

关键词： DO all and DO across loops multiprocessors parallel Fortran programs program graphs program speedup speedup bounds vector machines

来源：评论

学校读者我要写书评

暂无评论

GRAPH TRANSLATION SCHEMES TO GENERATE COMPILER PARTS

引用

ACM TRANSACTIONS ON programMING LANGUAGES AND SYSTEMS 1987年第4期9卷 473-490页

作者： SONNENSCHEIN, M Aachen Univ. of Technology Aachen W. Germany

Graph translation schemes (GTSs) are a generalization of attribute grammars and of some ideas in Koster's language CDL2 They are specially designed to support a compiler writer in defining parts of the back-end of his compiler, but they can also be useful for the specification of the analysis pass of a compiler. GTSs combine elements of functional and of algorithmic specification techniques to allow iterative attribute evaluation and attributing of program graphs. GTSs consist of only a few syntactical elements. We present operational semantics and discuss improvements in the efficiency of the proposed implementation of GTSs.

关键词： Attribute grammars data flow analysis grammars graph-oriented intermediate languages program graphs

来源：评论

学校读者我要写书评

暂无评论

program graphs AND EXECUTION BEHAVIOR

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1983年第1期9卷 103-108页

作者： OLDEHOEFT, RR Department of Computer Science Colorado State University

A technique is proposed for predicting the execution behavior of a source program or a software design specification. As a byproduct of syntactic analysis, a program graph is constructed that can subsequently be treated as the graph of a finite automation. The expression for execution behavior is the regular expression of the graph. Several simplification techniques for these expressions are reviewed and exemplified. Specifically, the substitution of known values for program segments followed by constant folding cannot be carried out indiscriminately. The permissible situations are therefore characterized. Applications include: 1. program restructuring, 2. prediction of the execution time for a software design or a program, and 3. other forms of language analysis.

关键词： Regular Expressions Constant Folding Control Flow Analysis Performance Prediction program graphs

来源：评论

学校读者我要写书评

暂无评论

program graphs, an Algebra, and Their Implication for programming

引用

IEEE Transactions on Software Engineering 1975年第3期SE-1卷 286-291页

作者： Paige, Michael R. Sperry Rand Corporate Research Center Sudbury Mass. United States

Current interests in software engineering have posed serious questions about the evolution of programs and languages. Computer programs are not simply collections of statements;they involve specific structural relationships between the programelements. program structure has been discussed as being an important influence on the ease With which programs can be constructed, verified, understood, and changed. The discipline of “structured programming” has been developed because computer scientists have sought to better control and understand the programming *** graphs have been used as a vehicle to focus attention on the structure of a program. In this paper a systematic methodology for partitioning a program graph (digraph) to highlight the relationships between program elements is. introduced along with an attendant notation. This notation is described in purely mathematical terms in the first section, and then the programming-related implications of this approach are addressed in the second section. Copyright © 1975 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： Partitioning program graphs program structure structured programming

来源：评论

学校读者我要写书评

暂无评论

An algorithm for tracing live variables based on a straightened program graph

引用

International journal of computer mathematics 1975年第1-4期5卷 97-108页

作者： J. C. Beatty [a]Data Processing Product Group International Business Machines Corp. P.O. Box 390 South Road Poughkeepsie N.Y. 12602 U.S.A.

An algorithm is given for finding where the variables of a program are active or live. While the algorithm is modeled after that of Kennedy, it is based on the flow graph straightening procedure of Earnest, Balke, and Anderson, rather than on Cocke-Allen intervals. Thus it can be applied to any program, without appeal to any additional mechanism such as node splitting.

关键词： control flow graphs compiler optimization data flow analysis program graphs global register allocation 4.12 5.14 5.32 5.39

来源：评论

学校读者我要写书评

暂无评论

PARALLEL TASK EXECUTION IN A DECENTRALIZED SYSTEM

引用

IEEE TRANSACTIONS ON COMPUTERS 1972年第12期C 21卷 1310-1322页

作者： GONZALEZ, MJ RAMAMOORTHY, CV UNIV TEXAS AUSTIN TX 78712 USA UNIV CALIF DEPT ELECT & COMP SCI BERKELEY CA 94720 USA

The overhead involved in the real-time multiprocessor execution of parallel-processable segments of a sequential program is investigated. The execution follows a preprocessing phase in which the source program is analyzed and the parallel-processable segments are recognized. A number of representations of a parallel-processable program are possible. A table representation is used, and a technique is developed to efficiently interpret this table in a system in which a number of identical processors share a common memory.

关键词： Centralized decentralized operating systems parallel processors program graphs task schedules task tables.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：