default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIevgen Ivanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c23]Ievgen Ivanov:
Generalized Newman's Lemma for Discrete and Continuous Systems. FSCD 2023: 9:1-9:17- [c22]Ievgen Ivanov:
On Newman's Lemma and Non-termination. IT&I 2023: 14-24 - 2022
- [j12]Ievgen Ivanov:
On Induction Principles for Partial Orders. Logica Universalis 16(1-2): 105-147 (2022) - 2020
- [c21]Ievgen Ivanov:
On Induction for Diamond-Free Directed Complete Partial Orders. ICTERI Workshops 2020: 70-73 - [c20]Ievgen Ivanov:
On Induction Principles for Diamond-Free Partial Orders. ICTERI (Revised Selected Papers) 2020: 166-190
2010 – 2019
- 2019
- [c19]Ievgen Ivanov, Mykola S. Nikitchenko
:
Expressibility in the Kleene Algebra of Partial Predicates with the Complement Composition. ICTERI (Revised Selected Papers) 2019: 50-67 - [c18]Ievgen Ivanov, Mykola S. Nikitchenko:
On the Kleene Algebra of Partial Predicates with Predicate Complement. ICTERI Workshops 2019: 542-551 - 2018
- [j11]Ievgen Ivanov, Artur Kornilowicz, Mykola S. Nikitchenko:
Implementation of the Composition-nominative Approach to Program Formalization in Mizar. Comput. Sci. J. Moldova 26(1): 59-76 (2018) - [j10]Artur Kornilowicz, Ievgen Ivanov, Mykola S. Nikitchenko:
Kleene Algebra of Partial Predicates. Formaliz. Math. 26(1): 11-20 (2018) - [j9]Ievgen Ivanov, Artur Kornilowicz, Mykola S. Nikitchenko:
On Algebras of Algorithms and Specifications over Uninterpreted Data. Formaliz. Math. 26(2): 141-147 (2018) - [j8]Ievgen Ivanov, Artur Kornilowicz, Mykola S. Nikitchenko:
On an Algorithmic Algebra over Simple-Named Complex-Valued Nominative Data. Formaliz. Math. 26(2): 149-158 (2018) - [j7]Ievgen Ivanov, Artur Kornilowicz, Mykola S. Nikitchenko:
An Inference System of an Extension of Floyd-Hoare Logic for Partial Predicates. Formaliz. Math. 26(2): 159-164 (2018) - [j6]Ievgen Ivanov, Artur Kornilowicz, Mykola S. Nikitchenko:
Partial Correctness of GCD Algorithm. Formaliz. Math. 26(2): 165-173 (2018) - [c17]Ievgen Ivanov, Mykola S. Nikitchenko:
Inference Rules for the Partial Floyd-Hoare Logic Based on Composition of Predicate Complement. ICTERI (Revised Selected Papers) 2018: 71-88 - [c16]Ievgen Ivanov, Mykola S. Nikitchenko:
On the Sequence Rule for the Floyd-Hoare Logic with Partial Pre- and Post-Conditions. ICTERI Workshops 2018: 716-724 - 2017
- [j5]Volodymyr G. Skobelev, Ievgen Ivanov, Mykola S. Nikitchenko:
Nominative data with ordered set of names. Comput. Sci. J. Moldova 25(2): 195-216 (2017) - [j4]Ievgen Ivanov, Mykola S. Nikitchenko, Andrii Kryvolap, Artur Kornilowicz:
Simple-Named Complex-Valued Nominative Data - Definition and Basic Operations. Formaliz. Math. 25(3): 205-216 (2017) - [c15]Artur Kornilowicz, Andrii Kryvolap, Mykola S. Nikitchenko, Ievgen Ivanov:
Formalization of the Algebra of Nominative Data in Mizar. FedCSIS 2017: 237-244 - [c14]Mykola Nikitchenko, Ievgen Ivanov, Artur Kornilowicz, Andrii Kryvolap:
Extended Floyd-Hoare Logic over Relational Nominative Data. ICTERI (Revised Selected Papers) 2017: 41-64 - [c13]Ievgen Ivanov, Taras Panchenko:
A Formal Proof of Correctness of a Distributed Presentation Software System. ICTERI 2017: 467-487 - [c12]Artur Kornilowicz, Andrii Kryvolap, Mykola S. Nikitchenko, Ievgen Ivanov:
An Approach To Formalization of an Extension of Floyd-Hoare Logic. ICTERI 2017: 504-523 - [c11]Artur Kornilowicz, Andrii Kryvolap, Mykola S. Nikitchenko, Ievgen Ivanov:
Formalization of the Nominative Algorithmic Algebra in Mizar. ISAT (2) 2017: 176-186 - [c10]Ievgen Ivanov:
On the Underapproximation of Reach Sets of Abstract Continuous-Time Systems. SNR@ETAPS 2017: 46-51 - 2016
- [j3]Ievgen Ivanov, Mykola S. Nikitchenko, Volodymyr G. Skobelev:
Proving Properties of Programs on Hierarchical Nominative Data. Comput. Sci. J. Moldova 24(3): 371-398 (2016) - [c9]Ievgen Ivanov:
On Local Characterization of Global Timed Bisimulation for Abstract Continuous-Time Systems. CMCS 2016: 216-234 - 2015
- [j2]Volodymyr G. Skobelev, Ievgen Ivanov, Mykola S. Nikitchenko:
Set-theoretic Analysis of Nominative Data. Comput. Sci. J. Moldova 23(3): 270-288 (2015) - [j1]Ievgen Ivanov, Mykola S. Nikitchenko, Uri Abraham:
Event-Based Proof of the Mutual Exclusion Property of Peterson's Algorithm. Formaliz. Math. 23(4): 325-331 (2015) - [c8]Ievgen Ivanov:
On a Strong Notion of Viability for Switched Systems. ICTERI 2015: 396-407 - 2014
- [c7]Ievgen Ivanov, Mykola S. Nikitchenko, Uri Abraham:
On a Decidable Formal Theory for Abstract Continuous-Time Dynamical Systems. ICTERI 2014: 78-99 - [c6]Volodymyr G. Skobelev, Mykola S. Nikitchenko, Ievgen Ivanov:
On Algebraic Properties of Nominative Data and Functions. ICTERI 2014: 117-138 - [c5]Ievgen Ivanov:
On Representations of Abstract Systems with Partial Inputs and Outputs. TAMC 2014: 104-123 - 2013
- [c4]Ievgen Ivanov:
On Existence of Total Input-Output Pairs of Abstract Time Systems. ICTERI (Revised Selected Papers) 2013: 308-331 - [c3]Ievgen Ivanov:
An Abstract Block Formalism for Engineering Systems. ICTERI 2013: 448-463 - 2012
- [c2]Ievgen Ivanov:
A Criterion for Existence of Global-in-Time Trajectories of Non-deterministic Markovian Systems. ICTERI (Revised Selected Papers) 2012: 111-130 - [c1]Ievgen Ivanov:
On Existence of Global-in-Time Trajectories of Non-deterministic Markovian Systems. ICTERI 2012: 312-320
Coauthor Index
aka: Mykola Nikitchenko
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
