Igor Khmelnitsky

According to our database, Igor Khmelnitsky authored at least 11 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise.

Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy

Log. Methods Comput. Sci., 2024

2023

Analysis of recurrent neural networks via property-directed verification of surrogate models.

Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye

Int. J. Softw. Tools Technol. Transf., June, 2023

Analyzing Robustness of Angluin's L^* Algorithm in Presence of Noise.

Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy

CoRR, 2023

2021

Coverability, Termination, and Finiteness in Recursive Petri Nets.

Alain Finkel, Serge Haddad, Igor Khmelnitsky

Fundam. Informaticae, 2021

Commodification of accelerations for the Karp and Miller Construction.

Alain Finkel, Serge Haddad, Igor Khmelnitsky

Discret. Event Dyn. Syst., 2021

Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search.

Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Igor Khmelnitsky, Martin Leucker, Daniel Neider, Rajarshi Roy, Lina Ye

Proceedings of the 15th International Conference on Grammatical Inference, 2021

Property-Directed Verification and Robustness Certification of Recurrent Neural Networks.

Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye

Proceedings of the Automated Technology for Verification and Analysis, 2021

2020

Property-Directed Verification of Recurrent Neural Networks.

Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye

CoRR, 2020

Minimal Coverability Tree Construction Made Complete and Efficient.

Alain Finkel, Serge Haddad, Igor Khmelnitsky

Proceedings of the Foundations of Software Science and Computation Structures, 2020

Dynamic Recursive Petri Nets.

Serge Haddad, Igor Khmelnitsky

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2020

2019

Coverability and Termination in Recursive Petri Nets.

Alain Finkel, Serge Haddad, Igor Khmelnitsky

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019