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

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

来源：评论

学校读者我要写书评

暂无评论

Aerodynamic Analysis of Delta Wing Aircraft and Effect of the Propeller Using OpenFOAM

Aerodynamic Analysis of Delta Wing Aircraft and Effect of th...

引用

2023 ivannikov ISPRAS Open Conference, ISPRAS 2023

作者： Mkoyan, Ruslan Romanova, Daria Sargsyan, Sevak Epikhin, Andrey Russian-Armenian University Ivannikov Institute for System Programming of the Ras Center of Advanced Software Technologies Yerevan Armenia Ivannikov Institute for System Programming of the Ras Lomonosov Msu Moscow Russia Ivannikov Institute for System Programming of the Ras Moscow Russia

ISBN: (纸本)9798350349993

This paper presents a calculation of the aerodynamic characteristics of the ZOHD Alpha Strike UAV model, designed with a delta wing. The focus of the study is the overall layout of the aircraft and the influence of the propeller on its aerodynamic characteristics. The computational fluid dynamics tool OpenFOAM is used as an effective method to solve the complex aerodynamic problems inherent in this UAV model. Research is carried out in an incompressible flow, due to the low speeds inherent in such aircraft. A numerical methodology is proposed for quick evaluation of the aerodynamic performances of UAV models with a propeller. A simple dynamic model and flight data are presented. The calculation results are verified using a flight experiment. © 2023 IEEE.

关键词： Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

Practical Escape Analysis in an Open World

引用

电子学报(英文版) 2009年第1期18卷 31-36页

作者： SHI Xiaohua JIN Maozhong WU Gansha LUEH Gueiyuan Software Engineering Institute Beihang University Beijing 100083 China Programming System Laboratory Microprocessor Technology Laboratory Intel Corporation China

A novel escape analysis framework that handles the Java open-world features is proposed and evaluated. The novel approach analyzes a Java program with an optimistic view that the program is in a closed world and applies optimizations aggressively. The framework also provides a mechanism that controls the analysis complexity. The results show that the escape analysis framework, which has been implemented in Intel's Open Runtime Platform on X86, eliminated about 70% and 94% synchronization operations, and improved the runtime performance 15.77% and 31.28%, for SPECjbb2000 and 209_db respectively.

关键词：世界逃逸 Java程序运行性能同步操作开放式框架复杂性

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Advanced Grammar-Based Fuzzing

Advanced Grammar-Based Fuzzing

引用

2022 ivannikov Memorial Workshop, IVMEM 2022

作者： Sargsyan, Sevak Hakobyan, Jivan Mehrabyan, Matevos Mkoyan, Ruslan Sahakyan, Vardan Melkonyan, Vahagn Arutunian, Mariam Fahradyan, Arman Avetisyan, Arutyun Russian-Armenian University Center of Advanced Software Technologies Yerevan Armenia Programming of the RAS Ivannikov Institute for System Moscow Russia

ISBN: (数字)9781665492973

ISBN: (纸本)9781665492973

This article presents novel method for efficient fuzzing of programs accepting complex structured data. It generates input data based on formal grammar description. Data generator is periodically autoconfigured based on target programs code coverage. It means that the type of generated programs is dynamically changed to increase code coverage. Data generator uses descriptions of BNF (Backus-Naur Form) rules in ANTLR (ANother Tool for Language Recognition) platform. More than 250 languages and data formats are supported. Every rule of grammar is designed as universal pushdown automata, which allows automatically generate BNF compatible data by traversing automata. We added weights for each transition of automata to provide priority of highly efficient paths (sequence of transitions). These weights are automatically changed by fuzzing engine, which provides data generator adaptation based on the coverage of the target programs. According to experimental results, we were able to increase code coverage significantly for several widely used programs including compilers. © 2022 IEEE.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Analysis of wake around DARPA Suboff including self-propulsion with a seven-blade propeller in positive pitches

Analysis of wake around DARPA Suboff including self-propulsi...

引用

2022 ivannikov Open Conference, ISPRAS 2022

作者： Wang, Xinyu Zhang, Qin Qin, Yingfan Wang, Tianyuan Wang, Zhicheng Epikhin, Andrey Ocean University of China College of Engineering Qingdao China Programming of the Ras Ivannikov Institute for System Moscow Russia

ISBN: (纸本)9798350398533

The Delayed Detached Eddy Simulation(DDES) of the DARPA Suboff, including self-propulsion with sail, fins and seven-blade propeller, is performed at high Reynolds number and pitch-angle inflow besed OpenFOAM, the mixing evolution and energy performance of the vortex structure have been focused. Computations of Suboff are validated against reference data, simulation and experiment of the propeller are carried out simultaneously under the condition of high blade load (J = 0). The time-averaged, phase-averaged, instantaneous vorticity fields and power spectral density (PSD) around the submarine including self-propulsion, are reported under oblique inflow with drift angles of 0°, 7° and 15°. Computations demonstrate that the oblique inflow will deflect and attenuate the horseshoe vortex behind the sail resulting in no longer interacting with fin. Besides, it will speed up the process of the vortex dissipation to a certain extent. With the increase of inflow angle, the hydrodynamic performance of the propeller will have an increasing trend, but the trend will decrease. The fin-sheet vortex accelerates the instability process of the leeward wake, moreover, the horizontal fin-sheet vortex and propeller wake will deflect leeward with the inflow-angle increasing, varying the area of interaction. It is worth noting that the tip-vortex induced by leeward fin is attracted to wake, resulting in the abnormal wake under 15° inflow, and drift opposite to the rotation direction of the propeller. © 2022 IEEE.

关键词： Wakes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：