Mitja Kulczynski

Orcid: 0000-0003-4650-1110

According to our database1, Mitja Kulczynski authored at least 20 papers between 2019 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
ZaligVinder: A generic test framework for string solvers.
J. Softw. Evol. Process., April, 2023

Towards more efficient methods for solving regular-expression heavy string constraints.
Theor. Comput. Sci., 2023

Verified Verifying: SMT-LIB for Strings in Isabelle.
Proceedings of the Implementation and Application of Automata, 2023

2022
Light On String Solving: Approaches to Efficiently and Correctly Solving String Constraints.
PhD thesis, 2022

A Generic Information Extraction System for String Constraints.
CoRR, 2022

Solving String Theories Involving Regular Membership Predicates Using SAT.
Proceedings of the Model Checking Software - 28th International Symposium, 2022

2021
Analysis of Source Code Using UPPAAL.
Proceedings of the 6th Workshop on Formal Integrated Development Environment, 2021

The Show Must Go On - Examination During a Pandemic.
CoRR, 2021

Z3str4: A Multi-armed String Solver.
Proceedings of the Formal Methods - 24th International Symposium, 2021

Weighted Prefix Normal Words: Mind the Gap.
Proceedings of the Developments in Language Theory - 25th International Conference, 2021

String Theories Involving Regular Membership Predicates: From Practice to Theory and Back.
Proceedings of the Combinatorics on Words - 13th International Conference, 2021

An SMT Solver for Regular Expressions and Linear Arithmetic over String Length.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Experimental Investigation of Sufficient Criteria for Relations to Have Kernels.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2021

2020
A Length-aware Regular Expression SMT Solver.
CoRR, 2020

On Collapsing Prefix Normal Words.
Proceedings of the Language and Automata Theory and Applications, 2020

The Power of String Solving: Simplicity of Comparison.
Proceedings of the AST@ICSE 2020: IEEE/ACM 1st International Conference on Automation of Software Test, 2020

Rule-based Word Equation Solving.
Proceedings of the FormaliSE@ICSE 2020: 8th International Conference on Formal Methods in Software Engineering, 2020

2019
On Collapsing Prefix Normal Words.
CoRR, 2019

Managing Heterogeneity and Bridging the Gap in Teaching Formal Methods.
Proceedings of the Formal Methods Teaching - Third International Workshop and Tutorial, 2019

On Solving Word Equations Using SAT.
Proceedings of the Reachability Problems - 13th International Conference, 2019


  Loading...