Ievgen Ivanov

Proceedings of the Selected Papers of the X International Scientific Conference "Information Technology and Implementation" (IT&I-2023). Conference Proceedings, Kyiv, Ukraine, November 20, 2023

Generalized Newman's Lemma for Discrete and Continuous Systems.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022

On Induction Principles for Partial Orders.

[BibT_eX]

[DOI]

Logica Universalis, 2022

2020

On Induction Principles for Diamond-Free Partial Orders.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2020

On Induction for Diamond-Free Directed Complete Partial Orders.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on ICT in Education, 2020

2019

Expressibility in the Kleene Algebra of Partial Predicates with the Complement Composition.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2019

On the Kleene Algebra of Partial Predicates with Predicate Complement.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on ICT in Education, 2019

2018

Kleene Algebra of Partial Predicates.

[BibT_eX]

[DOI]

Formaliz. Math., 2018

Partial Correctness of GCD Algorithm.

[BibT_eX]

[DOI]

Formaliz. Math., 2018

An Inference System of an Extension of Floyd-Hoare Logic for Partial Predicates.

[BibT_eX]

[DOI]

Formaliz. Math., 2018

On an Algorithmic Algebra over Simple-Named Complex-Valued Nominative Data.

[BibT_eX]

[DOI]

Formaliz. Math., 2018

On Algebras of Algorithms and Specifications over Uninterpreted Data.

[BibT_eX]

[DOI]

Formaliz. Math., 2018

Implementation of the Composition-nominative Approach to Program Formalization in Mizar.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2018

Inference Rules for the Partial Floyd-Hoare Logic Based on Composition of Predicate Complement.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2018

On the Sequence Rule for the Floyd-Hoare Logic with Partial Pre- and Post-Conditions.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on ICT in Education, 2018

2017

Simple-Named Complex-Valued Nominative Data - Definition and Basic Operations.

[BibT_eX]

[DOI]

Formaliz. Math., 2017

Nominative data with ordered set of names.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2017

On the Underapproximation of Reach Sets of Abstract Continuous-Time Systems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis, 2017

Formalization of the Nominative Algorithmic Algebra in Mizar.

[BibT_eX]

[DOI]

Proceedings of the Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology - ISAT 2017, 2017

Extended Floyd-Hoare Logic over Relational Nominative Data.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2017

An Approach To Formalization of an Extension of Floyd-Hoare Logic.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on ICT in Education, 2017

A Formal Proof of Correctness of a Distributed Presentation Software System.

[BibT_eX]

[DOI]

Taras Panchenko

Proceedings of the 13th International Conference on ICT in Education, 2017

Formalization of the Algebra of Nominative Data in Mizar.

[BibT_eX]

[DOI]

Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017

2016

Proving Properties of Programs on Hierarchical Nominative Data.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2016

On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2016

2015

Event-Based Proof of the Mutual Exclusion Property of Peterson's Algorithm.

[BibT_eX]

[DOI]

Uri Abraham

Formaliz. Math., 2015

Set-theoretic Analysis of Nominative Data.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2015

On a Strong Notion of Viability for Switched Systems.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on ICT in Education, 2015

2014

On Representations of Abstract Systems with Partial Inputs and Outputs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

On Algebraic Properties of Nominative Data and Functions.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2014

On a Decidable Formal Theory for Abstract Continuous-Time Dynamical Systems.

[BibT_eX]

[DOI]

Uri Abraham

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2014

2013

On Existence of Total Input-Output Pairs of Abstract Time Systems.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2013

An Abstract Block Formalism for Engineering Systems.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on ICT in Education, 2013

2012

A Criterion for Existence of Global-in-Time Trajectories of Non-deterministic Markovian Systems.

[BibT_eX]

[DOI]

Proceedings of the ICT in Education, Research, and Industrial Applications, 2012

On Existence of Global-in-Time Trajectories of Non-deterministic Markovian Systems.

[BibT_eX]

[DOI]