| 2021 | CP | Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms. | Alexander A. Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya V. Otpuschennikov, Vladimir Ulyantsev, Alexey Ignatiev |
| 2019 | GECCO | Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks. | Artem Pavlenko, Maxim Buzdalov, Vladimir Ulyantsev |
| 2019 | LATA | Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference. | Ilya Zakirzyanov, Antnio Morgado, Alexey Ignatiev, Vladimir Ulyantsev, Joo Marques-Silva |
| 2018 | INDIN | Active Learning of Formal Plant Models For Cyber-Physical Systems. | Polina Ovsiannikova, Daniil Chivilikhin, Vladimir Ulyantsev, Andrey Stankevich, Ilya Zakirzyanov, Valeriy Vyatkin, Anatoly Shalyto |
| 2017 | ETFA | Closed-loop verification of a compensating group drive model using synthesized formal plant model. | Polina Ovsiannikova, Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto |
| 2017 | ICMLA | Applying Reinforcement Learning and Supervised Learning Techniques to Play Hearthstone. | Ilya Kachalsky, Ilya Zakirzyanov, Vladimir Ulyantsev |
| 2017 | INDIN | Plant trace generation for formal plant model inference: Methods and case study. | Dmitry Avdyukhin, Daniil Chivilikhin, Georgiy Korneev, Vladimir Ulyantsev, Anatoly Shalyto |
| 2017 | INDIN | CSP-based inference of function block finite-state models from execution traces. | Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto, Valeriy Vyatkin |
| 2017 | SEFM | Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach. | Ilya Zakirzyanov, Anatoly Shalyto, Vladimir Ulyantsev |
| 2015 | INDIN | Evolutionary approach to coverage testing of IEC 61499 function block applications. | Igor Buzhinsky, Vladimir Ulyantsev, Jari Veijalainen, Valeriy Vyatkin |
| 2015 | LATA | BFS-Based Symmetry Breaking Predicates for DFA Identification. | Vladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto |
| 2014 | GECCO | Improving the quality of supervised finite-state machine construction using real-valued variables. | Igor Buzhinsky, Daniil Chivilikhin, Vladimir Ulyantsev, Fedor Tsarev |
| 2014 | GECCO | Inferring automata-based programs from specification with mutation-based ant colony optimization. | Daniil Chivilikhin, Vladimir Ulyantsev |
| 2014 | ICMLA | Combining Exact and Metaheuristic Techniques for Learning Extended Finite-State Machines from Test Scenarios and Temporal Properties. | Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto |
| 2013 | GECCO | Search-based construction of finite-state machines with real-valued actions: new representation model. | Igor Buzhinsky, Vladimir Ulyantsev, Fedor Tsarev, Anatoly Shalyto |
| 2013 | GECCO | MuACOsm: a new mutation-based ant colony optimization algorithm for learning finite-state machines. | Daniil Chivilikhin, Vladimir Ulyantsev |
| 2013 | ICMLA | Learning Finite-State Machines: Conserving Fitness Function Evaluations by Marking Used Transitions. | Daniil Chivilikhin, Vladimir Ulyantsev |
| 2012 | GECCO | Test-based extended finite-state machines induction with evolutionary algorithms and ant colony optimization. | Daniil Chivilikhin, Vladimir Ulyantsev, Fedor Tsarev |
| 2011 | ICMLA | Extended Finite-State Machine Induction Using SAT-Solver. | Vladimir Ulyantsev, Fedor Tsarev |