kulczyn.ski

Publications

Title	Publication
Certainty in Formalising SMT-LIB for Strings in Isabelle	IJFCS '25: International Journal of Foundations of Computer Science 1-25.
SMT-Query: Analysing SMT-LIB string benchmarks	SBMF '24: 27th Symposium on Formal Methods: Foundations and Applications, December 4–6, 2024, Vitória, Brazil.
Verified Verifying: SMT-LIB for Strings in Isabelle	CIAA '23: 27th International Conference on Implementation and Application of Automata, September 19-22, 2023, Famagusta.
Towards more Efficient Methods for Solving Regular-Expression Heavy String Constraints	TCS '23: Theoretical Computer Science Volume 943, January 17, 2023.
Solving String Theories involving Regular Membership Predicates Using SAT	SPIN '22: 28th International Symposium on Model Checking of Software, May 21-22, 2022, Chicago, Illinois, USA.
Light On String Solving	CAU '22: Kiel Computer Science Series, Volume 2022/1. Doctoral dissertation
ZaligVinder: A Generic Test Framework for String Solvers	JSEP '21: Journal of Software: Evolution and Process
Z3str4: A Multi-armed String Solver	FM '21: 24th International Symposium on Formal Methods, November 20-26, 2021, Beijing, China.
Experimental Investigation of Sufficient Criteria for Relations to Have Kernels	RAMiCS '21: 19th International Conference on Relational and Algebraic Methods in Computer Science, November 2-5, 2021 in Marseille, France.
String Theories involving Regular Membership Predicates: From Practice to Theory and Back	WORDS '21: 13th International Conference on WORDS, September 13-17, 2021 in Rouen, France.
Weighted Prefix Normal Words: Mind the Gap	DLT '21: 25th International Conference on Developments in Language Theory, August 16-20, 2021 in Porto, Portugal.
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length	CAV '21: 33rd International Conference on Computer-Aided Verification, July 18-23, 2021 in Los Angeles, California, USA.
Analysis of Source Code Using UPPAAL	F-IDE '21: 6th Workshop on Formal Integrated Development Environment, Affiliated to NASA Formal Methods 2021, May 24-25, 2021,Virtual event.
TopoSAT2	SAT-COMP ’20: Affiliated with the 23rd International Conference on Theory and Applications of Satisfiability Testing, July 5th - 9th, 2020, Alghero, Italy. Placed 2nd in AWS Cloud Track with TopoSAT2
Z3str4: A Two-Armed String Solver	SMT-COMP '20: 15th International Satisfiability Modulo Theories Competition, July 5 - 6, 2020, Virtual Meeting.
The Power of String Solving: Simplicity of Comparison	AST ’20: International Conference on Automation of Software Test, October 7–8, 2020, Seoul, Republic of Korea.Best Short Paper Award
Rule-based Word Equation Solving	FormaliSE ’20: 8th International Conference on Formal Methods in Software Engineering, October 7–8, 2020, Seoul, Republic of Korea.Best Video Presentation Award
On Collapsing Prefix Normal Words	LATA ’20: 14th International Conference on Language and Automata Theory and Applications, March 4-6, 2020, Milan, Italy.
Managing Heterogeneity and Bridging the Gap in Teaching Formal Methods	FMTea '19: 3rd International Workshop and Tutorial on Formal Methods Teaching, October 7, 2019, Porto, Portugal.
On Solving Word Equations Using SAT	RP '19: 13th International Conference on Reachability Problems, September 11-13, 2019, Brussels, Belgium.

Publications

Under Construction!