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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是201-210 订阅

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

详细简洁

排序：

Reconstruction of composite types for Decompilation

Reconstruction of composite types for Decompilation

引用

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

作者： Troshina, K. Derevenets, Y. Chernov, A. Russian Acad Sci Inst Syst Programming 25 A Solzhenitsyn St Moscow Russia Moscow MV Lomonosov State Univ Computat Math & Cybernet Dept Moscow Russia

ISBN: (纸本)9780769541785

Decompilation is reconstruction of a program in a high-level language from a program in a low-level language. This paper presents a method for automatic reconstruction of composite types (structures, arrays and combinations of them) in a high-level program during decompilation. Assembly code is obtained by disassembling a binary code or traces collected by a simulator. The proposed method is based on expressing memory access operations as pairs (base + offset), then building equivalence classes for the bases used in the program and accumulating offsets for each equivalence class. For Strictly conforming C programs our approach is substantiated by the C language semantics as defined in the international standard. However, experimental results have revealed that it is applicable for real-world programs also. Experimental results are obtained for a number of open-source programs as well as for traces collected from them. The method is an essential part of the tool for program decompilation TyDec being developed by the authors. Decompiler TyDec can be used as a standalone tool or as a plug-in for Interactive Trace Explorer TrEx being developed in Institute for System Programming, Russian Academy of Sciences.

关键词： C language C language semantics TyDec decompilation assembly code composite types reconstruction data type reconstruction decompilation equivalence classes high level language high level languages high level program interactive trace explorer TrEx open source programs program assemblers program reconstruction programming language semantics public domain software reverse engineering strictly conforming C programs

来源：评论

学校读者我要写书评

暂无评论

On Automatically Generating Commit Messages via Summarization of source code Changes 14

On Automatically Generating Commit Messages via Summarizatio...

引用

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

作者： Fernando Cortes-Coy, Luis Linares-Vasquez, Mario Aponte, Jairo Poshyvanyk, Denys Univ Nacl Colombia Bogota Colombia Coll William & Mary Williamsburg VA USA

ISBN: (纸本)9780769553047

Although version control systems allow developers to describe and explain the rationale behind code changes in commit messages, the state of practice indicates that most of the time such commit messages are either very short or even empty. In fact, in a recent study of 23K+ Java projects it has been found that only 10% of the messages are descriptive and over 66% of those messages contained fewer words as compared to a typical English sentence (i.e., 15-20 words). However, accurate and complete commit messages summarizing software changes are important to support a number of development and maintenance tasks. In this paper we present an approach, coined as ChangeScribe, which is designed to generate commit messages automatically from change sets. ChangeScribe generates natural language commit messages by taking into account commit stereotype, the type of changes (e.g., files rename, changes done only to property files), as well as the impact set of the underlying changes. We evaluated ChangeScribe in a survey involving 23 developers in which the participants analyzed automatically generated commit messages from real changes and compared them with commit messages written by the original developers of six open source systems. The results demonstrate that automatically generated messages by ChangeScribe are preferred in about 62% of the cases for large commits, and about 54% for small commits.

关键词： Commit message summarization code changes

来源：评论

学校读者我要写书评

暂无评论

Techniques for Efficient Automated Elimination of False Positives 20

Techniques for Efficient Automated Elimination of False Posi...

引用

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

作者： Muske, Tukaram Serebrenik, Alexander Tata Consultancy Serv Tata Res Dev & Design Ctr Pune Maharashtra India Eindhoven Univ Technol Eindhoven Netherlands

ISBN: (纸本)9781728192482

Static analysis tools are useful to detect common programming errors. However, they generate a large number of false positives. Postprocessing of these alarms using a model checker has been proposed to automatically eliminate false positives from them. To scale up the automated false positives elimination (AFPE), several techniques, e.g., program slicing, are used. However, these techniques increase the time taken by AFPE, and the increased time is a major concern during application of AFPE to alarms generated on large systems. To reduce the time taken by AFPE, we propose two techniques. The techniques achieve the reduction by identifying and skipping redundant calls to the slicer and model checker. The first technique is based on our observation that, (a) combination of application-level slicing, verification with incremental context, and the context-level slicing helps to eliminate more false positives;(b) however, doing so can result in redundant calls to the slicer. In this technique, we use data dependencies to compute these redundant calls. The second technique is based on our observation that (a) code partitioning is commonly used by static analysis tools to analyze very large systems, and (b) applying AFPE to alarms generated on partitioned-code can result in repeated calls to both the slicer and model checker. We use memoization to identify the repeated calls and skip them. The first technique is currently under evaluation. Our initial evaluation of the second technique indicates that it reduces AFPE time by up to 56%, with median reduction of 12.15%.

关键词： Static analysis alarms/warnings false positives model checking program slicing code partitioning

来源：评论

学校读者我要写书评

暂无评论

Discovering Likely Mappings between APIs using Text Mining 15

Discovering Likely Mappings between APIs using Text Mining

引用

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

作者： Pandita, Rahul Jetley, Raoul Praful Sudarsan, Sithu D. Williams, Laurie N Carolina State Univ Raleigh NC 27695 USA ABB Corp Res New Delhi India

ISBN: (纸本)9781467375290

Developers often release different versions of their applications to support various platform/programming-language application programming interfaces (APIs). To migrate an application written using one API (source) to another API (target), a developer must know how the methods in the source API map to the methods in the target API. Given a typical platform or language exposes a large number of API methods, manually writing API mappings is prohibitively resource-intensive and may be error prone. Recently, researchers proposed to automate the mapping process by mining API mappings from existing code-bases. However, these approaches require as input a manually ported (or at least functionally similar) code across source and target APIs. To address the shortcoming, this paper proposes TMAP: Text Mining based approach to discover likely API mappings using the similarity in the textual description of the source and target API documents. To evaluate our approach, we used TMAP to discover API mappings for 15 classes across: 1) Java and C# API, and 2) Java ME and Android API. We compared the discovered mappings with state-of-the-art source code analysis based approaches: Rosetta and StaMiner. Our results indicate that TMAP on average found relevant mappings for 57% more methods compared to previous approaches. Furthermore, our results also indicate that TMAP on average found exact mappings for 6.5 more methods per class with a maximum of 21 additional exact mappings for a single class as compared to previous approaches.

关键词： Java application program interfaces data mining text analysis API document API method TMAP application programming interface source code source code analysis text mining Androids Humanoid robots Indexing Software Text mining Application programming interfaces CKAP2 gene text mining Java Java programming language source code Androids API AXIAL POWER INDICATOR American Petroleum Institute Androids MAPPING(MATHEMATICAL) Humanoid robots text processing data mining

来源：评论

学校读者我要写书评

暂无评论

A Parallel On-Demand Algorithm for Computing Interprocedural Dominators 14

A Parallel On-Demand Algorithm for Computing Interprocedural...

引用

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

作者： Abadi, Aharon Feldman, Yishai A. Tel Aviv Univ Blavatnik Sch Comp Sci Haifa Israel IBM Res Corp Haifa Israel

ISBN: (纸本)9780769553047

We present a new algorithm for computing interprocedural dominators. The algorithm identifies a set of special nodes, which are the only ones that can have interprocedural dominance edges, and extends the intraprocedural dominator trees by deriving those edges. The computation of the dominators of each node is independent of the computation of any other node, and therefore can be done on demand for each node as required. For the same reason, the algorithm lends itself naturally to parallelization. The algorithm has been implemented, and is shown to be practical for large programs. Because of its cooperative caching behavior, the algorithm gains a large performance boost when running on parallel hardware. We also present an efficient way of extending the algorithm for computing interprocedural dominance frontiers and control dependence.

关键词： cache storage parallel algorithms trees (mathematics) control dependence cooperative caching behavior interprocedural dominance edges interprocedural dominance frontiers interprocedural dominators intraprocedural dominator trees parallel hardware parallel on-demand algorithm parallelization Algorithm design and analysis Educational institutions Electronic mail Hardware Joining processes Optimization Vegetation Interprocedural domination Algorithm design and analysis cache storage electronic mail parallelization Educational institutions Parallel algorithms Computer hardware vegetation algorithms Line of nodes performance boost

来源：评论

学校读者我要写书评

暂无评论

An Approach for the Identification of Information Leakage in Automotive Infotainment systems 20

An Approach for the Identification of Information Leakage in...

引用

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

作者： Moiz, Abdul Alalfi, Manar H. Ryerson Univ Dept Comp Sci Toronto ON Canada

ISBN: (纸本)9781728192482

The advancements in the digitization world has revolutionized the automotive industry. Today's modern cars are equipped with internet, computers that can provide autonomous driving functionalities as well as infotainment systems that can run mobile operating systems, like Android Auto and Apple CarPlay. Android Automotive is Google's android operating system tailored to run natively on vehicle's infotainment systems, it allows third party apps to be installed and run on vehicle's infotainment systems. Such apps may raise security concerns related to user's safety, security and privacy. This paper investigates security concerns of in-vehicle apps, specifically, those related to inter component communication (ICC) among these apps. ICC allows apps to share information via inter or intra apps components through a messaging object called intent. In case of insecure communication, Intent can be hijacked or spoofed by malicious apps and user's sensitive information can be leaked to hacker's database. We investigate the attack surface and vulnerabilities in these apps and provide a static analysis approach and a tool to find data leakage vulnerabilities. The approach can also provide hints to mitigate these leaks. We evaluate our approach by analyzing a set of Android Auto apps downloaded from Google Play store, and we report our validated results on vulnerabilities identified on those apps.

关键词： Android Automotive TXL Static analysis API Security Information Flow Control

来源：评论

学校读者我要写书评

暂无评论

The Case for Adaptive Change Recommendation 18

The Case for Adaptive Change Recommendation

引用

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

作者： Pugh, Sydney Binkley, David Moonen, Leon Loyola Univ Maryland 4501 N Charles St Baltimore MD 21210 USA Simula Res Lab Oslo Norway

ISBN: (纸本)9781538682906

As the complexity of a software system grows, it becomes increasingly difficult for developers to be aware of all the dependencies that exist between artifacts (e.g., files or methods) of the system. Change impact analysis helps to overcome this problem, as it recommends to a developer relevant source-code artifacts related to her current changes. Association rule mining has shown promise in determining change impact by uncovering relevant patterns in the system's change history. State-of-the-art change impact mining algorithms typically make use of a change history of tens of thousands of transactions. For efficiency, targeted association rule mining focuses on only those transactions potentially relevant to answering a particular query. However, even targeted algorithms must consider the complete set of relevant transactions in the history. This paper presents ATARI, a new adaptive approach to association rule mining that considers a dynamic selection of the relevant transactions. It can be viewed as a further constrained version of targeted association rule mining, in which as few as a single transaction might be considered when determining change impact. Our investigation of adaptive change impact mining empirically studies seven algorithm variants. We show that adaptive algorithms are viable, can be just as applicable as the start-of-the-art complete-history algorithms, and even outperform them for certain queries. However, more important than the direct comparison, our investigation lays necessary groundwork for the future study of adaptive techniques and their application to challenges such as the on-the-fly style of impact analysis that is needed at the GitHub-scale.

关键词： Association rule mining Change impact analysis Evolutionary coupling

来源：评论

学校读者我要写书评

暂无评论

On the Relationships between Stability and Bug-proneness of code Clones: An Empirical Study 17

On the Relationships between Stability and Bug-proneness of ...

引用

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

作者： Rahman, Md Saidur Roy, Chanchal K. Univ Saskatchewan Saskatoon SK Canada

ISBN: (纸本)9781538632383

Exact or similar copies of code fragments in a code base are known as code clones. code clones are considered as one of the serious code smells. Stability is a widely investigated perspective of assessing the impacts of clones on software systems. A number of existing studies show that clones are often less stable than non-cloned code. This suggests that clones change more frequently than non-cloned code and thus may require comparatively more maintenance efforts. Again, frequent changes to clones may increase the likelihood of missing change propagation to the co-change candidates leading to inconsistencies or bugs. However, none of the existing studies investigate whether stability of clones is related to the bug-proneness. In this paper, we present an empirical study that analyzes the relationships between stability and bug-proneness of clones. We identify bugfix commits by analyzing the commit messages from software repositories. We then identify the clones those are changed in the bug-fix commits as bug-prone clones. We then compare the stability of buggy and non-buggy clones considering the finegrained syntactic change types and their significance. Our experimental results based on five open-source Java systems of different size and application domains show that (1) stability and bug-proneness of code clones are related and this relationship is statistically significant, (2) for both exact (Type 1) and near-miss (Type 2 and Type 3) clones, buggy clones tend to have higher frequency of changes than non-buggy clones, (3) the bug-proneness of Type 2 and Type 3 clones tend to be strongly related with their stability compared to Type 1 clones, and (4) the relation between the stability and the bug-proneness of clones with respect to fine-grained change types is likely to be influenced by the changes of low to medium significance. We believe that our findings are important and potentially useful in identifying and prioritizing candidate clones for management.

关键词： code Clones Clone Stability Bug-proneness of Clones

来源：评论

学校读者我要写书评

暂无评论

Incremental Flow analysis through Computational Dependency Reification 20

Incremental Flow Analysis through Computational Dependency R...

引用

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

作者： Van der Plas, Jens Stievenart, Quentin Van Es, Noah De Roover, Coen Vrije Univ Brussel Software Languages Lab Brussels Belgium

ISBN: (纸本)9781728192482

Static analyses are used to gain more confidence in changes made by developers. To be of most use, such analyses must deliver feedback fast. Therefore, incremental static analyses update previous results rather than entirely recompute them. This reduces the analysis time upon a program change, and makes the analysis well-suited for environments where the code base is frequently updated, such as in IDEs and CI pipelines. In this work, we present a general approach to render a modular static analysis for highly dynamic programs incremental, by exploiting dependencies between intermediate analysis results. Modular analyses divide a program in interdependent parts that are analysed in isolation. The dependencies between these parts stem, for example, from the use of shared variables within the program. Our incrementalisation approach leverages the modularity of the analysis together with the dependencies that it reifies to compute and bound the impact of changes. This way, only the affected parts of the result need to be reanalysed, and unnecessary recomputations are avoided. We apply our approach to both a function-modular and a thread-modular analysis and evaluate it by comparing an incremental update of an existing result to a full reanalysis. We find reductions of the analysis time from 6% to 99% on 14 out of 16 benchmark programs, and on most programs the impact on precision is limited. On 7 of the programs, reanalysis time is reduced by more than 75%, showing that our approach results in fast incremental updates.

关键词： Static Program analysis Incremental analysis Modular analysis Dynamic Languages

来源：评论

学校读者我要写书评

暂无评论

Efficient utilization of secondary storage for scalable dynamic slicing 14

Efficient utilization of secondary storage for scalable dyna...

引用

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

作者： Kargen, Ulf Shahmehri, Nahid Linkoping Univ Dept Comp & Informat Sci SE-58183 Linkoping Sweden

ISBN: (纸本)9780769553047

Dynamic program slicing is widely recognized as a powerful aid for e.g. program comprehension during debugging. However, its widespread use has been impeded in part by scalability issues that occur when constructing the dynamic dependence graph necessary to compute dynamic slices. A few seconds of execution time on a modern CPU can easily yield dynamic dependence graphs on the order of tens of gigabytes in size. Existing methods either produce imprecise slices, incur large time overheads during slice computation, or run out of memory for long program executions. By carefully designing our method to take advantage of locality, we are able to efficiently use secondary storage for dynamic dependence graphs, thus allowing our method to scale to long program executions. Our prototype implementation runs directly on x86 executables, eliminating problems with e.g. binary-only libraries. We show in our experiments that graphs can be constructed for program runs with billions of executed instructions, at slowdowns ranging from 62x to 173x. Our optimized format also allows graphs to be traversed at speeds of several million dependence edges per second.

关键词： dynamic slicing dynamic dependence graph debugging x86 binary analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共96页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：