4 citations · 6 across the 5 of their papers we have counts for
7 papers
A Generic Information Extraction System for String Constraints
Joel D. Day, Adrian Kröger, Mitja Kulczynski +3
String constraint solving, and the underlying theory of word equations, are highly interesting research topics both for practitioners and theoreticians working in the wide area of…
Analysis of Source Code Using UPPAAL
Mitja Kulczynski, Axel Legay, Dirk Nowotka +1
In recent years there has been a considerable effort in optimising formal methods for application to code. This has been driven by tools such as CPAChecker, DIVINE, and CBMC. At th…
The Show Must Go On -- Examination During a Pandemic
Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka
When unexpected incidents occur, new innovative and flexible solutions are required. If this event is something such radical and dramatic like the COVID-19 pandemic, these solution…
String Theories involving Regular Membership Predicates: From Practice to Theory and Back
Murphy Berzish, Joel D. Day, Vijay Ganesh +4
Widespread use of string solvers in formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this con…
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length
Murphy Berzish, Mitja Kulczynski, Federico Mora +4
We present a novel length-aware solving algorithm for the quantifier-free first-order theory over regex membership predicate and linear arithmetic over string length. We implement…
On Solving Word Equations Using SAT
Joel D. Day, Thorsten Ehlers, Mitja Kulczynski +3
We present Woorpje, a string solver for bounded word equations (i.e., equations where the length of each variable is upper bounded by a given integer). Our algorithm works by refor…