Vladimir A. Zakharov

Orcid: 0000-0002-3794-9565

According to our database1, Vladimir A. Zakharov authored at least 36 papers between 1987 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers.
Proceedings of the Implementation and Application of Automata, 2024

2022
Satisfiability and Model Checking for One Parameterized Extension of Linear Temporal Logic.
Autom. Control. Comput. Sci., December, 2022

2021
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines.
Autom. Control. Comput. Sci., 2021

On the Modeling of Sequential Reactive Systems by Means of Real Time Automata.
Autom. Control. Comput. Sci., 2021

On the Model Checking Problem for Some Extension of CTL.
Autom. Control. Comput. Sci., 2021

2020
On the Possibility of Secure Program Obfuscation in Some Model of Cloud Computing.
Program. Comput. Softw., 2020

2019
On the Expressive Power of Some Extensions of Linear Temporal Logic.
Autom. Control. Comput. Sci., 2019

Even Simple π-Calculus Processes Are Difficult to Analyze.
Autom. Control. Comput. Sci., 2019

Equivalence Checking of Prefix-Free Transducers and Deterministic Two-Tape Automata.
Proceedings of the Language and Automata Theory and Applications, 2019

2017
On the Minimization of Finite State Transducers over Semigroups.
Autom. Control. Comput. Sci., 2017

On the Minimization Problem for Sequential Programs.
Autom. Control. Comput. Sci., 2017

2015
A combined toolset for the verification of real-time distributed systems.
Program. Comput. Softw., 2015

The current state of art in program obfuscations: definitions of obfuscation security.
Program. Comput. Softw., 2015

On network update problems for software defined networks.
Autom. Control. Comput. Sci., 2015

Equivalence Checking Problem for Finite State Transducers over Semigroups.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014
A formal model and verification problems for software defined networks.
Autom. Control. Comput. Sci., 2014

How to make a simple tool for verification of real-time systems.
Autom. Control. Comput. Sci., 2014

Two-sided unification is NP-complete.
Proceedings of the 28th International Workshop on Unification, 2014

2013
Is it possible to unify sequential programs?
Proceedings of the 27th International Workshop on Unification, 2013

2010
An invariant-based approach to the verification of asynchronous parameterized networks.
J. Symb. Comput., 2010

2009
Anti-unification Algorithms and Their Applications in Program Analysis.
Proceedings of the Perspectives of Systems Informatics, 2009

2007
On the Concept of Software Obfuscation in Computer Security.
Proceedings of the Information Security, 10th International Conference, 2007

2006
Encoding Mobile Ambients into the <i>pi</i> -Calculus.
Proceedings of the Perspectives of Systems Informatics, 2006

2005
An Approach to the Verification of Symmetric Parameterized Distributed Systems.
Program. Comput. Softw., 2005

On the Equivalence Problem for Programs with Mode Switching.
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.
Proceedings of the Implementation and Application of Automata, 2004

2003
On the Possibility of Provably Secure Obfuscating Programs.
Proceedings of the Perspectives of Systems Informatics, 2003

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

The Equivalence Problem for Computational Models: Decidable and Undecidable Cases.
Proceedings of the Machines, 2001

An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs.
Proceedings of the Information Security, 4th International Conference, 2001

2000
On the Decidability of the Equivalence Problem for Monadic Recursive Programs.
RAIRO Theor. Informatics Appl., 2000

1999
On the Decidability of the Equivalence Problem for Orthogonal Sequential Programs.
Grammars, 1999

1998
An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Verification of PLTL Formulae by Means of Monotone Disjunctive Normal Forms.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996
On the Relationship between Models of Parallel Computations.
Proceedings of the Advances in Modal Logic 1, 1996

1987
To the Functional Equivalence of Turing Machines.
Proceedings of the Fundamentals of Computation Theory, 1987


  Loading...