|
|
Publications in Math-Net.Ru
-
Comparison of object-oriented and procedural-parametric polymorphism
Proceedings of ISP RAS, 37:6(1) (2025), 43–58
-
C language extension to support procedural-parametric polymorphism
Model. Anal. Inform. Sist., 30:1 (2023), 40–62
-
Transformation of C programming language memory model into object-oriented representation of EO language
Model. Anal. Inform. Sist., 29:3 (2022), 246–264
-
Methods for change parallelism in process of high-level VLSI synthesis
Model. Anal. Inform. Sist., 29:1 (2022), 60–72
-
Parallelism reduction method in the high-level vlsi synthesis implementation
Proceedings of ISP RAS, 34:1 (2022), 69–72
-
The system for transforming the code of dataflow programs into imperative
Model. Anal. Inform. Sist., 28:2 (2021), 198–214
-
Dynamically changing parallelism with the asynchronous sequential data flows
Model. Anal. Inform. Sist., 27:2 (2020), 164–179
-
Verification of programs with mutual recursion in the Pifagor language
Model. Anal. Inform. Sist., 25:4 (2018), 358–381
-
Loop-invariant optimization in the Pifagor language
Model. Anal. Inform. Sist., 25:4 (2018), 347–357
-
Support tools for creation and transformation of functional-dataflow parallel programs
Proceedings of ISP RAS, 29:5 (2017), 165–184
-
Automation of formal verification of programs in the Pifagor language
Model. Anal. Inform. Sist., 22:4 (2015), 578–589
-
A toolkit for supporting formal verification of programs in the functional data-flow parallel programming language
Vestn. YuUrGU. Ser. Vych. Matem. Inform., 4:2 (2015), 58–70
-
Application of numerical optimization methods to perform molecular docking on graphics processing units
Model. Anal. Inform. Sist., 21:5 (2014), 93–101
-
Mutation test metodology for onboard spacecrafts radioelectronic equipment ground test
Sistemy i Sredstva Inform., 24:1 (2014), 73–79
-
Formal Verification of Programs in Functional Dataflow Parallel Language
Model. Anal. Inform. Sist., 19:5 (2012), 81–99
-
Tail Recursion Transformation in Functional Dataflow Parallel Programs
Model. Anal. Inform. Sist., 19:4 (2012), 48–58
© , 2026