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

3rd ieee international workshop on source code analysis and manipulation, SCAM 2003

ISBN: (纸本)0769520057

The proceedings contain 21 papers. The topics discussed include: online cycle detection and difference propagation for pointer analysis;improving the static analysis of loops by dynamic partitioning techniques;applying Meyer's taxonomy to object-oriented software systems;power law distributions in class relationships;the Java system dependence graph;design of the codeBoost transformation system for domain-specific optimization of C++ programs;managing multi-billion dollar it budgets using source code analysis;barrier slicing and chopping;static slicing of reactive programs;design and implementation of bytecode-based java slicing system;inter-procedural static slicing of binary executables;towards managing environment dependence during legacy systems renovation and maintenance;turning dynamic typing into static typing by program specialization in a compiler front-end for octave;and unique renaming of Java using source transformation.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Detection of redundant code using R²D² 3

Detection of redundant code using R<SUP>2</SUP>D<SUP>2</SUP>

引用

3rd ieee international workshop on source code analysis and manipulation

作者： Leitao, AM Univ Tecn Lisboa INESC ID P-1000029 Lisbon Portugal

ISBN: (纸本)0769520057

We present the (rd2)-D-2 redundancy detector. (rd2)-D-2 identifies redundant code fragments in large software systems written in Lisp. For each pair of code fragments, (rd2)-D-2 uses a combination of techniques ranging from syntax-based analysis to semantics-based analysis, that detects positive and negative evidences regarding the redundancy of the analyzed code fragments. These evidences are combined according to a well-defined model and sufficiently redundant fragments are reported to the user. (rd2)-D-2 explores several techniques and heuristics to operate within reasonable time and space bounds and is designed to be extensible.

关键词： Cloning Computer languages Detectors Force measurement Productivity Programming profession Software measurement Software systems Time measurement Writing

来源：评论

学校读者我要写书评

暂无评论

Barrier slicing and chopping 3

Barrier slicing and chopping

引用

3rd ieee international workshop on source code analysis and manipulation

作者： Krinke, J Univ Passau D-8390 Passau Germany

ISBN: (纸本)0769520057

One of the critiques on program slicing is that slices presented to the user are hard to understand. This is partly due to bad user interfaces, but mainly related to the problem that slicing 'dumps' the results onto the user without any explanation. This work will present an approach that can be used to 'filter' slices. This approach basically introduces 'barriers' which are not allowed to be passed during slice computation. An earlier filtering approach is chopping which is also extended to obey such a barrier The barrier variants of slicing and chopping provide filtering possibilities for smaller slices and better comprehensibility.

关键词： Computer science Conferences Data analysis Data flow computing Data mining Filtering Iterative methods Programming profession Reachability analysis User interfaces

来源：评论

学校读者我要写书评

暂无评论

Managing multi-billion dollar IT budgets using source code analysis 3

Managing multi-billion dollar IT budgets using source code a...

引用

3rd ieee international workshop on source code analysis and manipulation

作者： Verhoef, C Free Univ Amsterdam Dept Comp Sci Amsterdam Netherlands

ISBN: (纸本)0769520057

We present a quantitative approach for IT portfolio management. This is an approach that CMM level I organizations can use to obtain a corporate wide impression of the state of their total IT portfolio, how IT costs spent today project into the budgets of tomorrow, how to assess important risks residing in an IT portfolio, and to explore what-if scenarios for future IT investments. Our quantitative approach enables assessments of proposals from business units, risk calculations, cost comparisons, estimations of total cost of ownership of entire IT portfolios, and more. Our approach has been applied to several organizations with annual multibillion dollar IT budgets each, and has been instrumental for executives in coming to grips with the largest production factor in their organizations: information technology.

关键词： Computer science Coordinate measuring machines Costs Financial management Instruments Investments Performance analysis Portfolios Proposals Thumb

来源：评论

学校读者我要写书评

暂无评论

Online cycle detection and difference propagation for pointer analysis 3

Online cycle detection and difference propagation for pointe...

引用

3rd ieee international workshop on source code analysis and manipulation

作者： Pearce, DJ Kelly, PHJ Hankin, C Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2BZ England

ISBN: (纸本)0769520057

This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is formulated as a graph of set constraints and solved using a worklist algorithm. Indirections lead to new constraints being added during this process. In this work, we present a new algorithm for online cycle detection, and a difference propagation technique which records changes in a variable's solution. Effectiveness of these and other methods are evaluated experimentally using nine common 'C' programs ranging between 1000 to 55000 lines of code.

关键词： Algorithm design and analysis Change detection algorithms Conferences Educational institutions Runtime

来源：评论

学校读者我要写书评

暂无评论

Static slicing of reactive programs 3

Static slicing of reactive programs

引用

3rd ieee international workshop on source code analysis and manipulation

作者： Kulkarni, AR Ramesh, S Indian Inst Technol KR Sch Informat Technol Bombay 400076 Maharashtra India

ISBN: (纸本)0769520057

This paper extends the well-known technique of program slicing to synchronous reactive programs like Esterel. Reactive programs are event-oriented and maintain continuous interaction with the environment. The traditional definition of slicing that preserves the values of a program variable at a particular program point is not natural for reactive programs. We have given a new notion of slicing that preserves the ongoing behaviour of a program with respect to one or more events. The classical definition of control dependency is inadequate for correctly capturing all the control dependencies in reactive programs. Two such dependencies are interference control dependency and time dependency. A slicing algorithm, based upon the proposed definition of slicing, is also presented.

关键词： Algorithm design and analysis Computer languages Computer science Concurrent computing Control systems Debugging Hardware design languages Information technology Interference Testing

来源：评论

学校读者我要写书评

暂无评论

Unique renaming of Java using source transformation 3

Unique renaming of Java using source transformation

引用

3rd ieee international workshop on source code analysis and manipulation

作者： Guo, XP Cordy, JR Dean, TR Queens Univ Sch Comp Kingston ON K7L 3N6 Canada

ISBN: (纸本)0769520057

This paper presents a method for unique renaming declarations and references in Java programs using source transformation to XML markup. Each entity declaration and reference in the Java program is assigned a globally unique identifier (UID) based on its declaration scope and file. The UID serves as a key by which the entity's original declaration and all references can be found, and more importantly, by which information about the entity can be stored or retrieved from the design database. The resulting uniquely renamed source code makes it convenient and efficient to do. further business logic and technical analysis that crosses the boundary between source code and the design database. UIDs are attached to entity references in the source code using XML markup, so that both the UID and the original source text of the declaration or reference are available in the renamed source program. While it is possible to generate unique names in an ad hoc manner, we show how to generate them using a combination of source transformations and design database inferences. This ensures that the notion of UID is consistent and well defined.

关键词： Computer crime Conferences Databases Encoding Information analysis Java Joining processes Libraries Packaging XML

来源：评论

学校读者我要写书评

暂无评论

Detection of redundant code using R²D²

引用

SOFTWARE QUALITY JOURNAL 2004年第4期12卷 361-382页

作者： Leitao, AM Univ Tecn Lisboa INESC ID P-1000029 Lisbon Portugal

关键词：

来源：评论

学校读者我要写书评

暂无评论

XOgastan: XML-oriented gcc AST analysis and transformations 3

XOgastan: XML-oriented gcc AST analysis and transformations

引用

3rd ieee international workshop on source code analysis and manipulation

作者： Antoniol, G Di Penta, M Masone, G Villano, U Univ Sannio Dept Engn RCOST I-82100 Benevento Italy

ISBN: (纸本)0769520057

Software maintenance, program analysis and transformation tools almost always rely on static source code analysis as the first and fundamental step to gather information. In the past, two different strategies have been adopted to develop tool suites. There are tools encompassing or implementing the source parse step, where the parser is internal to the toolkit, developed and maintained with it. A different approach builds tools on the top of external, already available, components such as compilers that output the abstract syntax tree, or make it available via an API. This paper presents an approach and a tool, XOgastan, developed exploiting the gcc/g++ ability to save a representation of the intermediate abstract syntax tree into a file. XOgastan translates the gcc/g++ format into a Graph eXchange Language representation, thus taking advantage of the high number of currently available XML tools for the subsequent analysis phases. Here the tool is illustrated and its design is discussed, showing its architecture and the main implementation choices.

关键词： source code analysis tools gcc XML GXL

来源：评论

学校读者我要写书评

暂无评论

Improving the static analysis of loops by dynamic partitioning techniques 3

Improving the static analysis of loops by dynamic partitioni...

引用

3rd ieee international workshop on source code analysis and manipulation

作者： Martel, M CEA LIST DTSI SLA F-91191 Gif Sur Yvette France

ISBN: (纸本)0769520057

Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of the set of control points determines the states of an execution trace for which a common property must be found. In this article, we focus on sufficient conditions to substitute one control flow graph for another during an analysis. Next, we introduce a dynamic partitioning algorithm that improves the precision of the calculated invariants by deciding dynamically how to map the states of the traces to the control points, depending on the properties resulting from the first steps of the analysis. In particular this algorithm enables the loops to be unfolded only if this improves the precision of the final invariants. Its correctness stems from the fact that it uses legal graph substitutions.

关键词： Algorithm design and analysis Assembly Conferences Flow graphs Heuristic algorithms Law Legal factors Merging Partitioning algorithms Sufficient conditions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：