Vladimir I. Ulyantsev

Orcid: 0000-0003-0802-830X

According to our database1, Vladimir I. Ulyantsev authored at least 36 papers between 2011 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
BeBoSy: Behavior Examples Meet Bounded Synthesis.
IEEE Access, 2021

Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2019
Function Block Finite-State Model Identification Using SAT and CSP Solvers.
IEEE Trans. Ind. Informatics, 2019

Smart Contract Design Meets State Machine Synthesis: Case Studies.
CoRR, 2019

Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis.
Proceedings of the 42nd International Convention on Information and Communication Technology, 2019

Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference.
Proceedings of the Language and Automata Theory and Applications, 2019

Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Evolutionary Computation Techniques for Constructing SAT-Based Attacks in Algebraic Cryptanalysis.
Proceedings of the Applications of Evolutionary Computation, 2019

2018
Exact finite-state machine identification from scenarios and temporal properties.
Int. J. Softw. Tools Technol. Transf., 2018

BFS Enumeration for Breaking Symmetries in Graphs.
CoRR, 2018

MetaCherchant: analyzing genomic context of antibiotic resistance genes in gut microbiota.
Bioinform., 2018

Active Learning of Formal Plant Models For Cyber-Physical Systems.
Proceedings of the 16th IEEE International Conference on Industrial Informatics, 2018

Counterexample-guided inference of controller logic from execution traces and temporal formulas.
Proceedings of the 23rd IEEE International Conference on Emerging Technologies and Factory Automation, 2018

2017
Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach.
Proceedings of the Software Engineering and Formal Methods, 2017

CSP-based inference of function block finite-state models from execution traces.
Proceedings of the 15th IEEE International Conference on Industrial Informatics, 2017

Plant trace generation for formal plant model inference: Methods and case study.
Proceedings of the 15th IEEE International Conference on Industrial Informatics, 2017

Applying Reinforcement Learning and Supervised Learning Techniques to Play Hearthstone.
Proceedings of the 16th IEEE International Conference on Machine Learning and Applications, 2017

Closed-loop verification of a compensating group drive model using synthesized formal plant model.
Proceedings of the 22nd IEEE International Conference on Emerging Technologies and Factory Automation, 2017

2016
Symmetry Breaking Predicates for SAT-based DFA Identification.
CoRR, 2016

Assessment of <i>k</i>-mer spectrum applicability for metagenomic dissimilarity analysis.
BMC Bioinform., 2016

MetaFast: fast reference-free graph-based comparison of shotgun metagenomic data.
Bioinform., 2016

Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas.
Autom. Remote. Control., 2016

2015
BFS-Based Symmetry Breaking Predicates for DFA Identification.
Proceedings of the Language and Automata Theory and Applications, 2015

Evolutionary approach to coverage testing of IEC 61499 function block applications.
Proceedings of the 13th IEEE International Conference on Industrial Informatics, 2015

Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver.
Proceedings of the Algorithms for Computational Biology, 2015

2014
Combining Exact and Metaheuristic Techniques for Learning Extended Finite-State Machines from Test Scenarios and Temporal Properties.
Proceedings of the 13th International Conference on Machine Learning and Applications, 2014

Inferring automata-based programs from specification with mutation-based ant colony optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Improving the quality of supervised finite-state machine construction using real-valued variables.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
Solving Five Instances of the Artificial Ant Problem with Ant Colony Optimization.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Test-Based Induction of Finite-State Machines with Continuous Output Actions.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Learning Finite-State Machines: Conserving Fitness Function Evaluations by Marking Used Transitions.
Proceedings of the 12th International Conference on Machine Learning and Applications, 2013

MuACOsm: a new mutation-based ant colony optimization algorithm for learning finite-state machines.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Search-based construction of finite-state machines with real-valued actions: new representation model.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

2012
Test-based extended finite-state machines induction with evolutionary algorithms and ant colony optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Learning Finite-State Machines with Ant Colony Optimization.
Proceedings of the Swarm Intelligence - 8th International Conference, 2012

2011
Extended Finite-State Machine Induction Using SAT-Solver.
Proceedings of the 10th International Conference on Machine Learning and Applications and Workshops, 2011


  Loading...