Searcharxiv⌕ Search

arXiv subjects

Mariya Bessonov

Publications and source records attributed to Mariya Bessonov.

8 recordsLinked to original sources
arXiv2026

Agentic Method for Deterministic Validation of Legacy Code Migration

Migration of legacy COBOL programs to Java requires extensive testing to ensure correct functionality. This effort is often complicated by the lack of test data and the difficulty of validating all corner cases. In this paper we propose a novel agentic test-synthesis method, the "Locksmith Loop," which is initiated by preparing two runtime environments: the COBOL source and the generated Java target are each instrumented with mocks and executed off-mainframe on commodity hardware, then an iterative agentic loop performs Witness Search over input mocks to penetrate program branches, followed by parity-preserving mutations. When routing boundaries are reached, an analyzer identifies a Locked Paragraph: a condition preventing deeper exploration. Across three COBOL-Java case studies, spanning two open-source programs and one internal production-like COBOL program and ranging from 430 to 4,114 source lines, Locksmith consistently improved coverage beyond input-search plateaus, reaching nearly complete coverage on the two open-source programs and 91.90% branch coverage on the internal production-like COBOL program. The generated Java matched the COBOL reference under deterministic parity checks in all accepted test cases. Through these findings we demonstrate, to the best of our knowledge, a novel approach for validating agentic coding output using a deterministic oracle.

cs.SE↗
arXiv2022

How do classroom-turnover times depend on lecture-hall size?

Academic spaces in colleges and universities span classrooms for 10 students to lecture halls that hold over 600 people. During the break between consecutive classes, students from the first class must leave and the new class must find their desks, regardless of whether the room holds 10 or 600 people. Here we address the question of how the size of large lecture halls affects classroom-turnover times, focusing on non-emergency settings. By adapting the established social-force model, we treat students as individuals who interact and move through classrooms to reach their destinations. We find that social interactions and the separation time between consecutive classes strongly influence how long it takes entering students to reach their desks, and that these effects are more pronounced in larger lecture halls. While the median time that individual students must travel increases with decreased separation time, we find that shorter separation times lead to shorter classroom-turnover times overall. This suggests that the effects of scheduling gaps and lecture-hall size on classroom dynamics depends on the perspective - individual student or whole class - that one chooses to take.

physics.soc-ph↗
arXiv2022

Faster Gr\"obner bases for Lie derivatives of ODE systems via monomial orderings

Symbolic computation for systems of differential equations is often computationally expensive. Many practical differential models have a form of polynomial or rational ODE system with specified outputs. A basic symbolic approach to analyze these models is to compute and then symbolically process the polynomial system obtained by sufficiently many Lie derivatives of the output functions with respect to the vector field given by the ODE system. In this paper, we present a method for speeding up Gr\"obner basis computation for such a class of polynomial systems by using specific monomial ordering, including weights for the variables, coming from the structure of the ODE model. We provide empirical results that show improvement across different symbolic computing frameworks and apply the method to speed up structural identifiability analysis of ODE models.

cs.SC↗
arXiv2016

A multi-class extension of the mean field Bolker-Pacala population model

We extend our earlier mean field approximation of the Bolker-Pacala model of population dynamics by dividing the population into N classes, using a mean field approximation for each class but also allowing migration between classes as well as possibly suppressive influence of the population of one class over another class. For N at least 2, we obtain one symmetric non-trivial equilibrium for the system and give global limit theorems. For N=2, we calculate all equilibrium solutions, which, under additional conditions, include multiple non-trivial equilibria. Lastly, we prove geometric ergodicity regardless of the number of classes when there is no population suppression across the classes.

math.PR↗
arXiv2013

A Mean Field Approximation of the Bolker-Pacala Population Model

We approximate the Bolker-Pacala model of population dynamics with the logistic Markov chain and analyze the latter. We find the asymptotics of the degenerated hypergeometric function and use these to prove a local CLT and large deviations result. We also state global limit theorems and obtain asymptotics for the first passage time to the boundary of a large interval.

math.PR↗
arXiv2013

Phase transitions for a planar quadratic contact process

We study a two dimensional version of Neuhauser's long range sexual reproduction model and prove results that give bounds on the critical values $\lambda_f$ for the process to survive from a finite set and $\lambda_e$ for the existence of a nontrivial stationary distribution. Our first result comes from a standard block construction, while the second involves a comparison with the "generic population model" of Bramson and Gray (1991). An interesting new feature of our work is the suggestion that, as in the one dimensional contact process, edge speeds characterize critical values. We are able to prove the following for our quadratic contact process when the range is large but suspect they are true for two dimensional finite range attractive particle systems that are symmetric with respect to reflection in each axis. There is a speed $c(\theta)$ for the expansion of the process in each direction. If $c(\theta) > 0$ in all directions, then $\lambda > \lambda_f$, while if at least one speed is positive, then $\lambda > \lambda_e$. It is a challenging open problem to show that if some speed is negative, then the system dies out from any finite set.

math.PR↗