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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

130 篇 会议
8 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

94 篇 工学
- 84 篇 软件工程
- 58 篇 计算机科学与技术...
- 9 篇 电气工程
- 3 篇 控制科学与工程
- 2 篇 材料科学与工程（可...
- 2 篇 信息与通信工程
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 仪器科学与技术
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 石油与天然气工程
- 1 篇 生物工程
- 1 篇 网络空间安全
12 篇 理学
- 8 篇 数学
- 4 篇 物理学
- 3 篇 统计学（可授理学、...
- 1 篇 生物学
- 1 篇 系统科学
6 篇 管理学
- 4 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
2 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...
1 篇 法学
- 1 篇 社会学

主题

11 篇 open source soft...
10 篇 static analysis
8 篇 visualization
7 篇 tools
7 篇 java
6 篇 computer science
6 篇 conferences
6 篇 data mining
6 篇 software
5 篇 xml
5 篇 algorithm design...
5 篇 testing
5 篇 data visualizati...
5 篇 source coding
4 篇 software systems
4 篇 libraries
4 篇 software enginee...
4 篇 computer languag...
4 篇 cloning
4 篇 computer program...

机构

3 篇 free univ amster...
3 篇 queens univ sch ...
2 篇 loyola college b...
2 篇 univ london impe...
2 篇 victoria univ we...
2 篇 loyola coll balt...
2 篇 univ glasgow sch...
2 篇 univ tecn lisboa...
2 篇 brunel univ uxbr...
2 篇 brunel universit...
2 篇 software improve...
2 篇 université du qu...
2 篇 telsey telecommu...
2 篇 concordia univ d...
2 篇 univ sannio res ...
2 篇 vrije universite...
2 篇 kyoto univ disas...
1 篇 ltci telecom par...
1 篇 indian inst tech...
1 篇 dept. of softwar...

作者

6 篇 harman mark
4 篇 harman m
3 篇 masone g
3 篇 hu l
3 篇 di penta m
3 篇 antoniol g
3 篇 pearce dj
3 篇 hankin c
3 篇 verhoef c
3 篇 villano u
3 篇 kelly phj
2 篇 richárd szalay
2 篇 zoltán porkoláb
2 篇 zhang xy
2 篇 dean tr
2 篇 rilling juergen
2 篇 takemi tetsuya
2 篇 cordy james r.
2 篇 rilling j
2 篇 hierons robert m...

语言

138 篇 英文

检索条件"任意字段=3rd IEEE International Workshop on Source Code Analysis and Manipulation"

共 138 条记录，以下是41-50 订阅

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

详细简洁

排序：

Proceedings of Correctness 2019: 3rd international workshop on Software Correctness for HPC Applications - Held in conjunction with SC 2019: The international Conference for High Performance Computing, Networking, Storage and analysis

Proceedings of Correctness 2019: 3rd International Workshop ...

引用

3rd ieee/ACM international workshop on Software Correctness for HPC Applications, Correctness 2019

ISBN: (纸本)9781728160153

The proceedings contain 6 papers. The topics discussed include: debugging and optimization of HPC programs with the verrou tool;exploring regression of data race detection tools using dataracebench;toward multi-precision, multi-format numerics;tool integration for source-level mixed precision;bounded verification of sparse matrix computations;and investigating the impact of mixed precision on correctness for a large climate code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An interprocedural amorphous slicer for WSL 2

An interprocedural amorphous slicer for WSL

引用

2nd ieee international workshop on source code analysis and manipulation

作者： Harman, M Hu, L Munro, M Zhang, XY Danicic, S Daoudi, M Ouarbya, L Brunel Univ Uxbridge UB8 3PH Middx England

ISBN: (纸本)0769517935

This paper presents a simple interprocedural algorithm for amorphous slicing and illustrates the way in which interprocedural amorphous slicing improves upon interprocedural syntax-preserving slicing. The paper also presents results from an empirical study of an implementation of this algorithm for Ward's Wide Spectrum Language, WSL. The implementation uses the FermaT transformation workbench. It combines FermaT transformations with the results produced by a syntax-preserving slicer for WSL. Finally, it is shown that the combination of amorphous slicing and conditioned slicing can be particularly attractive, by combining results from the amorphous slicer with results from a prototype conditioned slicer for WSL.

关键词： amorphous slicing conditioned slicing transformation WSL FermaT

来源：评论

学校读者我要写书评

暂无评论

AVal: an extensible Attribute-Oriented Programming validator for Java

AVal: an extensible Attribute-Oriented Programming validator...

引用

6th ieee international workshop on source code analysis and manipulation

作者： Noguera, Carlos Pawlak, Renaud INRIA Futurs Jacquard Project LIFL UMR 8022CNRSEquipe GOAL Batiment M3 F-59655 Villeneuve Dascq France

ISBN: (纸本)9780769523538

Attribute Oriented Programming (@OP) permits programmers to extend the semantics of a base program by annotating it with attributes that are related to a set of concerns. Examples of this are applications that rely on XDoclet (such as Hibernate) or, with the release of Java5's annotations, EJB3. The set of attributes that implements a concern defines a Domain Specific Language, and as such, imposes syntactic and semantic rules on the way attributes are included in the program or even on the program itself We propose a framework for the definition and checking of these rules for @OP that uses Java5 annotations. We define an extensible set of meta-annotations to allow the validation of @OP programs, as well as the means to extend them using a compile-time model of the program's source code. We show the usefulness of the approach by presenting two examples of its use: an @OP extension for the Fractal component model called Fraclet, and the JSR 181 for web services definition.

关键词： Annotations Attributes Program checking Validation

来源：评论

学校读者我要写书评

暂无评论

Detecting cache-timing vulnerabilities in post-quantum cryptography algorithms 3

Detecting cache-timing vulnerabilities in post-quantum crypt...

引用

3rd ieee international Verification and Security workshop (IVSW)

作者： Facon, Adrien Guilley, Sylvain Lec'Hvien, Matthieu Schaub, Alexander Souissi, Youssef Telecom ParisTech LTCI F-75013 Paris France Ecole Normale Super Dept Informat F-75005 Paris France Secure IC SAS F-35510 Cesson Sevigne France

ISBN: (纸本)9781538665442

When implemented on real systems, cryptographic algorithms are vulnerable to attacks observing their execution behavior, such as cache-timing attacks. Designing protected implementations must be done with knowledge and validation tools as early as possible in the development cycle. In this article we propose a methodology to assess the robustness of the candidates for the NIST post-quantum standardization project to cache-timing attacks. To this end we have developed a dedicated vulnerability research tool. It performs a static analysis with tainting propagation of sensitive variables across the source code and detects leakage patterns. We use it to assess the security of the NIST post-quantum cryptography project submissions. Our results show that more than 80% of the analyzed implementations have at least one potential flaw, and three submissions total more than 1000 reported flaws each. Finally, this comprehensive study of the competitors security allows us to identify the most frequent weaknesses amongst candidates and how they might be fixed.

关键词： Tools NIST Static analysis Proposals Encryption

来源：评论

学校读者我要写书评

暂无评论

JMangler - A framework for load-time transformation of Java class files 1

JMangler - A framework for load-time transformation of Java ...

引用

1st ieee international workshop on source code analysis and manipulation

作者： Kniesel, G Costanza, P Austermann, M Univ Bonn Inst Comp Sci 3 D-53117 Bonn Germany

ISBN: (纸本)0769513875

Current proposals for load-time transformation of Java classes are either dependent on the use of a specific class loader or dependent on a specific JVM implementation. This is not due to an inadequacy of the Java platform but to the wrong choice of the level at which to hook into the Java Class Loader Architecture. JMangler follows a novel approach that ensures both class loader and JVM independence by hooking into the base class of all class loaders. Furthermore, existing proposals do not allow transformers to be treated as components because implicit dependencies must be resolved manually. This paper shows that automatic composition is possible for the well-defined class of interface transformations that still include powerful transformations, like addition of fields, methods and classes, and changes to the class hierarchy. Consequently interface transformers can be deployed jointly even if developed independently.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

A hybrid program slicing framework 1

A hybrid program slicing framework

引用

1st ieee international workshop on source code analysis and manipulation

作者： Rilling, J Karanth, B Concordia Univ Dept Comp Sci Montreal PQ H3G 1M8 Canada

ISBN: (纸本)0769513875

Program Slicing is a decomposition technique that transforms a large program into a smaller one that contains only statements relevant to the computation of a selected junction. Applications of program slicing can be found in software testing, debugging, and maintenance by reducing the amount of data that has to be analyzed in order to comprehend a program or parts of its functionality. In this paper, we present a general dynamic and static slicing algorithm. Both algorithms are based on the notion of removable blocks and compute executable slices for object-oriented programs. In the second part of the paper we present our hybrid-slicing framework that was designed to take advantage of static and dynamic slicing algorithms that share the common notion of removable blocks, to enhance traditional slicing techniques. The hybrid-slicing framework is an integrated part of our existing MOOSE software comprehension framework that is used to demonstrate the applications and usability of these algorithms for the comprehension of software systems.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Stop-list slicing

Stop-list slicing

引用

6th ieee international workshop on source code analysis and manipulation

作者： Gallagher, Keith Binkley, David Harman, Mark Univ Durham South Rd Durham DH1 3LE England Loyola Coll Baltimore MD 21210 USA Kings Coll London London WC2R 2LS England

ISBN: (纸本)9780769523538

Traditional program slicing requires two Parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the slicing criterion: those variables that are not of interest. This third parameter is called the stoplist. When a variable in the stop-list is encountered, the data-flow dependence analysis of slicing is terminated for that variable. Stop-list slicing further focuses on the computation of interest, while ignoring computations known or determined to be uninteresting. This has the potential to reduce slice size when compared to traditional forms of slicing. In order to assess the size of the reduction obtained via stop-list slicing, the paper reports the results of three empirical evaluations: a large scale empirical study into the maximum slice size reduction that can be achieved when all program variables are on the stop-list;a study on a real program, to determine the reductions that could be obtained in a typical application;and qualitative case-based studies to illustrate stop-list slicing in the small. The large-scale study concerned a suite of 42 programs of approximately 800KLoc in total. Over 600K slices were computed. Using the maximal stoplist reduced the size of the computed slices by about one third on average. The typical program showed a slice size reduction of about one-quarter. The case-based studies indicate that the comprehension effects are worth further consideration.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning Based Automatic Folding of Dynamically Typed Languages 3

A Machine Learning Based Automatic Folding of Dynamically Ty...

引用

3rd ACM SIGSOFT international workshop on Machine Learning Techniques for Software Quality Evaluation (MaLTeSQuE)

作者： Viuginov, Nickolay Filchenkov, Andrey ITMO Univ Fac Informat Technol & Programming St Petersburg Russia JetBrains St Petersburg Russia

ISBN: (纸本)9781450368551

The popularity of dynamically typed languages has been growing strongly lately. Elegant syntax of such languages like javascript, python, PHP and ruby pays back when it comes to finding bugs in large codebases. The analysis is hindered by specific capabilities of dynamically typed languages, such as defining methods dynamically and evaluating string expressions. For finding bugs or investigating unfamiliar classes and libraries in modern IDEs and text editors features for folding unimportant code blocks are implemented. In this work, data on user foldings from real projects were collected and two classifiers were trained on their basis. The input to the classifier is a set of parameters describing the structure and syntax of the code block. These classifiers were subsequently used to identify unimportant code fragments. The implemented approach was tested on JavaScript and Python programs and compared with the best existing algorithm for automatic code folding.

关键词： Dynamically typed languages JavaScript Python Automatic Folding source code analysis Abstract Syntax tree

来源：评论

学校读者我要写书评

暂无评论

Predicate-based dynamic slicing of message passing programs 2

Predicate-based dynamic slicing of message passing programs

引用

2nd ieee international workshop on source code analysis and manipulation

作者： Rilling, J Li, HF Goswami, D Concordia Univ Dept Comp Sci Montreal PQ H3G 1M8 Canada

ISBN: (纸本)0769517935

Program Slicing is a well-known decomposition technique that transforms a large program into a smaller one that contains only statements relevant to the computation of a selected function. In this paper, we present a novel predicate-based dynamic slicing algorithm for message passing programs. Unlike the more traditional slicing criteria that focus only on the parts of the program that influence a variable of interest at a specific position in the program, a predicate focuses on those parts of the program that influence the predicate. The dynamic predicate slice captures some global requirements or suspected error properties of a distributed program and computes all statements that are relevant. This article presents an algorithm and a sample computation to illustrate how the predicate slice can be computed. Additionally, we introduce a predicate trace to classify the relevance of statement executions based on the predicate slice. A compressed predicate trace can be used to reveal those instances of statement execution that turn the global predicate true, among others.

关键词： program slicing message passing program comprehension predicate slice predicate trace

来源：评论

学校读者我要写书评

暂无评论

An empirical study of the evolution of PHP web application security

An empirical study of the evolution of PHP web application s...

引用

2011 3rd international workshop on Security Measurements and Metrics, Metrisec 2011

作者： Doyle, Maureen Walden, James Department of Computer Science Northern Kentucky University Highland Heights KY 41099 United States

ISBN: (纸本)9780769546803

Web applications are increasingly subject to mass attacks, with vulnerabilities found easily in both open source and commercial applications as evinced by the fact that approximately half of reported vulnerabilities are found in web applications. In this paper, we perform an empirical investigation of the evolution of vulnerabilities in fourteen of the most widely used open source PHP web applications, finding that vulnerabilities densities declined from 28.12 to 19.96 vulnerabilities per thousand lines of code from 2006 to 2010. We also investigate whether complexity metrics or a security resources indicator (SRI) metric can be used to identify vulnerable web application showing that average cyclomatic complexity is an effective predictor of vulnerability for several applications, especially for those with low SRI scores. © 2011 ieee.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：