Geodesic

Sommaire du Fascicule no. 1

Backtracking algorithms for constructing the Hamiltonian decomposition of a $4$-regular multigraph
p. 6-21
NP-completeness of the minimum spanning tree problem of a multiple graph of multiplicity $k \geqslant 3$
p. 22-37
On characteristics of symbolic execution in the problem of assessing the quality of obfuscating transformations
p. 38-51
Online testing of dynamic reconfigurations w.r.t. adaptation policies
p. 52-73
An algorithm for correcting levels of useful signals on interpretation of eddy-current defectograms
p. 74-88
Automated teaching system “Sets” (research for organizing the 1st part of the project)
p. 90-103
LTL-specification of counter machines
p. 104-119

Sommaire du Fascicule no. 2

Identification conditions for the solvability of NP-complete problems for the class of pre-fractal graphs
p. 126-135
Computational analysis of quantitative characteristics of some residual properties of solvable Baumslag–Solitar groups
p. 136-145
Object-centric replay-based conformance checking: unveiling desire lines and local deviations
p. 146-168
Severity estimation of defects on interpretation of eddy-current defectograms
p. 170-185
On properties of a regular simplex inscribed into a ball
p. 186-197
The system for transforming the code of dataflow programs into imperative
p. 198-214

Sommaire du Fascicule no. 3

Algorithm for finding feedback in a problem with constraints for one class of nonlinear control systems
p. 220-233
A simple algorithm for finding a non-negative basic solution of a system of linear algebraic equations
p. 234-237
The investigation of nonlinear polynomial control systems
p. 238-249
Comparison of style features for the authorship verification of literary texts
p. 250-259
Analysis of the impact of the stylometric characteristics of different levels for the verification of authors of the prose
p. 260-279
Text classification by genre based on rhythm features
p. 280-291
Word-embedding based text vectorization using clustering
p. 292-311
Corrigendum to: V. V. Vasilchikov, “Parallel algorithm for solving the graph isomorphism problem”, Modeling and analysis of information systems, vol. 27, no. 1, pp. 86-94, 2020. doi: https://doi.org/10.18255/1818-1015-2020-1-86-94
p. 312-313
Corrigendum to: Y. V. Kosolapov, “On the detection of exploitation of vulnerabilities leading to the execution of a malicious code”, Modeling and analysis of information systems, vol. 27, no. 2, pp. 138-151, 2020. doi: https://doi.org/10.18255/1818-1015-2020-2-138-151
p. 314-316

Sommaire du Fascicule no. 4

From the editors of the issue
p. 322-324
Notes on recent achievements in proving stability using KeYmaeraX
p. 326-336
Autotuning parallel programs by model checking
p. 338-355
On the satisfiability and model checking for one parameterized extension of linear-time temporal logic
p. 356-371
Towards automatic deductive verification of C programs with sisal loops using the C-lightVer system
p. 372-393
A mathematical model of parallel programs and an approach based on it to verification of MPI programs
p. 394-412
A recursive inclusion checker for recursively defined subtypes
p. 414-433
Solving linear programming problems by reducing to the form with an obvious answer
p. 434-451
An algorithm for estimating the signal frequency at the output of a channel with a controlled information flow under phase noise conditions
p. 452-461