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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

174 篇 会议
63 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

135 篇 工学
- 113 篇 计算机科学与技术...
- 94 篇 软件工程
- 29 篇 力学（可授工学、理...
- 20 篇 控制科学与工程
- 13 篇 机械工程
- 12 篇 信息与通信工程
- 11 篇 电气工程
- 11 篇 安全科学与工程
- 8 篇 航空宇航科学与技...
- 6 篇 电子科学与技术（可...
- 6 篇 生物工程
- 5 篇 动力工程及工程热...
- 4 篇 轻工技术与工程
- 3 篇 光学工程
- 3 篇 化学工程与技术
- 3 篇 石油与天然气工程
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 测绘科学与技术
83 篇 理学
- 50 篇 数学
- 33 篇 物理学
- 17 篇 统计学（可授理学、...
- 10 篇 系统科学
- 6 篇 生物学
- 4 篇 化学
- 4 篇 大气科学
25 篇 管理学
- 13 篇 管理科学与工程(可...
- 11 篇 图书情报与档案管...
- 7 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
1 篇 哲学
1 篇 法学
1 篇 历史学
1 篇 农学

主题

19 篇 static analysis
12 篇 conferences
9 篇 computational mo...
7 篇 libraries
7 篇 fuzzing
7 篇 codes
7 篇 numerical models
7 篇 source coding
6 篇 registers
6 篇 programming
6 篇 numerical simula...
6 篇 software testing
6 篇 software
6 篇 testing
6 篇 mathematical mod...
6 篇 standards
5 篇 tools
5 篇 instruments
5 篇 computer archite...
5 篇 computer bugs

机构

57 篇 ivannikov instit...
36 篇 ivannikov instit...
29 篇 lomonosov moscow...
17 篇 moscow institute...
14 篇 lomonosov moscow...
12 篇 ivannikov instit...
11 篇 ivannikov instit...
9 篇 bauman moscow st...
9 篇 bauman moscow st...
7 篇 moscow institute...
7 篇 ivannikov instit...
7 篇 institute for sy...
6 篇 ivannikov instit...
5 篇 tomsk state univ...
5 篇 ivannikov instit...
5 篇 programming of t...
5 篇 lomonosov moscow...
4 篇 college of engin...
4 篇 ivannikov instit...
4 篇 mohamed bin zaye...

作者

15 篇 yevtushenko nina
12 篇 vishnyakov alexe...
11 篇 kuts daniil
10 篇 parygina darya
10 篇 fedotov andrey
8 篇 gasnikov alexand...
8 篇 burdonov igor
7 篇 logunova vlada
7 篇 marchevsky ilia
6 篇 daniil kuts
6 篇 epikhin andrey
6 篇 ilia marchevsky
6 篇 kobrin eli
6 篇 savidov georgy
6 篇 nina yevtushenko
5 篇 andrey belevants...
5 篇 borodin alexey
5 篇 alexey vishnyako...
5 篇 alexey borodin
5 篇 alexander kamkin

语言

234 篇 英文
5 篇 其他
4 篇 俄文

检索条件"机构=Institute for System Programming of RAS"

共 241 条记录，以下是51-60 订阅

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

详细简洁

排序：

User Defined Checkers for Static Analysis with Symbolic Execution

User Defined Checkers for Static Analysis with Symbolic Exec...

引用

2024 Ivannikov Memorial Workshop, IVMEM 2024

作者： Galustov, Artemiy Borodin, Alexey Ivannikov Institute for System Programming of the RAS Moscow Russia Lomonosov Moscow State University Moscow Russia

ISBN: (纸本)9798331504663

Many modern static analysis tools provide toolkits that allow creation of custom checkers by end users. The majority of existing solutions choose AST-based approaches to provide a simpler declarative API. Solutions based on dataflow analysis or symbolic execution use complex explicit APIs that require much more expertise to achieve decent results compared to AST-based checkers. Even though the latter approach is much more powerful simplicity of the former made it much more *** this paper we introduce SvaceAPI a tool to write checkers based on symbolic execution in a declarative way. We describe a simple pattern-based API that leverages symbolic execution and attributes provided by Svace. Testing the API on a couple of checkers and open source programs across the variety of languages showed the same quality results as for built-in Svace checkers without noticeable performance regressions. © 2024 IEEE.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Static Analysis for Go: Build Interception

Static Analysis for Go: Build Interception

引用

2023 Ivannikov ISPras Open Conference, ISPras 2023

作者： Dvortsova, Varvara Izbyshev, Alexey Borodin, Alexey Belevantsev, Andrey Ivannikov Institute for System Programming of the Ras Moscow Russia Lomonosov Moscow State University Moscow Russia

ISBN: (纸本)9798350349993

This paper presents a method for build interception of Go projects and utilizing the intercepted information for building an intermediate representation used in a static analyzer. The paper discusses two approaches: handling invocations of the higher-level go build command and handling invocations of the lower-level compile tool. The second solution is applicable not only to the built-in Go build system but also to other build systems that directly utilize the low-level compile tool, such as Bazel, Please, Pants. It also covers compilations involving CGO. © 2023 IEEE.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Docreader labeling system for line type classifier 4

Docreader labeling system for line type classifier

引用

4th Scientific-Practical Workshop Information Technologies: Algorithms, Models, systems, ITAMS 2021

作者： Kozlov, Ilya S. Ivannikov Institute for System Programming of the RAS Alexander Solzhenitsyn st. 25 Moscow109004 Russia

We develop the document analysis system, which is able to extract text and text metadata (such as font size and style), and restore the document structure. Some parts of the pipeline are based on machine learning thus requiring training and the labeled dataset, creating a training dataset is based on manual labeling. In this article, we describe an approach to the creation of a labeling system in the task of multiclass classification of document lines (paragraphs). The pipeline consists of several stages ranged from getting the source documents to getting a ready-to-learn dataset. An approach to the analysis of scanned documents and documents in docx and txt format is considered. In our work, we focus on intra-team labeling, thus we do not consider some problems, common for the crowdsourcing approach (such as unscrupulous annotators). © 2021 Copyright for this paper by its authors.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

LibAFL-DiFuzz: Advanced Architecture Enabling Directed Fuzzing

LibAFL-DiFuzz: Advanced Architecture Enabling Directed Fuzzi...

引用

2024 Ivannikov Open Conference, ISPras 2024

作者： Parygina, Darya Mezhuev, Timofey Kuts, Daniil Ivannikov Institute for System Programming of the RAS Moscow Russia Lomonosov Moscow State University Moscow Russia

ISBN: (纸本)9798331526023

Directed fuzzing performs best for targeted program testing via estimating the impact of each input in reaching predefined program points. But due to insufficient analysis of the program structure and lack of flexibility and configurability it can lose efficiency. In this paper, we enhance directed fuzzing with context weights for graph nodes and resolve indirect edges during call graph construction. We construct flexible tool for directed fuzzing with components able to be easily combined with other techniques. We implement proposed method in three separate modules: DiFuzzLLVM library for graph construction and indirect calls resolving, DiFuzz static analysis tool for processing program graphs and computing proximity metrics, and LibAFL-DiFuzz directed fuzzer based on LibAFL fuzzing library. We create additional LibAFL modules for enabling custom power scheduling and static instrumentation. We evaluate indirect calls resolving and get increase in directed fuzzing efficiency for reaching deeper target points. We evaluate context weights contribution and get benefits in TTE and scheduling iterations number. We evaluate our fuzzer in comparison with AFLGo and BEACON, and reveal speedup in time to exposure on several benchmarks. Furthermore, our tool implements some important usability features that are not available in mentioned tools: target points detection, multiple target points support, etc. © 2024 IEEE.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Casr-Cluster: Crash Clustering for Linux Applications

Casr-Cluster: Crash Clustering for Linux Applications

引用

2021 Ivannikov Ispras Open Conference, ISPras 2021

作者： Savidov, Georgy Fedotov, Andrey Ivannikov Institute For System Programming Of The Ras Moscow Russia Lomonosov Moscow State University Moscow Russia

ISBN: (纸本)9781665423304

Crash report analysis is a necessary step before developers begin fixing errors. Fuzzing or hybrid (with dynamic symbolic execution) fuzzing is often used in the secure Development lifecycle. Modern fuzzers could produce many crashes and developers do not have enough time to fix them till release date. There are two approaches that could reduce developers' effort on crash analysis: crash clustering and crash severity estimation. Crash severity estimation could help developers to prioritize crashes and close security issues first. Crash clustering puts similar crash reports in one cluster what could speed up the analyzing time for all crash reports. In this paper, we focus on crash clustering. We propose an approach for clustering and deduplicating of crashes that occurred in Linux applications. We implement this approach as a tool that could cluster Casr [1] crash reports. We evaluated our tool on a set of crash reports that was collected from fuzzing results. © 2021 IEEE.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

ISPras@FinTOC-2021 Shared Task: Two-stage TOC generation model 3

ISPRAS@FinTOC-2021 Shared Task: Two-stage TOC generation mod...

引用

3rd Financial Narrative Processing Workshop, FNP 2021

作者： Kozlov, Ilya Belyaeva, Oksana Bogatenkova, Anastasiya Perminov, Andrew Ivannikov Institute for System Programming of the RAS 25 Alexander Solzhenitsyn Str. Moscow109004 Russia

We propose a two-stage approach for TOC generation from financial documents. This work connected with participation in FinTOC-2021 Shared Task: "Financial Document Structure Extraction". The competition contains two subtasks: title detection and TOC generation. Our model consists of two classifiers: the first binary classifier separates title lines from non-title, the second one determines the title level. In the title detection task, we got 0.813 and 0.787 F1 measure, in the TOC generation task we got 37.9 and 42.1 the harmonic mean between Inex F1 score and Inex level accuracy for English and French documents respectively. With these results, our approach took third place among all submissions. As a team, we took second place in the competition in all categories. © Proceedings of the 3rd Financial Narrative Processing Workshop, FNP 2021. All rights reserved.

关键词： Finance

来源：评论

学校读者我要写书评

暂无评论

Efficient command buffer recording for accelerated rendering of large 3D scenes 12

Efficient command buffer recording for accelerated rendering...

引用

12th International Conference on Interfaces and Human Computer Interaction 2018, 11th International Conference on Game and Entertainment Technologies 2018 and 12th International Conference on Computer Graphics, Visualization, Computer Vision and Image Processing 2018, part of the Multi Conference on Computer Science and Information systems 2018, MCCSIS 2018

作者： Gonakhchyan, Viacheslav I. Ivannikov Institute for System Programming of the RAS Alexander Solzhenitsyn st. 25 Moscow109004 Russia

ISBN: (纸本)9789898533791

Interactive rendering of 3D scenes with a big number of objects is computationally intensive. It is hard to determine an efficient way of rendering command recording and submission. Command buffers can be recorded each frame, but that incurs a performance penalty. Command buffers can be created as a pre-processing step and then included in the primary command buffer during rendering, but that requires additional memory for holding multiple buffers. Command buffers can be created for a node in a decomposition hierarchy, but we need to determine the proper number of levels and fit them into the limited amount of memory. We propose a rendering algorithm, which is based on the space decomposition hierarchy with the determined height. It performs frustum culling and occlusion culling during the CPU idle time to improve the rendering performance. We show that the proposed algorithm efficiently handles scenes with a big number of objects and high depth complexity. © 2018.

关键词： Three dimensional computer graphics

来源：评论

学校读者我要写书评

暂无评论

Distinguishing transition systems with the nondeterministic behavior 21

Distinguishing transition systems with the nondeterministic ...

引用

21st Conference on Scientific Services and Internet, SSI 2019

作者： Burdonov, Igor Yevtushenko, Nina Kossachev, Alexandre Ivannikov Institute for System Programming of RAS 25 Alexander Solzhenitsyn str. Moscow109004 Russia

Test generation is an important issue when checking functional and nonfunctional requirements for components of distributed systems and formal models are utilized in order to derive test suites with guaranteed fault coverage, i.e., test suites which detect critical component faults. Finite transition systems are often used as such formal models and there are a number of methods for deriving complete test suites for Finite State Machines (FSMs) where each input is followed by an output. However, the FSM model is not always appropriate, as sequences of inputs can be applied before obtaining any output response or a sequence of output responses from a system under test, while this situation can be adequately handled using Input/Output (I/O) automata. When critical faults are enumerated, a test suite can be derived as a set of sequences distinguishing the specification I/O automaton from each considered mutant, and thus, techniques for deriving sequences which distinguish two I/O automata have to be elaborated. There are different notions of distinguishability and in this paper, we consider a so-called (adaptive) separability relation. If two automata which possibly have the nondeterministic behavior are (adaptively) separable then they can be distinguished by applying a corresponding (adaptive) input sequence only once differently from the quasi-equivalence and quasi-reduction relations where each test case has to be applied appropriate number of times under the so-called "all weather conditions" assumption. In this paper, we introduce the notion of a (adaptive) separating sequence for two I/O automata and propose a technique for deriving such a sequence for I/O automata of a special class where at each state, transitions under only inputs or under only outputs are specified. The length of a separating sequence if it exists is also briefly evaluated. Copyright © 2020 for this paper by its authors.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Approach to Finding Resource Leaks via Static Analysis

A Comprehensive Approach to Finding Resource Leaks via Stati...

引用

2024 Ivannikov Open Conference, ISPras 2024

作者： Malyshev, Nikita Borodin, Alexey Belevantsev, Andrey Ivannikov Institute for System Programming of the RAS Moscow Russia Lomonosov Moscow State University Moscow Russia

ISBN: (纸本)9798331526023

In the last 15 years many dedicated leak detection tools utilizing novel approaches were designed. Unfortunately, most of them are hard to implement and fully utilize in the scope of a multi-purpose industrial analyzer. In this paper we present a full-fledged approach to static analysis through the lens of resource leak detection. We show how general analysis architecture without much of a focus for specific defects can still be effective at finding leaks both in terms of performance and number of warnings. We briefly describe an overall structure of the Svace static analyzer and how it achieves context and path sensitivities as well as interprocedurality, while allowing for checking many program properties and being highly extensible. We also show how to use this system to implement leak detection algorithm with including a few unique extensions that we have never seen in other instruments. Our test results show a low false positive rate, relatively good performance for a multi-detector static analyzer and great scalability potential both in terms of adding new algorithms and analyzing millions of lines of code. © 2024 IEEE.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithm of self-transformation of the distributed network topology in order to minimize the wiener index 21

Distributed algorithm of self-transformation of the distribu...

引用

21st Conference on Scientific Services and Internet, SSI 2019

作者： Burdonov, Igor Ivannikov Institute for System Programming of the RAS Alexander Solzhenitsyn st. 25 Moscow109004 Russia

We consider a distributed network, the topology of which is described by a undirected tree without multiple edges and loops. The network itself can change its topology using special "commands" supplied by its nodes. The paper proposes an extremely local atomic transformation: the addition of an edge connecting the different ends of two adjacent edges, and the simultaneous removal of one of these edges. This transformation is performed by a "command" from the common vertex of two adjacent edges. It is shown that any other tree can be obtained from any tree using only atomic transformations. If the degrees of the tree vertices are limited vy the number d (d 3), then the transformation does not violate this restriction. As an example of the goal of such a transformation, the tasks of maximizing and minimizing the Wiener index of a tree with a limited degree of vertices without changing the set of its vertices are considered. The Wiener index is the sum of the pairwise distances between the vertices of the graph. The maximum Wiener index has a linear tree (a tree with two leaf vertices). For a root tree with a minimum Wiener index, its type and a method of calculating the number of vertices in the branches of the neighbors of the root is proposed. Two distributed algorithms are proposed: the transformation of a tree into a linear tree and the transformation of a linear tree into a tree with a minimum Wiener index. It is proved that both algorithms have complexity not higher than 2n 2, where n is the number of tree vertice. Copyright © 2020 for this paper by its authors.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共25页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：