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

Ivannikov ISPRAS Open Conference (ISPRAS)

作者： Arutyun I. Avetisyan Sergei P. Prokhorov Ivannikov Institute for System Programming of Russian Academy of Sciences Moscow Russia Vavilov Institute for History of Science and Technology of Russian Academy of Sciences Moscow Russia

ISBN: (数字)9781665412919

ISBN: (纸本)9781665448215

The article is dedicated to Victor Ivannikov, a prominent Russian scientist who worked in computer science, primarily system programming. His practical work was primarily related to the development of operating systems to manage multicomputer heterogeneous systems. The AS-6 multi-machine complex developed with his active participation was used in the Apollo-Soyuz space flight control, the first international space mission, carried out jointly by the United States and the Soviet Union. In the difficult period of the 1990s, when funding for new computer developments in Russia almost wholly ceased, he created the institute for system programming. Now it is a successful institute actively participating in international research programs and practical projects. He was an active participant in the Central-East European Initiative of the IEEE Computer Society, designed to remove the barriers that prevented scientists from socialist countries from participating in international cooperation during the Cold War. He was the founder and first head of the systems programming departments at three leading Russian universities. He achieved a lot in his life. However, he considered the most important achievement of his life that he succeeded to found the institute for system programming. The institute, in which system programming is not tied to a specific computer model, but system programming is the dominant discipline as a scientific direction. An institute in which an “atmosphere of creative brotherhood” would prevail. He considered this to be the essential condition for creative work and the achievement of high scientific results.

关键词： Space missions Atmospheric modeling Operating systems Computational modeling Europe programming Aerospace electronics

来源：评论

学校读者我要写书评

暂无评论

Assessing the Coverage of W-Based Conformance Testing Methods Over Code Faults

SSRN

引用

SSRN 2024年

作者： El-Fakih, Khaled Hassan, Faiz Alzaatreh, Ayman Yevtushenko, Nina College of Engineering American University of Sharjah Sharjah United Arab Emirates Ivannikov Institute for System Programming of the RAS Moscow Russia

We present novel empirical assessments of prominent finite state machine (FSM) conformance test derivation methods against their coverage of code faults. We consider a number of realistic extended FSM examples with their related Java implementations and derive for these examples complete test suites using the W method and its HSI and H derivatives considering the case when the implementation under test (IUT) has the same number of states as the specification FSM. We also consider W++, HSI++, and H++ test suites derived considering the case when the IUT can have one more extra state. For each pair of considered test suites, we determine if there is a difference between the pair in covering the implementations faults. If the difference is significant, we determine which test suite outperforms the other. We run two other assessments which show that the obtained results are not due to the size or length of the test suites. In addition, we conduct assessments to determine whether each of the methods has better coverage of certain classes of faults than others and whether the W outperforms the HSI and H methods over only certain classes of faults. The results and outcomes of conducted experiments are summarized. © 2024, The Authors. All rights reserved.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Sydr: Cutting Edge Dynamic Symbolic Execution

Sydr: Cutting Edge Dynamic Symbolic Execution

引用

Ivannikov ISPRAS Open Conference (ISPRAS)

作者： Alexey Vishnyakov Andrey Fedotov Daniil Kuts Alexander Novikov Darya Parygina Eli Kobrin Vlada Logunova Pavel Belecky Shamil Kurmangaleev Ivannikov Institute for System Programming of the RAS Moscow Russia Lomonosov Moscow State University Moscow Russia Moscow Institute of Physics and Technology Moscow Russia

ISBN: (数字)9781665412919

ISBN: (纸本)9781665448215

The security development lifecycle (SDL) is becoming an industry standard. Dynamic symbolic execution (DSE) has enormous amount of applications in computer security (fuzzing, vulnerability discovery, reverse-engineering, etc.). We propose several performance and accuracy improvements for dynamic symbolic execution. Skipping non-symbolic instructions allows to build a path predicate 1.2-3.5 times faster. Symbolic engine simplifies formulas during symbolic execution. Path predicate slicing eliminates irrelevant conjuncts from solver queries. We handle each jump table (switch statement) as multiple branches and describe the method for symbolic execution of multi-threaded programs. The proposed solutions were implemented in Sydr tool. Sydr performs inversion of branches in path predicate. Sydr combines DynamoRIO dynamic binary instrumentation tool with Triton symbolic engine. We evaluated Sydr features on 64-bit Linux executables.

关键词： Instruments Switches Tools Maintenance engineering Performance analysis Engines Standards

来源：评论

学校读者我要写书评

暂无评论

About cloud storage systems survivability

About cloud storage systems survivability

引用

2020 International Workshop on Data Mining and Knowledge Engineering, YRID 2020

作者： Kucherov, Nikolay Dvoryaninova, Inna Babenko, Mikhail Sotnikova, Natalia Hung, Nguyen Viet North-Caucasus Federal University 1 Pushkin Street Stavropol355017 Russia Institute for System Programming Russian Academy of Sciences 25 Alexander Solzhenitsyn st. Moscow109004 Russia LeQuyDon Technical University 236 Hoang Quoc Viet Hanoi Viet Nam

This article proposes an approach to improving reliability and survivability based on modular arithmetic. The proposed approach makes it possible to increase the survivability of cloud storage systems, as well as reliability and fault tolerance of data storage. To increase fault tolerance in the event of a failure, the redistribution of the processed data is applied. The proposed model allows restoring the saved data in the event of failure of one or more cloud servers. © 2020 this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

EgoLP: Fast and Distributed Community Detection in Billion-Node Social Networks

EgoLP: Fast and Distributed Community Detection in Billion-N...

引用

IEEE International Conference on Data Mining Workshops (ICDM Workshops)

作者： Nazar Buzun Anton Korshunov Valeriy Avanesov Ilya Filonenko Ilya Kozlov Denis Turdakov Hangkyu Kim Institute for System Programming of the Federal Agency of Scientific Organizations Moscow Russia Samsung Electronics Co. Ltd Suwon South Korea

Community structure is one of the most important and characteristic features of social networks. Numerous methods for discovering implicit user communities from a social graph of users have been proposed in recent years. However, most of them have performance and scalability issues which make them hardly applicable to population-wide analysis of modern social networks (billions of users and growing). In this paper we present EgoLP - an efficient and fully distributed method for social community detection. The method is based on propagating community labels through the network with the help of friendship groups of individual users. Experimental evaluation of Apache Spark implementation of the method showed that it outperforms some state-of-the-art methods in terms of a) similarity of extracted communities to the reference ones from synthetic networks, b) precision of user attributes prediction in Facebook based solely on community memberships, c) likelihood of the discovered community structure according to the proposed generative model. At the same time, the method retains near-linear complexity in the number of edges and is thus applicable to social graphs of up to 10 9 users.

关键词： Communities Social network services Sparks Image edge detection Accuracy Scalability Receivers

来源：评论

学校读者我要写书评

暂无评论

Automatic Type Reconstruction in Disassembled C Programs

Automatic Type Reconstruction in Disassembled C Programs

引用

Working Conference on Reverse Engineering

作者： K. Dolgova A. Chernov Institute for System Programming Russian Academy of Science Moscow Russia Computational Mathematics and Cybernetics Department Moscow State University Moscow Russia

ISBN: (纸本)9780769534299;0769534295

This paper presents an algorithm for automatic type reconstruction from target assembly code compiled by a C compiler. The primitive language types are recovered by an iterative algorithm, which operates over the lattice of primitive types' properties. Layout of composite types is reconstructed by building set of accessible offsets for each composite type. The algorithm is the essential part of a tool for program decompilation being developed by the authors.

关键词： Registers Assembly Equations Finite element methods Construction industry Algorithm design and analysis High level languages

来源：评论

学校读者我要写书评

暂无评论

Fog computing state of the art: Concept and classification of platforms to support distributed computing systems

arXiv

引用

arXiv 2021年

作者： Kirsanova, Alexandra A. Radchenko, Gleb I. Tchernykh, Andrei N. South Ural State University Chelyabinsk Russia CICESE Research Center Ensenada Mexico Ivannikov Institute for System Programming of the RAS Russia

As the Internet of Things (IoT) becomes a part of our daily life, there is a rapid growth in the connected devices. A well-established approach based on cloud computing technologies cannot provide the necessary quality of service in such an environment, particularly in terms of reducing data latency. Today, fog computing technology is seen as a novel approach for processing large amounts of critical and time-sensitive data. This article reviews cloud computing technology and analyzes the prerequisites for the evolution of this approach and the emergence of the concept of fog computing. As part of an overview of the critical features of fog computing, we analyze the frequent confusion of the concepts of fog and edge computing. We provide an overview of fog computing technologies: virtualization, containerization, orchestration, scalability, parallel computing environments, as well as a systematic analysis of the most popular platforms that support fog computing. As a result of the analysis, we offer two approaches to classification of the fog computing platforms: by the principle of openness/closure of components and a three-level classification based on the provided platform functionality (Deploy-, Platform- and Ecosystem as a Service). © 2021, CC BY.

关键词： Fog computing

来源：评论

学校读者我要写书评

暂无评论

Experimental Evaluation of Timed Finite State Machine Based Test Derivation

Experimental Evaluation of Timed Finite State Machine Based ...

引用

Annual Siberian Russian Workshop on Electron Devices and Materials (EDM)

作者： Aleksandr S. Tvardovskii Evgenii M. Vinarskii Nina V. Yevtushenko Tomsk State University Tomsk Russia Lomonosov Moscow State University Moscow Russia Ivannikov Institute for System Programming Moscow Russia

Finite State Machines (FSMs) are widely used for deriving tests with guaranteed fault coverage for various kinds of discrete and hybrid systems such as telecommunication protocols and services. A Timed FSM (TFSM) seems to be a natural extension of an FSM annotated with timed variables that allows to adequately describe a system under test for which time aspects are important. However, most of existing test derivation methods for timed automata with several clocks return very long test suites. We propose to consider FSMs with a single clock for deriving test suites with guaranteed fault coverage and this can be a compromise between the model complexity and adequacy. A test is derived based on FSM abstraction of a given TFSM and is complete with respect to an established fault model. The experiments were performed for randomly generated TFSMs as well as for TFSMs which are used for service description and they clearly show that a proposed method returns high quality tests with the length that is close to those returned by classical FSM based methods. For service TFSMs we also evaluate the test suite length for different fault domains, the length of preset distinguishing and homing sequences which are widely used for minimizing FSM based test suites with guaranteed fault coverage.

关键词： Clocks Automata Delays Electron devices Protocols Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Reconstruction of Class Hierarchies for Decompilation of C++ Programs

Reconstruction of Class Hierarchies for Decompilation of C++...

引用

(CSMR) European Conference on Software Maintenance and Reengineering

作者： A. Fokin K. Troshina A. Chernov Computational Mathematics and Cybernetics Department Moscow State University Moscow Russia Institute for System Programming Russian Academy of Science Moscow Russia

This paper presents a method for automatic reconstruction of polymorphic class hierarchies from the assembly code obtained by compiling a C++ program. If the program is compiled with run-time type information (RTTI), class hierarchy is reconstructed via analysis of RTTI structures. In case RTTI structures are missing in the assembly, a technique based on the analysis of virtual function tables, constructors and destructors is used. A tool for automatic reconstruction of polymorphic class hierarchies that implements the described technique is presented. This tool is implemented as a plug in for IDA Pro Interactive Disassembler. Experimental study of the tool is provided.

关键词： Assembly Computer languages Open source software Electronic mail Optimization History

来源：评论

学校读者我要写书评

暂无评论

Reconstruction of Composite Types for Decompilation

Reconstruction of Composite Types for Decompilation

引用

IEEE International Workshop on Source Code Analysis and Manipulation

作者： Katerina Troshina Yegor Derevenets Alexander Chernov Institute of System Programming Russian Academy of Science Moscow Russia Computational Mathematics and Cybernetics Dept Moscow State University Moscow Russia

Decompilation is reconstruction of a program in a high-level language from a program in a low-level language. This paper presents a method for automatic reconstruction of composite types (structures, arrays and combinations of them)in a high-level program during decompilation. Assembly code is obtained by disassembling a binary code or traces collected by a simulator. The proposed method is based on expressing memory access operations as pairs base offset, then building equivalence classes for the bases used in the program and accumulating offsets for each equivalence class. For Strictly conforming C programs our approach is substantiated by the C language semantics as defined in the international standard. However, experimental results have revealed that it is applicable for real-world programs also. Experimental results are obtained for a number of open-source programs as well as for traces collected from them. The method is an essential part of the tool for program decompilation TyDec being developed by the authors. Decompiler TyDec can be used as a standalone tool or as a plug-in for Interactive Trace Explorer TrEx being developed in institute for system programming, Russian Academy of Sciences.

关键词： Registers Assembly Indexes programming Algorithm design and analysis Arrays

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：