Vladimir A. Zakharov

According to our database, Vladimir A. Zakharov authored at least 35 papers between 1987 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Satisfiability and Model Checking for One Parameterized Extension of Linear Temporal Logic.

Anton R. Gnatenko, Vladimir A. Zakharov

Autom. Control. Comput. Sci., December, 2022

2021

Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines.

Vladimir A. Zakharov

Autom. Control. Comput. Sci., 2021

On the Modeling of Sequential Reactive Systems by Means of Real Time Automata.

Evgenii M. Vinarskii, Vladimir A. Zakharov

Autom. Control. Comput. Sci., 2021

On the Model Checking Problem for Some Extension of CTL.

Anton R. Gnatenko, Vladimir A. Zakharov

Autom. Control. Comput. Sci., 2021

2020

On the Possibility of Secure Program Obfuscation in Some Model of Cloud Computing.

Alexander V. Shokurov, I. V. Abramova, Nikolay P. Varnovsky, Vladimir A. Zakharov

Program. Comput. Softw., 2020

2019

On the Expressive Power of Some Extensions of Linear Temporal Logic.

Anton R. Gnatenko, Vladimir A. Zakharov

Autom. Control. Comput. Sci., 2019

Even Simple π-Calculus Processes Are Difficult to Analyze.

M. M. Abbas, Vladimir A. Zakharov

Autom. Control. Comput. Sci., 2019

Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automata.

Vladimir A. Zakharov

Proceedings of the Language and Automata Theory and Applications, 2019

2017

On the Minimization of Finite State Transducers over Semigroups.

Vladimir A. Zakharov, G. G. Temerbekova

Autom. Control. Comput. Sci., 2017

On the Minimization Problem for Sequential Programs.

Vladimir A. Zakharov, S. R. Jaylauova

Autom. Control. Comput. Sci., 2017

2015

A combined toolset for the verification of real-time distributed systems.

Dmitry Yu. Volkanov, Vladimir A. Zakharov, Daniil A. Zorin, Vladislav V. Podymov, Igor V. Konnov

Program. Comput. Softw., 2015

The current state of art in program obfuscations: definitions of obfuscation security.

N. P. Varnovskiy, Vladimir A. Zakharov, Nikolay N. Kuzyurin, Alexander V. Shokurov

Program. Comput. Softw., 2015

On network update problems for software defined networks.

Evgeny V. Chemeritskiy, Vladimir A. Zakharov

Autom. Control. Comput. Sci., 2015

Equivalence Checking Problem for Finite State Transducers over Semigroups.

Vladimir A. Zakharov

Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014

A formal model and verification problems for software defined networks.

Vladimir A. Zakharov, R. L. Smelyansky, Eugene V. Chemeritsky

Autom. Control. Comput. Sci., 2014

How to make a simple tool for verification of real-time systems.

Igor V. Konnov, Vladislav V. Podymov, Dmitry Yu. Volkanov, Vladimir A. Zakharov, Daniil A. Zorin

Autom. Control. Comput. Sci., 2014

Two-sided unification is NP-complete.

Tatyana A. Novikova, Vladimir A. Zakharov

Proceedings of the 28th International Workshop on Unification, 2014

2013

Is it possible to unify sequential programs?

Tatyana A. Novikova, Vladimir A. Zakharov

Proceedings of the 27th International Workshop on Unification, 2013

2010

An invariant-based approach to the verification of asynchronous parameterized networks.

Igor V. Konnov, Vladimir A. Zakharov

J. Symb. Comput., 2010

2009

Anti-unification Algorithms and Their Applications in Program Analysis.

Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Zakharov

Proceedings of the Perspectives of Systems Informatics, 2009

2007

On the Concept of Software Obfuscation in Computer Security.

Nikolay Kuzurin, Alexander V. Shokurov, Nikolay P. Varnovsky, Vladimir A. Zakharov

Proceedings of the Information Security, 10th International Conference, 2007

2006

Encoding Mobile Ambients into the <i>pi</i> -Calculus.

Gabriel Ciobanu, Vladimir A. Zakharov

Proceedings of the Perspectives of Systems Informatics, 2006

2005

An Approach to the Verification of Symmetric Parameterized Distributed Systems.

Igor V. Konnov, Vladimir A. Zakharov

Program. Comput. Softw., 2005

On the Equivalence Problem for Programs with Mode Switching.

Rimma I. Podlovchenko, Dmitry M. Rusakov, Vladimir A. Zakharov

Proceedings of the Implementation and Application of Automata, 2005

2004

On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata.

Vladimir A. Zakharov, Ivan Zakharyaschev

Proceedings of the Implementation and Application of Automata, 2004

2003

On the Possibility of Provably Secure Obfuscating Programs.

Nikolay P. Varnovsky, Vladimir A. Zakharov

Proceedings of the Perspectives of Systems Informatics, 2003

2001

Book Review: "Model Checking" by E. Clarke, O. Grumberg and D. A. Peled.

Vladimir A. Zakharov

J. Log. Comput., 2001

The Equivalence Problem for Computational Models: Decidable and Undecidable Cases.

Vladimir A. Zakharov

Proceedings of the Machines, 2001

An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs.

Stanley Chow, Yuan Xiang Gu, Harold Johnson, Vladimir A. Zakharov

Proceedings of the Information Security, 4th International Conference, 2001

2000

On the Decidability of the Equivalence Problem for Monadic Recursive Programs.

Vladimir A. Zakharov

RAIRO Theor. Informatics Appl., 2000

1999

On the Decidability of the Equivalence Problem for Orthogonal Sequential Programs.

Vladimir A. Zakharov

Grammars, 1999

1998

An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs.

Vladimir A. Zakharov

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Verification of PLTL Formulae by Means of Monotone Disjunctive Normal Forms.

Vladimir A. Zakharov

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996

On the Relationship between Models of Parallel Computations.

Vladimir V. Spanopulo, Vladimir A. Zakharov

Proceedings of the Advances in Modal Logic 1, 1996

1987

To the Functional Equivalence of Turing Machines.

Vladimir A. Zakharov

Proceedings of the Fundamentals of Computation Theory, 1987