default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor Khmelnitsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j4]Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy:
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise. Log. Methods Comput. Sci. 20(1) (2024)- 2023
- [j3]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie
, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye:
Analysis of recurrent neural networks via property-directed verification of surrogate models. Int. J. Softw. Tools Technol. Transf. 25(3): 341-354 (2023) - 2021
- [j2]Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Commodification of accelerations for the Karp and Miller Construction. Discret. Event Dyn. Syst. 31(2): 251-270 (2021) - [j1]Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Coverability, Termination, and Finiteness in Recursive Petri Nets. Fundam. Informaticae 183(1-2): 33-66 (2021)
Conference and Workshop Papers
- 2022
- [c6]Igor Khmelnitsky, Serge Haddad, Lina Ye, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy:
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. GandALF 2022: 81-96 - 2021
- [c5]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye:
Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. ATVA 2021: 364-380 - [c4]Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Igor Khmelnitsky, Martin Leucker, Daniel Neider, Rajarshi Roy, Lina Ye:
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. ICGI 2021: 113-129 - 2020
- [c3]Serge Haddad, Igor Khmelnitsky:
Dynamic Recursive Petri Nets. Petri Nets 2020: 345-366 - [c2]Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Minimal Coverability Tree Construction Made Complete and Efficient. FoSSaCS 2020: 237-256 - 2019
- [c1]Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Coverability and Termination in Recursive Petri Nets. Petri Nets 2019: 429-448
Informal and Other Publications
- 2023
- [i3]Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy:
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. CoRR abs/2306.08266 (2023) - 2021
- [i2]Alain Finkel, Serge Haddad, Igor Khmelnitsky:
Coverability, Termination, and Finiteness in Recursive Petri Nets. CoRR abs/2109.06804 (2021) - 2020
- [i1]Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye:
Property-Directed Verification of Recurrent Neural Networks. CoRR abs/2009.10610 (2020)
Coauthor Index
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-05-08 21:46 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:
