?
Генерация тестовых программ для микропроцессоров на основе спецификаций подсистем памяти
Известия высших учебных заведений. Физика. 2015. Т. 58. № 11-2. С. 70–74.
А method for automated generating test programs for functional testing of single-core microprocessor memory subsystems is proposed. The proposed method is based on formal specifications of the caching and address translation mechanisms. The method variants have been successfully applied to testing of industrial microprocessors.
Teregulov T., Loubenets E. R., / Series Quantum Physics "arXiv". 2026. No. 2609.31472.
We develop a new three-party quantum secret-sharing (QSS) protocol based on a three-qubit W state. This protocol encodes the secret-sequence bits using X gates and employs randomly selected Hadamard operations and measurement bases to generate information and security-test rounds. We evaluate the efficiency of the proposed protocol and analyze its security against an internal adversary ...
Added: September 28, 2026
Shabanov N., Kuricheva O., Kurbatova J. et al., / Series Working Papers SSRN "Department of Economics Ca’ Foscari University of Venice". 2026.
The carbon balance of an ecosystem is the difference between Gross Primary Productivity (GPP) and Ecosystem Respiration (Reco) as expressed by Net Ecosystem Exchange (NEE). While remote sensing retrievals of GPP have reached maturity, Reco estimation remains underexplored and ultimately cast bias on NEE. Here we present an end-to-end multi-scale analysis of the mechanism of ...
Added: August 21, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Piontkovski D., / Series arXiv "math". 2026.
A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...
Added: June 23, 2026
Piontkovski D., / Series arXiv "math". 2025.
If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...
Added: June 23, 2026
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Iakimenko S., Информационно-управляющие системы 2026 № 2 С. 36–48
Introduction: Caching reduces content access latency by bringing it closer to users and offloading the cloud layer of the network. Edge servers are used for this purpose, but the standard TCP/IP stack does not fully utilize caching capabilities. Therefore, it is necessary to consider a cache model using the Named Data Networking stack, which is ...
Added: March 9, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 2026
Iakimenko S., Воронов А. И., Информационные технологии 2026 Т. 32 № 5 С. 243–250
This paper discusses Named Data Networking (NDN), where addressing occurs by packet name. For these networks, there is a problem of finding software for developing training stands, primarily with the ability to study their features - aggregation and caching. It is shown that in this issue it is preferable not to rely on ready-made software, ...
Added: January 1, 2026
Petrovanov I., Sergeev A., / Series Computer Science "arxiv.org". 2025. No. 2512.18332.
Transport coding reduces message delay in packet-switched networks by introducing controlled redundancy at the transport layer: original packets are encoded into coded packets, and the message is reconstructed after the first successful deliveries, effectively shifting latency from the maximum packet delay to the -th order statistic. We present a concise, reproducible discrete-event implementation of transport coding in OMNeT++, including ...
Added: December 24, 2025
Атласов И. В., Горшков А. В., Kaperko A. et al., Системы управления и информационные технологии 2024 № 2(96) С. 46–50
An analytical representation of the caching method based on the use of timestamps has been created, which ensures timely updating of cached data during client-server processing by calculating minimum timestamps. ...
Added: September 12, 2024
Alexandrov D., Kalinin A., ИТ-Стандарт 2023 № 3 С. 23–35
There are a lot of high-load systems for searching various information using the Internet. However, such systems havedis advantages and various trade-offs. For example, the search speed may drop, the quality of the search result itself may not satisfy the user, or the search engine may have poor functionality for extracting or filtering data. This ...
Added: March 7, 2024
Iakimenko S., В кн.: Современные сетевые технологии: труды 4-й Международной конференции "Современные сетевые технологии" (MoNeTec-2022), 27-29 октября 2022 г., г.Москва (короткие и стендовые доклады).: М.: Издательский отдел факультета ВМК МГУ им. М.В. Ломоносова, 2022. С. 70–76.
The article is devoted to the issues of caching in information-centric networks (ICN), aimed at addressing by the content name and separating information from its producer node. Intra-network caching is one of the main features of ICN, turning them, in fact, into a network of interconnected caches that can accumulate packets in the buffer of ...
Added: December 20, 2022
Shushpanov I., Suslov K., Ilyushin P. et al., Energies 2021 No. 14 Article 6193
At present, the entire world is moving towards digitalization, including in the electric power industry. Digitalization is in its heyday and a lot of articles and reports are devoted to this topic. At the same time, the least digitalized of the electrical networks are distribution networks that account for a very large share in electric ...
Added: December 29, 2021
Kamkin A., М.: МАКС Пресс, 2018.
This textbook is devoted to formal methods for program verification and is based on the lectures given by the author at CMC MSU, DCAM MIPT, and FCS HSE. It describes the basics of such approaches as deductive analysis and model checking. The list of topics includes formal semantics of programming languages (operational and axiomatic semantics), ...
Added: November 2, 2018
Tatarnikov A., Kamkin A., Проценко А. С. et al., Проблемы разработки перспективных микро- и наноэлектронных систем (МЭС) 2018 № 2 С. 2–8
In this paper, a specification-based test program generator for functional verification of RISC-V microprocessors is presented. The tool is based on the MicroTESK framework and consists of two main parts: (1) the formal specifications of the RISC-V ISA and (2) the ISA-independent generation core. Test programs are generated on the basis of the ISA specifications and test templates ...
Added: October 30, 2018
Yaroslavl: Ярославский государственный университет им. П.Г. Демидова, 2018.
Workshop on Program Semantics, Specification and Verification: Theory and Applications is the leading event in Russia in the field of applying of the formal methods to software analysis. Proceedings of the ninth workshop dedicated to formalisms for program semantics, formal models and verification, programming and specification languages, algebraic and logical aspects of programming. ...
Added: October 26, 2018
Kamkin A., Tatarnikov A., Смолов С. А. et al., , in: 2015 16th International Workshop on Microprocessor and SOC Test and Verification (MTV).: IEEE, 2015. P. 1–6.
In this paper, a tool for automatically generating test programs for ARM VMSAv8-64 memory management units is described. The solution is based on the MicroTESK framework being developed at ISP RAS. The tool consists of two parts: an architecture-independent test program generation core and VMSAv8-64 specifications. Such separation is not a new principle in the ...
Added: July 18, 2018
Kamkin A., Tatarnikov A., Проценко А. С. et al., , in: 2017 18th International Workshop on Microprocessor and SOC Test and Verification (MTV).: IEEE, 2017. P. 10–14.
The specification-based approach is widely used for test program generation for functional verification of microprocessors. The size of microprocessor specifications is measured in thousands lines of code. Consequently, their maintenance requires significant effort. Typical maintenance activities include regular updates, substitution of deprecated functionality, and support for new revisions and implementation-defined features. Our team is working ...
Added: July 18, 2018
Tatarnikov A., Kamkin A., Смолов С. А. et al., Программирование 2014 Т. 1 № 40 С. 3–14
Development of test programs and analysis of the results of their execution is the basic approach to verification of microprocessors at the system level. There is a variety of methods for the automation of test generation, starting with the generation of random code and ending with directed model-based test generation. However, there is no cure-all ...
Added: February 5, 2018