| Publication | Date of Publication | Type |
|---|
| An algebraic approach to the equivalence checking of deterministic top-down tree transducers | 2026-02-10 | Paper |
| On the complexity of decision problems for parameterized finite state synchronous transducers | 2025-01-20 | Paper |
On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic
Modeling and Analysis of Information Systems | 2023-01-24 | Paper |
On the Model Checking Problem for Some Extension of CTL*
Modeling and Analysis of Information Systems | 2023-01-17 | Paper |
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
Modeling and Analysis of Information Systems | 2023-01-17 | Paper |
On the Modeling of Sequential Reactive Systems by Means of Real Time Automata
Modeling and Analysis of Information Systems | 2023-01-17 | Paper |
| Equivalence checking of prefix-free transducers and deterministic two-tape automata | 2019-12-04 | Paper |
On the deductive security of queries to confidential databases in cloud computing systems
Moscow University Computational Mathematics and Cybernetics | 2017-07-18 | Paper |
On the existence of provably secure cloud computing systems
Moscow University Computational Mathematics and Cybernetics | 2016-09-07 | Paper |
Equivalence checking problem for finite state transducers over semigroups
Algebraic Informatics | 2015-09-22 | Paper |
Program equivalence checking by two-tape automata
Cybernetics and Systems Analysis | 2014-06-05 | Paper |
Using algebraic models of programs for detecting metamorphic malwares
Journal of Mathematical Sciences (New York) | 2011-07-18 | Paper |
| Fast algorithms for deciding the equivalence of operator programs on balanced scales. | 2010-12-18 | Paper |
Anti-unification algorithms and their applications in program analysis
Perspectives of Systems Informatics | 2010-02-02 | Paper |
Encoding mobile ambients into the \(\pi \)-calculus
Perspectives of Systems Informatics | 2010-02-02 | Paper |
On the possibility of provably secure obfuscating programs
Lecture Notes in Computer Science | 2010-01-05 | Paper |
On complexity of the anti-unification problem
Discrete Mathematics and Applications | 2009-10-21 | Paper |
Efficient algorithms for checking the equivalence of programs in interrupt handling models
Moscow University Computational Mathematics and Cybernetics | 2008-10-21 | Paper |
On the Concept of Software Obfuscation in Computer Security
Lecture Notes in Computer Science | 2008-06-24 | Paper |
| On the effective solvability of the problem of the equivalence of linear unary recursive programs. | 2008-03-05 | Paper |
| On a generalization of substitutions in application to the problem of static analysis of programs | 2007-02-12 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 2044529 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1738658 (Why is no real title available?) | 2002-05-07 | Paper |
Efficient model checking algorithms for computation tree logic and their application to the verification of parallel programs
Programming and Computer Software | 2002-01-21 | Paper |
Fast algorithms for deciding the equivalence of propositional operator programs on ordered semigroup scales
Moscow University Computational Mathematics and Cybernetics | 2001-10-28 | Paper |
Approximation of abstract semantics by formal models of programs
Discrete Mathematics and Applications | 2001-08-16 | Paper |
The relationship between two semantics of parallel computations
Programming and Computer Software | 2001-04-26 | Paper |
Process net reconstruction from the sequence of Petri net transition triggerings
Moscow University Computational Mathematics and Cybernetics | 2001-04-02 | Paper |
A polynomial-time algorithm that recognizes the commutative equivalence of program schemata
Doklady Mathematics | 2001-01-28 | Paper |
On the decidability of the equivalence problem for orthogonal sequential programs
Grammars | 2001-01-16 | Paper |
On the Decidability of the Equivalence Problem for Monadic Recursive Programs
RAIRO - Theoretical Informatics and Applications | 2000-10-03 | Paper |
On the Decidability of the Equivalence Problem for Monadic Recursive Programs
RAIRO - Theoretical Informatics and Applications | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1215473 (Why is no real title available?) | 1999-02-22 | Paper |
On transformation of sequential procedures into logic programs
Programming and Computer Software | 1998-11-23 | Paper |
| scientific article; zbMATH DE number 1114359 (Why is no real title available?) | 1998-05-17 | Paper |
Formal models and free program schemata
Programming and Computer Software | 1997-05-13 | Paper |
On the approximability relation for semantics of sequential programs
Moscow University Computational Mathematics and Cybernetics | 1996-12-11 | Paper |
| scientific article; zbMATH DE number 850400 (Why is no real title available?) | 1996-09-15 | Paper |
On criterion for comparability of formal operator models of programs
Programming and Computer Software | 1994-12-05 | Paper |
| scientific article; zbMATH DE number 4203724 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4049056 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4049055 (Why is no real title available?) | 1986-01-01 | Paper |
