Vladimir A. Zakharov

Available identifiers

zbMath Open zakharov.vladimir-anatolyevichMaRDI QIDQ1592931

List of research outcomes

Publication	Date of Publication	Type
On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic	2023-01-24	Paper
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines	2023-01-17	Paper
On the Modeling of Sequential Reactive Systems by Means of Real Time Automata	2023-01-17	Paper
On the Model Checking Problem for Some Extension of CTL*	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	2017-07-18	Paper
On the existence of provably secure cloud computing systems	2016-09-07	Paper
Equivalence Checking Problem for Finite State Transducers over Semigroups	2015-09-22	Paper
Program equivalence checking by two-tape automata	2014-06-05	Paper
Using algebraic models of programs for detecting metamorphic malwares	2011-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q3063994	2010-12-18	Paper
Encoding Mobile Ambients into the π-Calculus	2010-02-02	Paper
Anti-unification Algorithms and Their Applications in Program Analysis	2010-02-02	Paper
Perspectives of System Informatics	2010-01-05	Paper
On complexity of the anti-unification problem	2009-10-21	Paper
Efficient algorithms for checking the equivalence of programs in interrupt handling models	2008-10-21	Paper
On the Concept of Software Obfuscation in Computer Security	2008-06-24	Paper
https://portal.mardi4nfdi.de/entity/Q5445415	2008-03-05	Paper
https://portal.mardi4nfdi.de/entity/Q3421201	2007-02-12	Paper
Implementation and Application of Automata	2006-11-13	Paper
Implementation and Application of Automata	2005-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4448393	2004-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4529995	2002-05-07	Paper
Efficient model checking algorithms for computation tree logic and their application to the verification of parallel programs	2002-01-21	Paper
Fast algorithms for deciding the equivalence of propositional operator programs on ordered semigroup scales	2001-10-28	Paper
Approximation of abstract semantics by formal models of programs	2001-08-16	Paper
The relationship between two semantics of parallel computations	2001-04-26	Paper
Process net reconstruction from the sequence of Petri net transition triggerings	2001-04-02	Paper
A polynomial-time algorithm that recognizes the commutative equivalence of program schemata	2001-01-28	Paper
On the decidability of the equivalence problem for orthogonal sequential programs	2001-01-16	Paper
On the Decidability of the Equivalence Problem for Monadic Recursive Programs	2000-10-03	Paper
https://portal.mardi4nfdi.de/entity/Q4215606	1999-02-22	Paper
On transformation of sequential procedures into logic programs	1998-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4376081	1998-05-17	Paper
Formal models and free program schemata	1997-05-13	Paper
On the approximability relation for semantics of sequential programs	1996-12-11	Paper
https://portal.mardi4nfdi.de/entity/Q4866425	1996-09-15	Paper
On criterion for comparability of formal operator models of programs	1994-12-05	Paper
https://portal.mardi4nfdi.de/entity/Q3352505	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3785948	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3785947	1986-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Vladimir A. Zakharov