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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

934 篇 会议
23 篇 期刊文献
1 册 图书

馆藏范围

958 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

609 篇 工学
- 550 篇 软件工程
- 414 篇 计算机科学与技术...
- 133 篇 电气工程
- 15 篇 控制科学与工程
- 14 篇 生物工程
- 12 篇 信息与通信工程
- 4 篇 材料科学与工程（可...
- 3 篇 交通运输工程
- 3 篇 安全科学与工程
- 2 篇 机械工程
- 2 篇 化学工程与技术
- 2 篇 生物医学工程（可授...
- 1 篇 建筑学
- 1 篇 环境科学与工程（可...
38 篇 理学
- 17 篇 数学
- 13 篇 生物学
- 6 篇 化学
- 5 篇 物理学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
29 篇 管理学
- 19 篇 图书情报与档案管...
- 16 篇 管理科学与工程(可...
- 5 篇 工商管理
3 篇 经济学
- 3 篇 应用经济学
3 篇 教育学
- 3 篇 教育学
2 篇 医学
- 2 篇 临床医学
1 篇 法学
- 1 篇 社会学
1 篇 农学
- 1 篇 作物学

主题

111 篇 software
107 篇 java
102 篇 static analysis
78 篇 source coding
74 篇 open source soft...
57 篇 software systems
54 篇 codes
51 篇 visualization
44 篇 measurement
43 篇 tools
42 篇 task analysis
42 篇 algorithm design...
38 篇 data mining
37 篇 cloning
36 篇 testing
35 篇 libraries
35 篇 software enginee...
35 篇 semantics
34 篇 computer bugs
33 篇 programming

机构

11 篇 vrije univ bruss...
8 篇 delft university...
8 篇 univ szeged dept...
7 篇 delft univ techn...
7 篇 delft university...
7 篇 kent state univ ...
6 篇 queens univ sch ...
6 篇 fraunhofer iem p...
6 篇 univ bern softwa...
5 篇 department of so...
5 篇 software analysi...
5 篇 ucl england
5 篇 eindhoven univer...
5 篇 paderborn univ p...
5 篇 eindhoven univ t...
5 篇 univ akron dept ...
4 篇 department of so...
4 篇 vrije univ bruss...
4 篇 univ saskatchewa...
4 篇 univ bern softwa...

作者

17 篇 de roover coen
10 篇 roy chanchal k.
10 篇 stievenart quent...
10 篇 coen de roover
9 篇 poshyvanyk denys
8 篇 ferenc rudolf
7 篇 inoue katsuro
7 篇 ahmed e. hassan
7 篇 van deursen arie
6 篇 moonen leon
6 篇 bodden eric
6 篇 gyimothy tibor
6 篇 harman mark
6 篇 collard michael ...
6 篇 gall harald c.
6 篇 bram adams
6 篇 zaidman andy
6 篇 quentin stiévena...
6 篇 adams bram
5 篇 serebrenik alexa...

语言

952 篇 英文
6 篇 其他

检索条件"任意字段=IEEE Working Conference on Source Code Analysis and Manipulation"

共 958 条记录，以下是241-250 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Assumption Hierarchy for a CHA Call Graph Construction Algorithm

Assumption Hierarchy for a CHA Call Graph Construction Algor...

引用

11th ieee International working conference on source code analysis and manipulation/ieee International conference on Software Maintenance/ieee International Symposium on Web Systems Evolution/VISSOFT/MESOCA

作者： Sawin, Jason Rountev, Atanas Univ Puget Sound Mat & Comp Sci Tacoma WA 98416 USA Ohio State Univ Comp Sci & Engn Columbus OH USA

ISBN: (纸本)9780769543475

Method call graphs are integral components of many interprocedural static analyses which are widely used to aid in the development and maintenance of software. Unfortunately, the existences of certain dynamic features in modern programming languages, such as Java or C++, can lead to either unsoundness or imprecision in statically constructed call graphs. We investigate a hierarchy of assumptions that a Class Hierarchy analysis (CHA) call graph construction algorithm can make about dynamic features in Java. Each successive level of the assumption hierarchy introduces new relaxations of suppositions. These relaxations allow the call graph algorithm to treat some uses of dynamic features more precisely and still remain sound. The hierarchy includes a novel assumption that dynamic features will respect encapsulation. We present an empirical study in which a unique call graph algorithm is implemented for each level of the assumption hierarchy. This study shows that assuming that dynamic features will respect encapsulation can lead to a call graph with 44% fewer edges than the fully conservative graph. By incorporating assumptions about casting operations and string values, it is possible to remain conservative and reduce the number of graph edges by 54% and graph nodes by 10% through the use of various resolution techniques. This work demonstrates that even a slight relaxation of assumptions can greatly improve the precision of a call graph. It further articulates the exact assumptions that a CHA call graph construction algorithm must make in order to use advanced resolution techniques.

关键词： Algorithm design and analysis CHA call graph construction algorithm Casting Encapsulation Heuristic algorithms Java Java Java Java Loading Software algorithms assumptions class hierarchy analysis dynamic class loading dynamic features graph theory interpr

来源：评论

学校读者我要写书评

暂无评论

The Devil is in the Details: Unwrapping the Cryptojacking Malware Ecosystem on Android 22

The Devil is in the Details: Unwrapping the Cryptojacking Ma...

引用

ieee 22nd International working conference on source code analysis and manipulation (SCAM)

作者： Adjibi, Boladji Vinny Mbodji, Fatou Ndiaye Bissyande, Tegawende F. Allix, Kevin Klein, Jacques Univ Luxembourg SnT Luxembourg Luxembourg

ISBN: (纸本)9781665496094

This paper investigates the various technical and non-technical tools and techniques that software developers use to build and disseminate crypto mining apps on Android devices. Our study of 346 potential Android mining apps, collected between April 2019 and May 2022, has revealed the presence of more than ten mining apps on the Google Play Store, with at least half of those still available at the time of writing this (June 2022). We observed that many of those mining apps do not conceal their usage of the device's resource for mining which is considered a violation of the store's policies for developers. We estimate that more than ten thousand users have run mining apps downloaded directly from the Google Play Store, which puts the supposedly "stringent" vetting process into question. Furthermore, we prove that covert mining apps tend to be embedded into supposedly free versions of premium apps or pose as utility apps that provide valuable features to users. Finally, we empirically demonstrate that cryptojacking apps' resource consumption and malicious behavior could be insignificant. We presume that typical users, even though they might be running a mobile antivirus solution, could execute a mining app for an extended period without being alerted. We expect our results to inform the various actors involved in the security of Android devices against the lingering threat of cryptojacking and help them better assess the problem.

关键词： android cryptojacking malware manual analysis google play store

来源：评论

学校读者我要写书评

暂无评论

Explaining why methods change together 14

Explaining why methods change together

引用

14th ieee International working conference on source code analysis and manipulation (SCAM)

作者： Lozano, Angela Noguera, Carlos Jonckers, Viviane Vrije Univ Brussel Software Languages Lab Brussels Belgium

ISBN: (纸本)9780769553047

By analyzing historical information from source code Management systems, previous research has observed that certain methods tend to change together consistently. Co-change has been identified as a good predictor of the entities that are likely to be affected by a change, which ones might be missing modifications, and which ones might change in the future. However, existing co-change analysis provides no insight on why methods consistently co-change. Being able to identify the rationale that explains co-changes could allow to document and enforce design knowledge. This paper proposes an automatic approach to derive the reason behind a co-change. We define the reason of a (set) of co-changes as a set of properties common to the elements that co-change. We consider two kinds of properties: structural properties which indicate explicit dependencies, and semantic properties which reveal implicit dependencies. Then we attempt to identify the reasons behind single commits, as well as the reasons behind co-changes that repeatedly affect the same set of methods. These sets of methods are identified by clustering methods that tend to be modified in the same commit-transactions. We perform our analysis over the history of two open-source systems, analyzing nearly 19.000 methods and over 3700 commits. We show that it is possible to automatically extract explanations for co-changes, that the quality of such explanations improves when structural and semantic properties are taken into account, and when the methods analyzed co-change recurrently.

关键词： pattern clustering program diagnostics public domain software clustering methods co-change analysis commit-transactions explicit dependencies implicit dependencies open-source systems semantic properties structural properties Clustering methods Documentation History Java Libraries Measurement Semantics Co-change Empirical software engineering Program comprehension Clustering methods Semantic attribute open source software analysis programme Reverse engineering Semantics Structural properties Cluster analysis Java Java programming language Libraries Software engineering

来源：评论

学校读者我要写书评

暂无评论

An Exploratory Study of Functional Redundancy in code Repositories 17

An Exploratory Study of Functional Redundancy in Code Reposi...

引用

ieee 17th International working conference on source code analysis and manipulation (SCAM)

作者： Suzuki, Marcelo de Paula, Adriano Carvalho Guerra, Eduardo Lopes, Cristina V. Lazzarini Lemos, Otavio Augusto Fed Univ Sao Paulo SJ Dos Campos Sci & Technol Dept Sao Jose Dos Campos Brazil Inst Nacl Pesquisas Espaciais Sao Jose Dos Campos Brazil Univ Calif Irvine Donald Bren Sch Informat & Comp Sci Irvine CA USA

ISBN: (纸本)9781538632383

In large code repositories, the probability of functions to repeat across projects is high. This type of functional redundancy (FR) is desirable for recent code reuse and repair approaches. Yet, FR is hard to measure because it is closely related to program equivalence, which is an undecidable problem. This is one of the reasons most studies that investigate redundancy focus on syntactic rather than semantic replication (e.g., cloning). In this paper we evaluate the extent of FR in a code repository with 68 Java projects taken randomly from sourceForge. Our technique approximates function similarity by first searching for methods that possess similar interfaces (return type, name, and parameter types). We then execute these methods to verify which candidate pairs have matching outputs for a given sample of inputs. Some recent studies have also focused on this type of semantic replication, but our detection approach is generally cheaper and more precise, because it focuses on methods and uses interfaces to reduce the search space. Although our scope is restricted to static methods, which makes our results conservative, our findings are promising. In particular, we found 984 pairs of redundant methods, and 28 out of the 68 (41.17%) projects in the repository presented redundancy. Moreover, the majority of redundant methods for which we had access to the source code did not refer to textual clones (only one redundant method pair referred to replicated code). Our study also indicates that the proposed redundancy detection approach has high precision and is generally inexpensive (only four executions were required per method to attain 100% precision).

关键词： Redundancy Cloning Software Maintenance engineering Java Semantics Syntactics

来源：评论

学校读者我要写书评

暂无评论

Removing dependencies from large software projects: are you really sure? 22

Removing dependencies from large software projects: are you ...

引用

ieee 22nd International working conference on source code analysis and manipulation (SCAM)

作者： Chuang, Ching-Chi Cruz, Luis van Dalen, Robbert Mikovski, Vladimir van Deursen, Arie Delft Univ Technol Delft Netherlands ING Amsterdam Netherlands

ISBN: (纸本)9781665496094

When developing and maintaining large software systems, a great deal of effort goes into dependency management. During the whole lifecycle of a software project, the set of dependencies keeps changing to accommodate the addition of new features or changes in the running environment. Package management tools are quite popular to automate this process, making it fairly easy to automate the addition of new dependencies and respective versions. However, over the years, a software project might evolve in a way that no longer needs a particular technology or dependency. But the choice of removing that dependency is far from trivial: one cannot be entirely sure that the dependency is not used in any part of the project. Hence, developers have a hard time confidently removing dependencies and trusting that it will not break the system in production. In this paper, we propose a decision framework to improve the detection of unused dependencies. Our approach builds on top of the existing dependency analysis tool DepClean. We start by improving the support of Java dynamic features in DepClean. We do so by augmenting the analysis with the state-of-the-art call graph generation tool OPAL. Then, we analyze the potentially unused dependencies detected by classifying their logical relationship with the other components to decide on follow-up steps, which we provide in the form of a decision diagram. Results show that developers can focus their efforts on maintaining bloated dependencies by following the recommendations of our decision framework. When applying our approach to a large industrial software project, we can reduce one-third of false positives when compared to the state-of-the-art. We also validate our approach by analyzing dependencies that were removed in the history of open-source projects. Results show consistency between our approach and the decisions taken by open-source developers.

关键词： unused dependencies call graph generation static analysis

来源：评论

学校读者我要写书评

暂无评论

An Exploratory Study of Interface Redundancy in code Repositories 16

An Exploratory Study of Interface Redundancy in Code Reposit...

引用

16th ieee International working conference on source code analysis and manipulation (SCAM)

作者： de Paula, Adriano Carvalho Guerra, Eduardo Lopes, Cristina V. Sajnani, Hitesh Lazzarini Lemos, Otavio Augusto Inst Nacl Pesquisas Espaciais Sao Jose Dos Campos Brazil Univ Calif Irvine Donald Bren Sch Informat & Comp Sci Irvine CA USA Fed Univ Sao Paulo SJ dos Campos Sci & Technol Dept Sao Jose Dos Campos SP Brazil Microsoft Inc Los Angeles CA USA

ISBN: (纸本)9781509038497

An important property of software repositories is their level of cross-project redundancy. For instance, much has been done to assess how much code cloning happens across software corpora. In this paper we study a much less targeted type of replication: Interface Redundancy (IR). IR refers to the level of repetition of whole method interfaces - return type, method name, and parameters types - across a code corpus. Such type of redundancy is important because if two non-trivial methods ever share the same interface it is very likely that they implement analogous functions, even though their code, structure, or vocabulary might be diverse. A certain level of IR is a requirement for approaches that rely on the recurrence of interfaces to fulfill a given task (e.g., interface-driven code search - IDCS). In this paper we report on an experiment to measure IR in a large-scale Java repository. Our target corpus contains more than 380,000 methods from 99 Java projects extracted randomly from an open source repository. Results are promising as they show that the chances of an interface from a non-trivial method to repeat itself across a large repository is around 25% (i.e., approximately 1/4 of such interfaces are redundant). Also, more than 80% of the target projects contained IR (with the average percentage of redundant interfaces for these projects being above 30%). As additional analyses we investigated the distribution of the different types of redundant interfaces (e.g., intra-vs inter-project);characterized the redundant interfaces and show that such a knowledge can help improve IDCS;and provided evidence that only a very small part of IR refers to method cloning (around 0.002%).

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Impact of code Refactoring using Object-Oriented Methodology on a Scientific Computing Application 14

Impact of Code Refactoring using Object-Oriented Methodology...

引用

14th ieee International working conference on source code analysis and manipulation (SCAM)

作者： Kallen, Malin Holmgren, Sverker Hvannberg, Ebba Pora Uppsala Univ Dept Informat Technol S-75105 Uppsala Sweden Univ Iceland Comp Sci IS-101 Reykjavik Iceland

ISBN: (纸本)9780769553047

Methods and tools for refactoring of software have been extensively studied during the last decades, and we argue that there is now a need for additional studies of the effects of refactoring on code quality and external code attributes such as computational performance. To study these effects, we have refactored the central parts of a code base developed in academia for a class of computationally demanding scientific computing problems. We made design choices on the basis of the SOLID principles and we used object-oriented techniques, such as the Gang of Four patterns, in the implementation. In this paper, we discuss the effect on maintainability qualitatively and also analyze it quantitatively using a set of software metrics extending the Chidamber-Kemerer suite. Not surprisingly, we find that maintainability has increased as an effect of the refactoring. We also study performance and find that dynamic binding, which inhibits inlining by the compiler, in the most frequently executed parts of the code makes the execution times increase by over 700%. By exploiting static polymorphism, we have been able able to reduce the relative increase in execution times to less than 100%. We argue that the code version implementing static polymorphism is less maintainable than the one using dynamic polymorphism, although both versions are considerably more maintainable than the original code.

关键词： natural sciences computing object-oriented methods software maintenance software metrics Chidamber-Kemerer suite Gang of Four patterns SOLID principles code refactoring dynamic binding dynamic polymorphism execution times maintainability effect object-oriented methodology object-oriented techniques scientific computing application static polymorphism Abstracts Concrete Couplings Software Software metrics Solids CRTP Design patterns High performance computing Maintainability Object orientation Refactoring Static polymorphism Software measurement object orientation dynamic binding Maintainability Reconstructions Software maintenance design pattern High Performance Computing execution time Couplings computer software Natural sciences computing codes

来源：评论

学校读者我要写书评

暂无评论

Enabling Go Program analysis in Rascal 23

Enabling Go Program Analysis in Rascal

引用

23rd ieee International working conference on source code analysis and manipulation, SCAM 2023

作者： Swearngan, Luke Hills, Mark Appalachian State University BooneNC United States

ISBN: (纸本)9798350305067

In this paper, we present early work on the foundation of a program analysis framework for the Go programming language. This framework, named Go AiR (analysis in Rascal), currently provides support for extracting abstract syntax trees from Go source code, working with multiple Go projects and multiple versions of a single Go project (based on Git version history), and code exploration through the use of Rascal features for working with representations of source code. We discuss the structure of the framework, describe the mapping from Go to Rascal and how this was tested, present sample code showing how the framework can be used to explore Go source code, and discuss future extensions to the framework to support program analysis and verification. © 2023 ieee.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Automatic Identification of Important Clones for Refactoring and Tracking 14

Automatic Identification of Important Clones for Refactoring...

引用

14th ieee International working conference on source code analysis and manipulation (SCAM)

作者： Mondal, Manishankar Roy, Chanchal K. Schneider, Kevin A. Univ Saskatchewan Dept Comp Sci Saskatoon SK S7N 0W0 Canada

ISBN: (纸本)9780769553047

code cloning is a controversial software engineering practice due to contradictory claims regarding its impacts on software evolution and maintenance. While a number of studies identify some positive aspects of code clones, there is strong empirical evidence of some negative impacts of clones too. Focusing on the issues related to clones researchers suggest to manage code clones through detection, refactoring, and tracking. However, all clones in a software system are not suitable for refactoring or tracking. Thus, it is important to identify which clones we should consider for refactoring and which clones should be considered for tracking. In this research work we apply the concept of evolutionary coupling to identify clones that are important for refactoring or tracking. By mining software evolution history, we determine and analyze constrained association rules of clone fragments that evolved following a particular change pattern called Similarity Preserving Change Pattern and are important from the perspective of refactoring and tracking. According to our investigation with rigorous manual analysis on thousands of revisions of six diverse subject systems covering two programming languages, overall 13.20% of all clones in a software system are important candidates for refactoring, and overall 10.27% of all clones are important candidates for tracking. Our implemented system can automatically identify these important candidates and thus, can help us in better maintenance of code clones in terms of refactoring and tracking.

关键词： software maintenance automatic identification code cloning constrained association rules evolutionary coupling important clones programming languages refactoring similarity preserving change pattern software engineering software evolution software evolution history mining tracking Association rules Cloning Couplings Java Maintenance engineering Software systems Association Rule Clone Refactoring Clone Tracking code Clones Evolutionary Coupling Association rules Reconstructions Software maintenance Software systems Automatic identification tracking software evolution Clone Cells Maintenance engineering Computer Programming Languages Software engineering Couplings Java Java programming language Cloning

来源：评论

学校读者我要写书评

暂无评论

On the Use of Data Flow analysis in Static Profiling

On the Use of Data Flow Analysis in Static Profiling

引用

8th ieee International working conference on source code analysis and manipulation

作者： Boogerd, Cathal Moonen, Leon Delft Univ Technol Software Evolut Res Lab NL-2600 AA Delft Netherlands Simula Res Lab Baerum Norway

ISBN: (纸本)9780769533537

Static profiling is a technique that produces estimates of execution likelihoods or frequencies based on source code analysis only It is frequently used in determining cost/benefit ratios for certain compiler optimizations. In previous work, we introduced a simple algorithm to compute execution likelihoods, based on a control flow graph and heuristic branch prediction. In this paper we examine the benefits of using more involved analysis techniques in such a static profiler In particular we explore the use of value range propagation to improve the accuracy of the estimates, and we investigate the differences in estimating execution likelihoods and frequencies.

关键词： Data flow analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共96页 << < 21 22 23 24 25 26 27 28 29 30 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：