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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

90% Perspiration: Engineering Static analysis Techniques for Industrial Applications

90% Perspiration: Engineering Static Analysis Techniques for...

引用

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

作者： Anderson, Paul GrammaTech Inc Ithaca NY 14850 USA

ISBN: (纸本)9780769533537

This article describes some of the engineering approaches that were taken during the development of GrammaTech's static-analysis technology that have taken it from a prototype system with poor performance and scalability and with very limited applicability, to a much-more general-purpose industrial-strength analysis infrastructure capable of operating on millions of lines of code. A wide variety of code bases are found in industry, and many extremes of usage exist, from code size through use of unusual, or non-standard features and dialects. Some of the problems associated with handling these code-bases are described, and the solutions that were used to address them, including some that were ultimately unsuccessful, are discussed.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Static Extraction of Enforced Authorization Policies SEEAUTHZ 20

Static Extraction of Enforced Authorization Policies SEEAUTH...

引用

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

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

ISBN: (纸本)9781728192482

Authorization is an intrinsic part of a software's security. Determining whether a user is allowed to access a resource or not is crucial, not only in safety-critical applications but also in everyday applications to prevent misuse of data or software. There is plenty of research dealing with validating and verifying authorization policies in the security community. Still, an implemented authorization policy does not necessarily match the planned authorization policy, i.e., even a validated and verified authorization policy can pose security issues when implemented incorrectly. This gap between planned and implemented authorization policy poses the risk of unauthorized access to sensitive resources due to insufficient authorization checks. Therefore, it is essential to ensure a system's security to validate the implemented authorization policy against the planned one. We, therefore, describe the authorization pattern and present an algorithm to extract authorization graphs from implemented authorization policies, which can then be used to compare against the planned authorization policy. To that end, we developed a configurable context-sensitive analysis tailored to Java-based software systems, where the context is the authorization facts that hold on each point. Using a configuration for Apache Shiro, a security library that supports authorization, we evaluated our implementation using an open-source repository system for the management and dissemination of digital content and a closed-source manufacturing execution system. We discuss additional usage scenarios of the analysis results and describe how to transfer the approach to other authorization policies and programming languages.

关键词： security authorization static analysis

来源：评论

学校读者我要写书评

暂无评论

Multi-Modal code Summarization with Retrieved Summary 22

Multi-Modal Code Summarization with Retrieved Summary

引用

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

作者： Lin, Lile Huang, Zhiqiu Yu, Yaoshen Liu, Yapeng Nanjing Univ Aeronaut & Astronaut Nanjing Peoples R China

ISBN: (纸本)9781665496094

A high-quality code summary describes the functionality and purpose of a code snippet concisely, which is key to program comprehension. Automatic code summarization aims to generate natural language summaries from code snippets automatically, which can save developers time and improve efficiency in development and maintenance. Recently, researchers mainly use neural machine translation (NMT) based approaches to fill this task. They apply a neural model to translate code snippets into natural language summaries. However, the performance of existing NMT-based approaches is limited. Although a summary and a code snippet are semantically related, they may not share common lexical tokens or language structures. Such a semantic gap between codes and summaries hinders the effect of NMT-based models. Only using code tokens to represent a code snippet cannot help NMT-based models overcome this gap. To solve this problem, in this paper, we propose a code summarization approach that incorporates lexical, syntactic and semantic modalities of codes. We treat code tokens as the lexical modality and the abstract syntax tree (AST) as the syntactic modality. To obtain the semantic modality, inspired by translation memory (TM) in NMT, we use the information retrieval (IR) technique to retrieve a relevant summary for a code snippet to describe its functionality. We propose a novel approach based on contrastive learning to build a retrieval model to retrieve semantically similar summaries. Our approach learns and fuses those different modalities using Transformer. We evaluate our approach on a large Java dataset, experiment results show that our approach outperforms the state-of-the-art approaches on automatic evaluation metrics BLEU, ROUGE and METEOR by 10%, 8% and 9%.

关键词： program comprehension code summarization information retrieval neural machine translation contrastive learning

来源：评论

学校读者我要写书评

暂无评论

Statically-informed Dynamic analysis Tools to Detect Algorithmic Complexity Vulnerabilities 16

Statically-informed Dynamic Analysis Tools to Detect Algorit...

引用

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

作者： Holland, Benjamin Santhanam, Ganesh Ram Awadhutkar, Payas Kothari, Suresh Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA

ISBN: (纸本)9781509038497

Algorithmic Complexity (AC) vulnerabilities can be exploited to cause a denial of service attack. Specifically, an adversary can design an input to trigger excessive (space/time) resource consumption. It is not possible to build a fully automated tool to detect AC vulnerabilities. Since it is an open-ended problem, a human-in-loop exploration is required to find the program loops that could have AC vulnerabilities. Ascertaining whether an arbitrary loop has an AC vulnerability is itself difficult, which is equivalent to the halting problem. This paper is about a pragmatic engineering approach to detect AC vulnerabilities. It presents a statically-informed dynamic (SID) analysis and two tools that provide critical capabilities for detecting AC vulnerabilities. The first is a static analysis tool for exploring the software to find loops as the potential candidates for AC vulnerabilities. The second is a dynamic analysis tool that can try many different inputs to evaluate the selected loops for excessive resource consumption. The two tools are built and integrated together using the interactive software analysis, transformation, and visualization capabilities provided by the Atlas platform. The paper describes two use cases for the tools, one to detect AC vulnerabilities in Java bytecode and another for students in an undergraduate algorithm class to perform experiments to learn different aspects of algorithmic complexity.

关键词： Algorithmic Complexity Dynamic analysis Instrumentation Loop analysis

来源：评论

学校读者我要写书评

暂无评论

POI: Skew-Aware Parallel Race Detection 18

POI: Skew-Aware Parallel Race Detection

引用

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

作者： Sakurai, Yoshitaka Arahori, Yoshitaka Gondow, Katsuhiko Tokyo Inst Technol Tokyo Japan

ISBN: (纸本)9781538682906

Multithreaded programs are prone to dataraces. Dataraces are known to be hard to detect and reproduce by manual effort, although they often have detrimental effects on program reliability. Automated techniques are thus demanded for detecting dataraces efficiently and precisely. There have been proposed a lot of datarace detectors so far, among which dynamic ones are promising because of their precision. However, existing dynamic race detectors incur high race-checking overheads. Even a state-of-the-art dynamic race detector, called Parallel FastTrack, fails to efficiently detect races under certain conditions, despite its attempt to parallelize race detection for efficiency. In this paper, we propose an efficient and precise parallel race detector. For our proposal, we first experimentally reveal that the load-distribution policy of Parallel FastTrack tends to skew race-checking loads to a few detection threads. We then present a simple but effective technique, called POI, for balancing race-checking loads among detection threads. POI takes race-checking loads of each detection thread into account and reduces the load skew by making each detection thread manage almost the same number of memory addresses to be checked. Experiments on several real multithreaded data-processing applications show that POI succeeded in reducing, on average, about 37% of race detection overheads, which the load-distribution policy of Parallel FastTrack would impose.

关键词： concurrency datarace race detection dynamic analysis parallelization

来源：评论

学校读者我要写书评

暂无评论

Recovering the Memory Behavior of Executable Programs

Recovering the Memory Behavior of Executable Programs

引用

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

作者： Ketterlin, Alain Clauss, Philippe INRIA CAMUS Team Rocquencourt France Univ Strasbourg Strasbourg France

ISBN: (纸本)9780769541785

This paper deals with the binary analysis of executable programs, with the goal of understanding how they access memory. It explains how to statically build a formal model of all memory accesses. Starting with a control-flow graph of each procedure, well-known techniques are used to structure this graph into a hierarchy of loops in all cases. The paper shows that much more information can be extracted by performing a complete data-flow analysis over machine registers after the program has been put in static single assignment (SSA) form. By using the SSA form, registers used in addressing memory can be symbolically expressed in terms of other, previously set registers. By including the loop structures in the analysis, loop indices and trip counts can also often be expressed symbolically. The whole process produces a formal model made of loops where memory accesses are linear expressions of loop counters and registers. The paper provides a quantitative evaluation of the results when applied to several dozens of SPEC benchmark programs. Because static analysis is often incomplete, the paper ends by describing a lightweight instrumentation strategy that collects at run time enough information to complete the program's symbolic description.

关键词： binary analysis binary analysis control flow graph data flow analysis data flow analysis executable program formal model lightweight instrumentation strategy linear expression loop counter loop structure machine registers memory access memory accesses memory recovey modeling profiling program control structures program symbolic description quantitative evaluation static analysis static single assignment static single assignment form storage allocation storage management

来源：评论

学校读者我要写书评

暂无评论

New Conceptual Coupling and Cohesion Metrics for Object-Oriented Systems

New Conceptual Coupling and Cohesion Metrics for Object-Orie...

引用

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

作者： Ujhazi, Bela Ferenc, Rudolf Poshyvanyk, Denys Gyimothy, Tibor Univ Szeged Dept Software Engn Szeged Hungary Coll William & Mary Dept Comp Sci Williamsburg VA 23187 USA

ISBN: (纸本)9780769541785

The paper presents two novel conceptual metrics for measuring coupling and cohesion in software systems. Our first metric, Conceptual Coupling between Object classes (CCBO), is based on the well-known CBO coupling metric, while the other metric, Conceptual Lack of Cohesion on Methods (CLCOM5), is based on the LCOM5 cohesion metric. One advantage of the proposed conceptual metrics is that they can be computed in a simpler (and in many cases, programming language independent) way as compared to some of the structural metrics. We empirically studied CCBO and CLCOM5 for predicting fault-proneness of classes in a large open-source system and compared these metrics with a host of existing structural and conceptual metrics for the same task. As the result, we found that the proposed conceptual metrics, when used in conjunction, can predict bugs nearly as precisely as the 58 structural metrics available in the Columbus source code quality framework and can be effectively combined with these metrics to improve bug prediction.

关键词： Columbus source code quality framework bug prediction cohesion metrices conceptual coupling fault proneness object oriented system object-oriented methods open source system program debugging programming language public domain software software fault tolerance software metrics software metrics system

来源：评论

学校读者我要写书评

暂无评论

An Experimental analysis of Graph-Distance Algorithms for Comparing API Usages 21

An Experimental Analysis of Graph-Distance Algorithms for Co...

引用

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

作者： Nielebock, Sebastian Blockhaus, Paul Kruger, Jacob Ortmeier, Frank Otto Von Guericke Univ Magdeburg Germany Ruhr Univ Bochum Bochum Germany

ISBN: (纸本)9781665448970

Modern software development heavily relies on the reuse of functionalities through Application Programming Interfaces (APIs). However, client developers can have issues identifying the correct usage of a certain API, causing misuses accompanied by software crashes or usability bugs. Therefore, researchers have aimed at identifying API misuses automatically by comparing client code usages to correct API usages. Some techniques rely on certain API-specific graph-based data structures to improve the abstract representation of API usages. Such techniques need to compare graphs, for instance, by computing distance metrics based on the minimal graph edit distance or the largest common subgraphs, whose computations are known to be NP-hard problems. Fortunately, there exist many abstractions for simplifying graph distance computation. However, their applicability for comparing graph representations of API usages has not been analyzed. In this paper, we provide a comparison of different distance algorithms of API-usage graphs regarding correctness and runtime. Particularly, correctness relates to the algorithms' ability to identify similar correct API usages, but also to discriminate similar correct and false usages as well as non-similar usages. For this purpose, we systematically identified a set of eight graph-based distance algorithms and applied them on two datasets of real-world API usages and misuses. Interestingly, our results suggest that existing distance algorithms are not reliable for comparing API usage graphs. To improve on this situation, we identified and discuss the algorithms' issues, based on which we formulate hypotheses to initiate research on overcoming them.

关键词： API usage graph similarity misuse

来源：评论

学校读者我要写书评

暂无评论

Summary-Based Compositional analysis for Soft Contract Verification 22

Summary-Based Compositional Analysis for Soft Contract Verif...

引用

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

作者： Vandenbogaerde, Bram Stievenart, Quentin De Roover, Coen Vrije Univ Brussel Brussels Belgium

ISBN: (纸本)9781665496094

Design-by-contract is a development best practice that requires the interactions between software components to be governed by precise specifications, called contracts. Contracts often take the form of pre- and post-conditions on function definitions, and are usually translated to (frequently redundant) run-time checks. So-called soft contract verifiers have been proposed to reduce the run-time overhead introduced by such contract checks by verifying parts of the contracts ahead of time, while leaving those that cannot be verified as residual runtime checks. In the state of the art, static analyses based on the Abstracting Abstract Machines (AAM) approach to abstract interpretation have been proposed for implementing such soft verifiers. However, these approaches result in whole-program analyses which are difficult to scale. In this paper, we propose a scalable summary-based compositional analysis for soft contract verification, which summarises both the correct behaviour and erroneous behaviour of all functions in the program using symbolic path conditions. Information from these summaries propagates backwards through the call graph, reducing the amount of redundant analysis states and improving the overall performance of the analysis. This backwards flow enables path constraints associated with erroneous program states to flow to call sites where they can be refuted, whereas in the state of the art they can only be refuted using the information available at the original location of the error. To demonstrate our improvements in both precision and performance compared to the state-of-the-art, we implemented our analysis in a framework called MAF (short for Modular analysis Framework) - a framework for the analysis of higher-order dynamic programming languages. We conducted an empirical study and found an average performance improvement of 21%, and an average precision improvement of 38.15%.

关键词： Static Program analysis Design-by-contract

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：