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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 订阅

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

详细简洁

排序：

ACUA: API Change and Usage Auditor 14

ACUA: API Change and Usage Auditor

引用

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

作者： Wu, Wei Adams, Bram Gueheneuc, Yann-Gael Antoniol, Giuliano Ecole Polytech DGIGL Montreal PQ H3C 3A7 Canada

ISBN: (纸本)9780769553047

Modern software uses frameworks through their Application Programming Interfaces (APIs). Framework APIs may change while frameworks evolve. Client programs have to upgrade to new releases of frameworks if security vulnerabilities are discovered in the used releases. Patching security vulnerabilities can be delayed by non-security-related API changes when the frameworks used by client programs are not up to date. Keeping frameworks updated can reduce the reaction time to patch security leaks. Client program upgrades are not cost-free, developers need to understand the API usages in client programs and API changes between framework releases before conduct upgrading tasks. In this paper, we propose a tool ACUA to generate reports containing detailed API change and usage information by analyzing the binary code of both frameworks and clients programs written in Java. Developers can use the API change and usage reports generated by ACUA to estimate the work load and decide when to starting upgrading client programs based on the estimation.

关键词： Java application program interfaces safety-critical software source code (software) ACUA API Change-and-Usage Auditor application programming interfaces binary code analysis client program upgrade framework release nonsecurity-related API changes reaction time reduction security leakage patching security vulnerabilities software usage framework work load estimation Abstracts Analytical models Contracts Data models Detection algorithms Security Software API change and usage Software maintenance framework API evolution Application programming interfaces Java Java programming language Frameworks safety-critical software Detection algorithms Software maintenance data models API contract AXIAL POWER INDICATOR American Petroleum Institute Security hole analysis MODELS customers

来源：评论

学校读者我要写书评

暂无评论

The Architectural Security Tool Suite - ARCHSEC 19

The Architectural Security Tool Suite - ARCHSEC

引用

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

作者： Berger, Bernhard J. Sohr, Karsten Koschke, Rainer Univ Bremen Software Engn Grp Bremen Germany Technol Zentrum Informat & Informat Tech Bremen Germany

ISBN: (纸本)9781728149370

Architectural risk analysis is a risk management process for identifying security flaws at the level of software architectures and is used by large software vendors, to secure their products. We present our architectural security environment (ARCHSEC) that has been developed at our institute during the past eight years in several research projects. ARCHSEC aims to simplify architectural risk analysis, making it easier for small and mid-sized companies to get started. With ARCHSEC, it is possible to graphically model or to reverse engineer software security architectures. The regained software architectures can then be inspected manually or automatically analyzed w.r.t. security flaws, resulting in a threat model, which serves as a base for discussion between software and security experts to improve the overall security of the software system in question, beyond the level of implementation bugs. In the evaluation part of this paper, we demonstrate how we use ARCHSEC in two of our current research projects to analyze business applications. In the first project we use ARCHSEC to identify security flaws in business process diagrams. In the second project, ARCHSEC is integrated into an audit environment for software security certification. ARCHSEC is used to identify security flaws and to visualize software systems to improve the effectiveness and efficiency of the certification process.

关键词： security threat modeling software architecture reverse engineering architectural risk analysis

来源：评论

学校读者我要写书评

暂无评论

On the Accuracy of Forward Dynamic Slicing and its Effects on Software Maintenance 14

On the Accuracy of Forward Dynamic Slicing and its Effects o...

引用

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

作者： Jiang, Siyuan Santelices, Raul Grechanik, Mark Cai, Haipeng Univ Notre Dame Notre Dame IN 46556 USA Univ Illinois Chicago IL USA

ISBN: (纸本)9780769553047

Dynamic slicing is a practical and popular analysis technique used in various software-engineering tasks. Dynamic slicing is known to be incomplete because it analyzes only a subset of all possible executions of a program. However, it is less known that its results may inaccurately represent the dependencies that occur in those executions. Some researchers have identified this problem and developed extensions such as relevant slicing, which incorporates static information. Yet, dynamic slicing continues to be widely used, even though the extent of its inaccuracy is not well understood, which can affect the benefits of this analysis. In this paper, we present an approach to assess the accuracy of forward dynamic slices, which are used in software maintenance and evolution tasks. Because finding all actual dependencies is an undecidable problem, our approach instead computes bounds of the precision and recall of forward dynamic slices. Our approach uses sensitivity analysis and execution differencing to find a subset of all program statements that truly depend at runtime on another statement. Using this approach, we studied the accuracy of many forward dynamic slices from a variety of Java applications. Our results show that forward dynamic slicing can have low recall-for dependencies in the analyzed executions-and some potential imprecision. We also conducted a case study that shows how this inaccuracy affects a software maintenance task. To the best of our knowledge, ours is the first work that quantifies the intrinsic limitations of dynamic slicing.

关键词： dynamic slicing precision and recall sensitivity analysis execution differencing software maintenance

来源：评论

学校读者我要写书评

暂无评论

Static JavaScript Call Graphs: a Comparative Study 18

Static JavaScript Call Graphs: a Comparative Study

引用

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

作者： Antal, Gabor Hegedus, Peter Toth, Zoltan Ferenc, Rudolf Gyimothy, Tibor Univ Szeged Dept Software Engn Szeged Hungary MTA SZTE Res Grp Artificial Intelligence Szeged Hungary

ISBN: (纸本)9781538682906

The popularity and wide adoption of JavaScript both at the client and server side makes its code analysis more important than ever before. Most of the algorithms for vulnerability analysis, coding issue detection, or type inference rely on the call graph representation of the underlying program. Despite some obvious advantages of dynamic analysis, static algorithms should also be considered for call graph construction as they do not require extensive test beds for programs and their costly execution and tracing. In this paper, we systematically compare five widely adopted static algorithms - implemented by the npm call graph, IBM WALA, Google Closure Compiler, Approximate Call Graph, and Type Analyzer for JavaScript tools - for building JavaScript call graphs on 26 WebKit SunSpider benchmark programs and 6 real-world *** modules. We provide a performance analysis as well as a quantitative and qualitative evaluation of the results. We found that there was a relatively large intersection of the found call edges among the algorithms, which proved to be 100% precise. However, most of the tools found edges that were missed by all others. ACG had the highest precision followed immediately by TAJS, but ACG found significantly more call edges. As for the combination of tools, ACG and TAJS together covered 99% of the found true edges by all algorithms, while maintaining a precision as high as 98%. Only two of the tools were able to analyze up-to-date multi-file *** modules due to incomplete language features support. They agreed on almost 60% of the call edges, but each of them found valid edges that the other missed.

关键词： JavaScript call graph static code analysis comparative study

来源：评论

学校读者我要写书评

暂无评论

The Evolution and Decay of Statically Detected source code Vulnerabilities

The Evolution and Decay of Statically Detected Source Code V...

引用

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

作者： Di Penta, Massimiliano Cerulo, Luigi Aversano, Lerina Univ Sannio RCOST Dept Engn I-82100 Benevento Italy

ISBN: (纸本)9780769533537

The presence of vulnerable statements in the source code is a crucial problem for maintainers: properly monitoring and, if necessary, removing them is highly desirable to ensure high security and reliability To this aim, a number of static analysis tools have been developed to detect the presence of instructions that can be subject to vulnerability attacks, ranging from buffer overflow exploitations to command injection and cross-site scripting. Based on the availability of existing tools and of data extracted from software repositories, this paper reports an empirical study on the evolution of vulnerable statements detected in three software systems with different static analysis tools. Specifically, the study investigates on vulnerability evolution trends and on the decay time exhibited by different kinds of vulnerabilities.

关键词： software vulnerabilities mining software repositories empirical study

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

DATES: Design analysis tool for enterprise systems

DATES: Design analysis tool for enterprise systems

引用

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

作者： Marinescu, Cristina Tech Univ Timisoara LOOSE Res Grp RO-1900 Timisoara Romania

ISBN: (纸本)9780769528809

In the current demonstration we present a new tool which increases the level of understanding and the accuracy of design quality assessment within enterprise systems. This is performed by providing its users with information specific to this type of systems (e.g., accessed tables from a class). In order to validate its usefulness, we perform some experiments on a suite of enterprise systems whose results are briefly presented in the last part of the demo.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Parallel Worklist Algorithm for Modular Analyses 20

A Parallel Worklist Algorithm for Modular Analyses

引用

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

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

ISBN: (纸本)9781728192482

One way to speed up static program analysis is to make use of today's multi-core CPUs by parallelising the analysis. Existing work on parallel analysis usually targets traditional data-flow analyses for static, first-order languages such as C. Less attention has been given so far to the parallelisation of more general analyses that can also target dynamic, higher-order languages such as JavaScript. These are significantly more challenging to parallelise, as dependencies between analysis results are only discovered during the analysis itself. State-of-the-art parallel analyses for such languages are therefore usually limited, both in their applicability and performance gains. In this work, we propose the parallelisation of modular analyses. Modular analyses compute different parts of the analysis in isolation of one another, and therefore offer inherent opportunities for parallelisation that have not been explored so far. In addition, they can be used to develop a general class of analysers for dynamic, higher-order languages. We present a parallel variant of the worklist algorithm that is used to drive such modular analyses. To further speed up its convergence, we show how this algorithm can exploit the monotonicity of the analysis. Existing modular analyses can be parallelised without additional effort by instead employing this parallel worklist algorithm. We demonstrate this for MODF, an inter-procedural modular analysis, and for MODCONC, an inter-process modular analysis. For MODCONC, we reveal an additional opportunity to exploit even more parallelism in the analysis. Our parallel worklist algorithm is implemented and integrated into MAF, a framework for modular program analysis. Using a set of Scheme benchmarks for MODF, we usually observe speedups between 3x and 8x when using 4 workers, and speedups between 8x and 32x when using 16 workers. For MODCONC, we achieve a maximum speedup of 15x.

关键词： Static Program analysis Modular analysis Parallelism Concurrency Dynamic Languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：