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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

23 篇 会议
11 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

21 篇 工学
- 17 篇 计算机科学与技术...
- 10 篇 软件工程
- 6 篇 电气工程
- 6 篇 信息与通信工程
- 3 篇 电子科学与技术（可...
- 2 篇 控制科学与工程
- 2 篇 土木工程
- 2 篇 石油与天然气工程
- 2 篇 交通运输工程
- 2 篇 船舶与海洋工程
- 2 篇 安全科学与工程
- 1 篇 仪器科学与技术
- 1 篇 生物工程
- 1 篇 网络空间安全
9 篇 理学
- 4 篇 物理学
- 3 篇 数学
- 2 篇 海洋科学
- 1 篇 生物学
- 1 篇 统计学（可授理学、...
2 篇 管理学
- 2 篇 管理科学与工程(可...
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学

主题

3 篇 linux
3 篇 testing
2 篇 registers
2 篇 computer archite...
2 篇 specifications
2 篇 contracts
2 篇 automata
2 篇 kernel
2 篇 microprocessors
1 篇 non-deterministi...
1 篇 tools
1 篇 runtime
1 篇 adaptive systems
1 篇 microarchitectur...
1 篇 description
1 篇 software package...
1 篇 software defined...
1 篇 model of life cy...
1 篇 programming
1 篇 instruments

机构

3 篇 ivannikov instit...
3 篇 software enginee...
2 篇 institute of nuc...
2 篇 software enginee...
2 篇 department of ne...
2 篇 cloud technologi...
2 篇 software enginee...
2 篇 laboratory of in...
2 篇 compiler technol...
2 篇 laboratory of ul...
2 篇 atlas group univ...
1 篇 krembil research...
1 篇 department of ps...
1 篇 neural basis of ...
1 篇 department of el...
1 篇 school of mathem...
1 篇 informatics univ...
1 篇 sapienza univers...
1 篇 institute of bio...
1 篇 university of ap...

作者

8 篇 yevtushenko nina
4 篇 kossachev alexan...
4 篇 burdonov igor
3 篇 alexander kamkin
3 篇 nina yevtushenko
2 篇 škraba andrej
2 篇 pozin boris a.
2 篇 igor burdonov
2 篇 kamkin alexander
2 篇 vinarskii evgeni...
2 篇 shaidurov vladim...
2 篇 semenkin eugene
2 篇 cavalli ana rosa
2 篇 kovalev igor
2 篇 petrenko alexand...
2 篇 tiziano villa
2 篇 alexandr kossach...
1 篇 a s epikhin
1 篇 t g elizarova
1 篇 efremov denis

语言

35 篇 英文

检索条件"机构=Software Engineering Department Institute for System Programming of the RAS"

共 35 条记录，以下是1-10 订阅

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

详细简洁

排序：

Verifying Multiple Virtual Networks in software Defined Networks

Verifying Multiple Virtual Networks in Software Defined Netw...

引用

2021 IEEE East-West Design and Test Symposium, EWDTS 2021

作者： Burdonov, Igor Yevtushenko, Nina Kossachev, Alexandr Ivannikov Institute for System Programming of RAS Software Engineering Department Moscow Russia Ivannikov Institute for System Programming Software Engineering Deparment Moscow Russia

ISBN: (纸本)9781665445030

software Defined Network (SDN) technology is one of the modern network virtualization technologies. When implementing a virtual network on the SDN data plane, undesired effects may occur: the appearance of undesired paths where packages can be sent, 'looping' when the packages are infinitely cycled and infinitely cloned, duplicate paths when the host receives the same package several times. We show that these effects can occur for the joint implementation of several virtual networks even if the implementation of each separate virtual network does not cause these effects. A method for verifying the implementation of several virtual networks is proposed. A sufficient condition is established for the graph of physical connections when any set of virtual networks can be implemented without the occurrence of the above undesirable effects. © 2021 IEEE.

关键词： Verification

来源：评论

学校读者我要写书评

暂无评论

Evaluating the length of distinguishing sequences for nondeterministic Input/Output automata

Evaluating the length of distinguishing sequences for nondet...

引用

2019 IEEE East-West Design and Test Symposium, EWDTS 2019

作者： Burdonov, Igor Kossachev, Alexandr Yevtushenko, Nina Demakov, Alexey Software Engineering Department Ivannikov Institute for System Programming of RAS Moscow Russia

ISBN: (纸本)9781728110035

Distinguishing sequences are used in model based mutation testing in order to distinguish the specification from its mutants that usually represent critical implementation faults. In this paper, we consider distinguishing sequences for Input/Output automata when a sequence of inputs can be applied before getting any response or a sequence of output responses from an implementation under test. We propose a technique for deriving an r- distinguishing trace, i.e. a distinguishing trace with respect to the trace inclusion (quasi-reduction) relation, and obtain the least and upper bounds on the length of a shortest r- distinguishing trace showing that the exponential upper bound with respect to the number of states of the specification automaton is reachable;the results are then adapted for a proper case of Input/Output automata when each input is followed by an output, i.e., for Finite State Machines. © 2019 IEEE.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Implementing a Virtual Network on the SDN Data Plane

Implementing a Virtual Network on the SDN Data Plane

引用

2020 IEEE East-West Design and Test Symposium, EWDTS 2020

作者： Burdonov, Igor Yevtushenko, Nina Kossachev, Alexandr Ivannikov Institute for System Programming of Ras Software Engineering Department Moscow Russia

ISBN: (数字)9781728198996

ISBN: (纸本)9781728198996

The paper investigates the implementation of virtual networks on the SDN data plane, modeled by a graph of physical connections between network nodes. A virtual network is defined as a set of ordered host pairs (sender, receiver), and it is implemented by a set of host-host paths that uniquely determine the switch settings. It is shown that any set of host pairs can be implemented on a connected graph without the occurrence of an infinite transfer of packets in a loop and without duplicate paths when the host receives the same packet several times. However, undesired paths may occur when a host receives a packet that is not intended for this host. On the other hand, it is shown that in some cases, implementation without undesired paths inevitably leads to duplication or looping of packets. The question is posed: on which graph can any set of host pairs be implemented without looping, duplication and undesired paths? A sufficient condition is proposed and a hypothesis is put that this condition is also the necessary condition. © 2020 IEEE.

关键词： software defined networking

来源：评论

学校读者我要写书评

暂无评论

Deriving Distinguishing Sequences for Input/Output Automata

Deriving Distinguishing Sequences for Input/Output Automata

引用

2020 IEEE East-West Design and Test Symposium, EWDTS 2020

作者： Yevtushenko, Nina Burdonov, Igor Kossachev, Alexandr Ivannikov Institute for System Programming of Ras Software Engineering Department Moscow Russia

ISBN: (纸本)9781728198996

Input/Output (I/O) automata are widely used when deriving high quality tests for (components of) complex discrete systems based on so called distinguishing sequences. For I/O automata, the number of distinguishability relations is much bigger than for classical deterministic Finite State Machines (FSM). In order to avoid submitting the same test sequence several number of times, i.e., avoid the "all weather conditions"assumption, the separability relation can be considered. If two Input/Output automata are separable then there exists an input sequence such that after submitting this sequence and observing produced outputs it can be uniquely concluded which automaton is under testing. In this paper, we modify the discipline of applying input sequences and discuss the derivation of separating sequences for automata with mixed states, i.e., states where transitions both under inputs and under outputs are defined, as well as with cycles labeled by outputs. We also illustrate how an adaptive separating sequence can be derived when both automata are input-enabled. © 2020 IEEE.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable model-based test program generator for microprocessors

Reconfigurable model-based test program generator for microp...

引用

International Workshop on Variability-intensive systems Testing, Validation, and Verification

作者： Kamkin, Alexander Kornykhin, Eugene Vorobyev, Dmitry Software Engineering Department Institute for System Programming Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9780769543451

Automatic generation and simulation of test programs is known to be the main means for verifying microprocessors. The problem is that test program generators for new designs are often developed from scratch with little reuse of well-tried components. State-of-the-art tools, like Genesys-Pro and RAVEN, meet the challenge by using a model-based approach, where a microprocessor model is separated from a platform-independent generation core. However, there is still a problem. Developing a microprocessor model is rather difficult and usually requires deep knowledge of the inner-core structure and interfaces. In this paper, we describe a concept of a reconfigurable test program generator being customized with the help of architecture specifications and configuration files, which describe parameters of the microprocessor subsystems (pipeline, memory, and others). The suggested approach eases the model development and makes it possible to apply the model-based testing in the early design stages when the microprocessor architecture is frequently modified. © 2011 IEEE.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

Visualization of behavioral aspects of AADL-models 11

Visualization of behavioral aspects of AADL-models

引用

11th International Conference on Computer Science and Information Technologies, CSIT 2017

作者： Zelenov, Sergey Buzdalov, Denis Software Engineering Department Institute for System Programming Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9781538628317;9781538628300

In the paper, we describe a metamodel to represent dynamics of AADL-models. The metamodel allows to visualize step-by-step a process of models' behavioral aspects analysis. In particular, it essentially helps to debug behavioral specifications. In the paper, we consider examples of the metamodel usage to represent dynamics for the following two aspects of AADL-models: 1) simulation of a modelled system on the basis of a Behavior Annex specification;2) failure modes and effects analysis on the basis of an Error Model Annex specification. We also present a stepwise visualization tool (engine and applications for both mentioned examples) that is implemented in MASIW framework for design of modern avionics systems. © 2017 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Runtime verification of linux kernel modules based on call interception

Runtime verification of linux kernel modules based on call i...

引用

IEEE International Conference on software Testing, Verification and Validation

作者： Rubanov, Vladimir V. Shatokhin, Eugene A. Department of Software Engineering Institute for System Programming Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9780769543420

Verification of Linux kernel modules and especially device drivers is a critically important task. However, due to the special nature of the kernel operation, it is very challenging to perform runtime analysis of particular kernel modules of interest without adverse influence on the rest of the kernel. Methods and tools for addressing this challenge are the main subject of this paper. The basic method for low-influence runtime analysis of interacting software modules is call interception. Shadow state techniques represent another method. In this paper, we discuss these methods including three different approaches to implement call interception. Conclusions are made about the most suitable ways for runtime analysis of kernel modules. Finally, we present KEDR framework, an extensible runtime analysis system for Linux kernel modules, which deploys these approaches to perform different types of analysis. The system can be used by the developers of kernel modules and, in particular, may be useful for building automated driver verification systems. © 2011 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Evaluating Length of a Shortest Adaptive Homing Sequence for Weakly Initialized FSMs

Evaluating Length of a Shortest Adaptive Homing Sequence for...

引用

2020 IEEE East-West Design and Test Symposium, EWDTS 2020

作者： Vinarskii, Evgenii Yevtushenko, Nina Lomonosov Moscow State University Department of Computer Science Moscow Russia Ivannikov Institute for System Programming of Ras Software Engineering Deparment Moscow Russia

ISBN: (数字)9781728198996

ISBN: (纸本)9781728198996

There are many research papers devoted to the state identification problem of finite state machines (FSMs) which are widely used for analysis of discrete event systems. A deterministic complete reduced FSM always has a homing sequence (HS) but a number of non-deterministic FSMs not necessarily have a preset HS;nevertheless, those FSMs can still have an adaptive HS. Moreover, adaptive HS can be shorter than the preset. If each state can be an initial state of a complete FSM, i.e., an FSM is non-initialized, then a shortest adaptive HS (if it exists) has polynomial length in the number of FSM states. We show that it is not the case for weakly-initialized FSMs: such FSMs can have a shortest adaptive HS of exponential length in the number of FSM states/transitions. However, the experimental evaluation shows that the non-polynomial upper bound for a shortest adaptive HS was never reached for randomly generated weakly-initialized two-input FSMs. © 2020 IEEE.

关键词： Adaptive homing sequence Non-deterministic FSM weakly initialized FSM

来源：评论

学校读者我要写书评

暂无评论

Synchronous composition of quasi-complete and quasi-deterministic FSMs

Synchronous composition of quasi-complete and quasi-determin...

引用

International Conference on Actual Problems of systems and software engineering

作者： Igor Burdonov Alexandr Kossachev Nina Yevtushenko Tiziano Villa Software Engineering department Ivannikov Institute for System Programming of RAS Software engineering deparment Ivannikov Institute for System Programming Computer Science Department University of Verona

ISBN: (纸本)9781728160627

In this paper, we consider the synchronous composition of Finite State Machines (FSMs) that corresponds to instantaneous communication of hardware components. Such FSMs can be deterministic or nondeterministic, partial or complete. We first extend the existing synchronous composition operator from a pair of components to a collection of components with multiple input and output ports, and provide a procedure to compute the composition working directly on the collection of transition tables of the component FSMs. Then, based on the notion of input-output Moore pair (the output is not sensitive to the input), we prove the following sufficient condition: if the composition has the property that every cycle of ports has a component with a Moore pair, then the class of quasi-complete and quasi-deterministic FSMs is closed under the proposed synchronous composition.

关键词： Finite state machine (FSM) Quasi-deterministic FSM Quasi-complete FSM Moore pair Synchronous composition Pairing multi-input output ports harbors finite state machines deterministic

来源：评论

学校读者我要写书评

暂无评论

Deriving Distinguishing Sequences for Input/Output Automata

Deriving Distinguishing Sequences for Input/Output Automata

引用

East-West Design & Test Symposium (EWDTS)

作者： Nina Yevtushenko Igor Burdonov Alexandr Kossachev Software Engineering department Ivannikov Institute for System Programming of RAS Moscow Russia Software engineering deparment Ivannikov Institute for System Programming Moscow Russia

ISBN: (数字)9781728198996

ISBN: (纸本)9781728199009

Input/Output (I/O) automata are widely used when deriving high quality tests for (components of) complex discrete systems based on so called distinguishing sequences. For I/O automata, the number of distinguishability relations is much bigger than for classical deterministic Finite State Machines (FSM). In order to avoid submitting the same test sequence several number of times, i.e., avoid the "all weather conditions" assumption, the separability relation can be considered. If two Input/Output automata are separable then there exists an input sequence such that after submitting this sequence and observing produced outputs it can be uniquely concluded which automaton is under testing. In this paper, we modify the discipline of applying input sequences and discuss the derivation of separating sequences for automata with mixed states, i.e., states where transitions both under inputs and under outputs are defined, as well as with cycles labeled by outputs. We also illustrate how an adaptive separating sequence can be derived when both automata are input-enabled.

关键词： Automata Testing software engineering programming Transforms Meteorology Adaptive systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：