default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniil S. Chivilikhin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c25]Alexander A. Semenov, Daniil Chivilikhin, Stepan Kochemazov, Ibragim Dzhiblavi:
Probabilistic Generalization of Backdoor Trees with Application to SAT. AAAI 2023: 4095-4103- [i3]Daniil Chivilikhin, Artem Pavlenko
, Alexander A. Semenov:
Decomposing Hard SAT Instances with Metaheuristic Optimization. CoRR abs/2312.10436 (2023) - 2022
- [j7]Konstantin Chukharev, Daniil Chivilikhin:
fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver. IEEE Access 10: 131592-131610 (2022) - [c24]Alexander A. Semenov, Artem Pavlenko, Daniil Chivilikhin, Stepan Kochemazov:
On Probabilistic Generalization of Backdoors in Boolean Satisfiability. AAAI 2022: 10353-10361 - [c23]Artem Pavlenko, Daniil Chivilikhin, Alexander A. Semenov:
Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability. CEC 2022: 1-8 - [i2]Alexander A. Semenov, Konstantin Chukharev, Egor Tarasov, Daniil Chivilikhin, Viktor Kondratiev:
Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits. CoRR abs/2210.01484 (2022) - 2021
- [j6]Daniil Chivilikhin, Ilya Zakirzyanov, Vladimir Ulyantsev:
BeBoSy: Behavior Examples Meet Bounded Synthesis. IEEE Access 9: 27540-27551 (2021) - [c22]Daniil Chivilikhin:
Temporal Specification Mining for IEC 61499 Function Blocks Using Evolutionary Algorithms and Model Checking. CEC 2021: 2419-2426 - [c21]Alexander A. Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya V. Otpuschennikov, Vladimir Ulyantsev, Alexey Ignatiev:
Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms. CP 2021: 47:1-47:18 - 2020
- [j5]Konstantin Chukharev, Dmitrii Suvorov, Daniil Chivilikhin, Valeriy Vyatkin:
SAT-Based Counterexample-Guided Inductive Synthesis of Distributed Controllers. IEEE Access 8: 207485-207498 (2020) - [j4]Daniil Chivilikhin, Sandeep Patil, Konstantin Chukharev, Anthony Cordonnier, Valeriy Vyatkin:
Automatic State Machine Reconstruction From Legacy Programmable Logic Controller Using Data Collection and SAT Solver. IEEE Trans. Ind. Informatics 16(12): 7821-7831 (2020)
2010 – 2019
- 2019
- [j3]Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto, Valeriy Vyatkin:
Function Block Finite-State Model Identification Using SAT and CSP Solvers. IEEE Trans. Ind. Informatics 15(8): 4558-4568 (2019) - [c20]Daniil Chivilikhin, Sandeep Patil, Anthony Cordonnier, Valeriy Vyatkin:
Towards automatic state machine reconstruction from legacy PLC using data collection. INDIN 2019: 147-151 - [i1]Konstantin Chukharev, Daniil Chivilikhin:
fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks. CoRR abs/1907.03285 (2019) - 2018
- [c19]Daniil Chivilikhin, Igor Buzhinsky, Vladimir I. Ulyantsev, Andrey Stankevich, Anatoly Shalyto, Valeriy Vyatkin:
Counterexample-guided inference of controller logic from execution traces and temporal formulas. ETFA 2018: 91-98 - [c18]Polina Ovsiannikova, Daniil Chivilikhin, Vladimir Ulyantsev, Andrey Stankevich, Ilya Zakirzyanov, Valeriy Vyatkin, Anatoly Shalyto:
Active Learning of Formal Plant Models For Cyber-Physical Systems. INDIN 2018: 719-724 - 2017
- [j2]Daniil Chivilikhin, Anatoly Shalyto, Sandeep Patil, Valeriy Vyatkin:
Reconstruction of Function Block Logic Using Metaheuristic Algorithm. IEEE Trans. Ind. Informatics 13(4): 1763-1771 (2017) - [c17]Polina Ovsiannikova, Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto:
Closed-loop verification of a compensating group drive model using synthesized formal plant model. ETFA 2017: 1-4 - [c16]Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto, Valeriy Vyatkin:
CSP-based inference of function block finite-state models from execution traces. INDIN 2017: 714-719 - [c15]Dmitry Avdyukhin, Daniil Chivilikhin, Georgiy Korneev, Vladimir Ulyantsev, Anatoly Shalyto:
Plant trace generation for formal plant model inference: Methods and case study. INDIN 2017: 746-752 - 2016
- [j1]Daniil S. Chivilikhin, Vladimir I. Ulyantsev, Anatoly A. Shalyto:
Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas. Autom. Remote. Control. 77(3): 473-484 (2016) - [c14]Daniil Chivilikhin:
Experimental Study of Automated Parameter Tuning on the Example of irace and the Traveling Salesman Problem. GECCO (Companion) 2016: 45-46 - [c13]Viacheslav Shalamov, Andrey Filchenkov, Daniil Chivilikhin:
Small-Moves Based Mutation For Pick-Up And Delivery Problem. GECCO (Companion) 2016: 1027-1030 - [c12]Daniil Chivilikhin, Ilya Ivanov, Anatoly Shalyto, Valeriy Vyatkin:
Reconstruction of function block controllers based on test scenarios and verification. INDIN 2016: 646-651 - 2015
- [c11]Daniil Chivilikhin, Ilya Ivanov, Anatoly Shalyto:
Inferring Temporal Properties of Finite-State Machine Models with Genetic Programming. GECCO (Companion) 2015: 1185-1188 - [c10]Daniil Chivilikhin, Anatoly Shalyto, Sandeep Patil, Valeriy Vyatkin:
Reconstruction of function block logic using metaheuristic algorithm: Initial explorations. INDIN 2015: 1239-1242 - [c9]Daniil Chivilikhin, Anatoly Shalyto, Valeriy Vyatkin:
Inferring Automata Logic from Manual Control Scenarios: Implementation in Function Blocks. TrustCom/BigDataSE/ISPA (3) 2015: 307-312 - 2014
- [c8]Daniil Chivilikhin, Vladimir Ulyantsev:
Inferring automata-based programs from specification with mutation-based ant colony optimization. GECCO (Companion) 2014: 67-68 - [c7]Igor Buzhinsky, Daniil Chivilikhin, Vladimir Ulyantsev, Fedor Tsarev:
Improving the quality of supervised finite-state machine construction using real-valued variables. GECCO (Companion) 2014: 1037-1040 - [c6]Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto:
Combining Exact and Metaheuristic Techniques for Learning Extended Finite-State Machines from Test Scenarios and Temporal Properties. ICMLA 2014: 350-355 - 2013
- [c5]Daniil Chivilikhin, Vladimir Ulyantsev:
MuACOsm: a new mutation-based ant colony optimization algorithm for learning finite-state machines. GECCO 2013: 511-518 - [c4]Daniil Chivilikhin, Vladimir Ulyantsev:
Learning Finite-State Machines: Conserving Fitness Function Evaluations by Marking Used Transitions. ICMLA (2) 2013: 90-95 - [c3]Daniil Chivilikhin, Vladimir Ulyantsev, Anatoly Shalyto:
Solving Five Instances of the Artificial Ant Problem with Ant Colony Optimization. MIM 2013: 1043-1048 - 2012
- [c2]Daniil Chivilikhin, Vladimir Ulyantsev:
Learning Finite-State Machines with Ant Colony Optimization. ANTS 2012: 268-275 - [c1]Daniil Chivilikhin, Vladimir Ulyantsev, Fedor Tsarev:
Test-based extended finite-state machines induction with evolutionary algorithms and ant colony optimization. GECCO (Companion) 2012: 603-606
Coauthor Index
aka: Anatoly A. Shalyto
aka: Vladimir Ulyantsev
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 2025-01-09 12:49 CET 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:
