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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

BoostNSift: A Query Boosting and code Sifting Technique for Method Level Bug Localization 21

BoostNSift: A Query Boosting and Code Sifting Technique for ...

引用

21st ieee International working conference on source code analysis and manipulation (SCAM)

作者： Razzaq, Abdul Buckley, Jim Patten, James Vincent Chochlov, Muslim Sai, Ashish Rajendra Univ Limerick Limerick Ireland

ISBN: (纸本)9781665448970

Locating bugs is an important, but effort-intensive and time-consuming task, when dealing with large-scale systems. To address this, Information Retrieval (IR) techniques are increasingly being used to suggest potential buggy source code locations, for given bug reports. While IR techniques are very scalable, in practice their effectiveness in accurately localizing bugs in a software system remains low. Results of empirical studies suggest that the effectiveness of bug localization techniques can be augmented by the configuration of queries used to locate buggy code. However, in most IR-based bug localization techniques, presented by researchers, the impact of the queries' configurations is not fully considered. In a similar vein, techniques consider all code elements as equally suspicious of being buggy while localizing bugs, but this is not always the case either. In this paper, we present a new method-level, information-retrieval-based bug localization technique called "BoostNSift". BoostNSift exploits the important information in queries by 'boost'ing that information, and then 'sift's the identified code elements, based on a novel technique that emphasizes the code elements' specific relatedness to a bug report over its generic relatedness to all bug reports. To evaluate the performance of BoostNSift, we employed a state-of-the-art empirical design that has been commonly used for evaluating file level IR-based bug localization techniques: 6851 bugs are selected from commonly used Eclipse, AspectJ, SWT, and ZXing benchmarks and made openly available for method-level analyses. The performance of BoostNSift is compared with the openly-available state-of-the-art IR-based BugLocator, BLUiR, and BLIA techniques. Experiments show that BoostNSift improves on BLUiR by up to 324%, on BugLocator by up to 297%, and on BLIA up to 120%, in terms of Mean Reciprocal Rank (MRR). Similar improvements are observed in terms of Mean Average Precision (MAP) and Top-N evaluation meas

关键词： Bug localization code analysis Software maintenance Query enhancement Query boosting code Sifting

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of Bug Patterns in Java Cloned and Non-cloned code 14

A Comparative Study of Bug Patterns in Java Cloned and Non-c...

引用

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

作者： Sajnani, Hitesh Saini, Vaibhav Lopes, Cristina V. Univ Calif Irvine Bren Sch Informat & Comp Sci Irvine CA 92697 USA

ISBN: (纸本)9780769553047

code cloning via copy-and-paste is a common practice in software engineering. Traditionally, this practice has been considered harmful, and a symptom that some important design abstraction is being ignored. As such, many previous studies suggest approaches to facilitate the discovery, removal, and refactoring of clones. However, not many studies exist that empirically investigate the relationship of code clones with code quality. In this paper, we conduct an empirical study of 31 open source Java projects (1.7 MSLOC) to explore the relationship between code clones and a set of bug patterns reported by FindBugs. We found that: (i) the defect density in cloned code is 3.7 times less than that of the rest of the code;(ii) 66% of the bug patterns associated with code clones are related to issues in coding style and practice, the two least problematic of the FindBugs categories, while that number is 49% for non-cloned code;and (iii) 75% of the bug patterns in cloned code are duplicated without any changes, while 25% are only present in one of the clones. These results show that, when using FindBugs to detect bug patterns, there is a positive differentiation of cloned code with respect to the rest of the code: the cloned code has considerably less, and less problematic, bug patterns. While our study does not unveil any explanation for this, results from other, more qualitative studies indicate that developers use copy-and-paste intentionally and wisely, which may explain the quantitative observations of our study. Overall, these research results suggest that the practice of code cloning in Java, and possibly in all other object-oriented languages, needs to be given serious consideration on the part of tool designers.

关键词： Java program debugging public domain software software quality source code (software) Java cloned code Java noncloned code bug pattern detection code quality copy-and-paste defect density design abstraction find bugs category object-oriented languages open source Java projects software engineering Cloning Computer bugs Correlation Encoding Google Software bug patterns code clones Java Java programming language bugs codes Object oriented programming languages open source software Debugging Software engineering software quality Bugs Cloning computer software

来源：评论

学校读者我要写书评

暂无评论

The Role of Implicit Conversions in Erroneous Function Argument Swapping in C plus 20

The Role of Implicit Conversions in Erroneous Function Argum...

引用

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

作者： Szalay, Richard Sinkovics, Abel Porkolab, Zoltan Eotvos Lorand Univ Fac Informat Dept Programming Languages & Compilers Budapest Hungary

ISBN: (纸本)9781728192482

Argument selection defects, in which the programmer has chosen the wrong argument to a function call is a widely investigated problem. The compiler can detect such misuse of arguments based on the argument and parameter type in case of statically typed programming languages. When adjacent parameters have the same type, or they can be converted between one another, the potential error will not be diagnosed. Related research is usually confined to exact type equivalence, often ignoring potential implicit or explicit conversions. However, in current mainstream languages, like C++, built-in conversions between numerics and user-defined conversions may significantly increase the number of mistakes to go unnoticed. We investigated the situation for C and C++ languages where functions are defined with multiple adjacent parameters that allow arguments to pass in the wrong order. When implicit conversions are taken into account, the number of mistake-prone function declarations significantly increases compared to strict type equivalence. We analysed the outcome and categorised the offending parameter types. The empirical results should further encourage the language and library development community to emphasise the importance of strong typing and the restriction of implicit conversion.

关键词： static analysis function parameters argument selection defect type safety strong typing error-prone constructs C plus plus programming language

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A source Level Empirical Study of Features and Their Interactions in Variable Software 16

A Source Level Empirical Study of Features and Their Interac...

引用

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

作者： Fischer, Stefan Linsbauer, Lukas Egyed, Alexander Lopez-Herrejon, Roberto E. Johannes Kepler Univ Linz Inst Software Syst Engn Linz Austria Ecole Technol Super Dept Software Engn & IT Montreal PQ Canada

ISBN: (纸本)9781509038497

Robust and effective support for the detection and management of features and their interactions is crucial for many software development tasks but has proven to be an elusive goal despite the extensive research and practice on the subject. Providing the required support becomes even more challenging with variable software whereby multiple variants of a system and their features must be collectively considered. An important premise to provide better support for feature interactions in variable systems is the need of a deeper understanding on how features interact at different levels starting from the source level. In this context, recent work has looked at feature interactions from different angles and for different purposes, for instance for developing performance models, extracting interfaces for maintenance or describing feature evolution patterns. However, there is a gap in understanding how features interact in fact at the source level in contrast with how features ought to interact according to variability models that describe the valid combinations of features in variable software systems. In this paper we perform an empirical study to explore this gap. We use seven case studies, implemented in Java and C, totalling over nine million LoC, and analysed over seven thousand feature interactions. Our study revealed important inconsistencies between how feature interactions occur at source level and how they are modeled, and corroborated that the majority of source level interactions involve less than three features. We discuss the implications of our findings and avenues for further research.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：