Experimental Investigation of Sufficient Criteria for Relations to Have Kernels

von Berghammer, Rudolf
Veröffentlicht in RAMiCS (19. : 2021 : Marseille) Relational and algebraic methods in computer science (2021)

Weighted Prefix Normal Words: Mind the Gap

von Eikmeier, Yannik
Veröffentlicht in DLT (25. : 2021 : Porto, Portugal) Developments in Language Theory (2021)

Solving String Theories Involving Regular Membership Predicates Using SAT

von Kulczynski, Mitja
Veröffentlicht in SPIN (28. : 2022 : Online) Model checking software (2022)

Light on string solving : approaches to efficiently and correctly solving string constraints

von Kulczynski, Mitja
Veröffentlicht 2022

On Collapsing Prefix Normal Words

von Fleischmann, Pamela
Veröffentlicht in International Conference on Language and Automata Theory and Applications (14. : 2021 : Mailand) Language and automata theory and applications (2020)

Z3str4: A Multi-armed String Solver

von Mora, Federico
Veröffentlicht in FM (24. : 2021 : Online) Formal Methods (2021)

String Theories Involving Regular Membership Predicates: From Practice to Theory and Back

von Berzish, Murphy
Veröffentlicht in International Conference on Words (13. : 2021 : Online) Combinatorics on Words (2021)

An SMT Solver for Regular Expressions and Linear Arithmetic over String Length

von Berzish, Murphy
Veröffentlicht in CAV (33. : 2021 : Online) Computer aided verification ; Part 2 (2021)