2024
Word-representable graphs from a word's perspective.
Acta Informatica, December, 2024
Decision Problems on Copying and Shuffling.
Fundam. Informaticae, 2024
The Equivalence Problem of E-Pattern Languages with Length Constraints is Undecidable.
CoRR, 2024
The Equivalence Problem of E-Pattern Languages with Regular Constraints Is Undecidable.
Proceedings of the Implementation and Application of Automata, 2024
Aufbau einer überregionalen Data-Science-Community.
Proceedings of the 54. Jahrestagung der Gesellschaft für Informatik, 2024
Enhancing Maritime Behaviour Analysis Through Novel Feature Engineering and Digital Shadow Modelling: A Case Study in the Kiel Fjord.
Proceedings of the Architecture of Computing Systems - 37th International Conference, 2024
2023
Nearly <i>k</i>-universal words - Investigating a part of Simon's congruence.
Theor. Comput. Sci., September, 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
CRISP-PCCP - A Development Methodology Supporting FDA Approval for Machine Learning Enabled Medical Devices.
Proceedings of the Bridging the Gap Between AI and Reality, 2023
Reducing Overall Path Latency in Automotive Logical Execution Time Scheduling via Reinforcement Learning.
Proceedings of the 31st International Conference on Real-Time Networks and Systems, 2023
Matching Patterns with Variables Under Simon's Congruence.
Proceedings of the Reachability Problems - 17th International Conference, 2023
k-Universality of Regular Languages.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
Workshop: "Aktuelle Entwicklungen und Perspektiven (an Hochschulen) im Bereich Data Science".
Proceedings of the 53. Jahrestagung der Gesellschaft für Informatik, INFORMATIK 2023, Designing Future, 2023
α-β-Factorization and the Binary Case of Simon's Congruence.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023
Solving String Constraints Using SAT.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023
Self-Explanation as a Basis for Self-Integration - The Autonomous Passenger Ferry Scenario.
Proceedings of the IEEE International Conference on Autonomic Computing and Self-Organizing Systems, 2023
2022
An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences.
SIAM J. Comput., 2022
A Generic Information Extraction System for String Constraints.
CoRR, 2022
m-Nearly k-Universal Words - Investigating Simon Congruence.
CoRR, 2022
Responsible and Regulatory Conform Machine Learning for Medicine: A Survey of Challenges and Solutions.
,
,
,
,
,
,
,
,
,
,
IEEE Access, 2022
Solving String Theories Involving Regular Membership Predicates Using SAT.
Proceedings of the Model Checking Software - 28th International Symposium, 2022
Nearly k-Universal Words - Investigating a Part of Simon's Congruence.
Proceedings of the Descriptional Complexity of Formal Systems, 2022
2021
Reconstructing Words from Right-Bounded-Block Words.
Int. J. Found. Comput. Sci., 2021
Analysis of Source Code Using UPPAAL.
Proceedings of the 6th Workshop on Formal Integrated Development Environment, 2021
Responsible and Regulatory Conform Machine Learning for Medicine: A Survey of Technical Challenges and Solutions.
,
,
,
,
,
,
,
,
,
,
CoRR, 2021
The Show Must Go On - Examination During a Pandemic.
CoRR, 2021
Scattered Factor Universality - The Power of the Remainder.
CoRR, 2021
Blocksequences of k-local Words.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 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
2020
Equations enforcing repetitions under permutations.
Discret. Appl. Math., 2020
A Length-aware Regular Expression SMT Solver.
CoRR, 2020
Automatic Verification of LLVM Code.
CoRR, 2020
On Weighted Prefix Normal Words.
CoRR, 2020
Estimating End-to-End Latencies in Automotive Cyber-physical Systems.
Proceedings of the 4th Workshop on Models for Formal Analysis of Real Systems, 2020
On Collapsing Prefix Normal Words.
Proceedings of the Language and Automata Theory and Applications, 2020
EC.LANG - A Language for Specifying Response Time Analyses of Event Chains.
Proceedings of the 13th IEEE International Conference on Software Testing, 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
Scattered Factor-Universality of Words.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020
2019
Rollercoasters: Long Sequences without Short Runs.
SIAM J. Discret. Math., 2019
Hide and seek with repetitions.
J. Comput. Syst. Sci., 2019
An Empirical Investigation of Randomized Defenses against Adversarial Attacks.
CoRR, 2019
On Modelling the Avoidability of Patterns as CSP.
CoRR, 2019
On Collapsing Prefix Normal Words.
CoRR, 2019
k-Spectra of c-Balanced 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
Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019
Improving Estimations for Latencies of Cause-Effect Chains.
Proceedings of the Analysis, Estimations, and Applications of Embedded Systems, 2019
k-Spectra of Weakly-c-Balanced Words.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019
2018
Unary patterns under permutations.
Theor. Comput. Sci., 2018
Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 (2017) 75-77].
Inf. Process. Lett., 2018
One-Variable Word Equations and Three-Variable Constant-Free Word Equations.
Int. J. Found. Comput. Sci., 2018
On the Complexity of Solving Restricted Word Equations.
Int. J. Found. Comput. Sci., 2018
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability.
CoRR, 2018
Estimating Latencies of Task Sequences in Multi-Core Automotive ECUs.
Proceedings of the 13th IEEE International Symposium on Industrial Embedded Systems, 2018
Tuning Parallel SAT Solvers.
Proceedings of Pragmatics of SAT 2015, 2018
The Satisfiability of Word Equations: Decidable and Undecidable Theories.
Proceedings of the Reachability Problems - 12th International Conference, 2018
Lagrange's Theorem for Binary Squares.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
Rollercoasters and Caterpillars.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Statistical Model Checking of LLVM Code.
Proceedings of the Formal Methods - 22nd International Symposium, 2018
On Matching Generalised Repetitive Patterns.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018
2017
TCS Special Issue: Combinatorics on Words - WORDS 2015.
Theor. Comput. Sci., 2017
The extended equation of Lyndon and Schützenberger.
J. Comput. Syst. Sci., 2017
Inf. Process. Lett., 2017
Detecting One-Variable Patterns.
Proceedings of the String Processing and Information Retrieval, 2017
The Hardness of Solving Simple Word Equations.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017
2016
Detecting Unary Patterns.
CoRR, 2016
One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016
On the Solvability Problem for Restricted Classes of Word Equations.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016
2015
k-Abelian pattern matching.
J. Discrete Algorithms, 2015
Cubic patterns with permutations.
J. Comput. Syst. Sci., 2015
On Prefix/Suffix-Square Free Words.
Proceedings of the String Processing and Information Retrieval, 2015
Unary Patterns with Permutations.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015
2014
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111).
Dagstuhl Reports, 2014
Testing Generalised Freeness of Words.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
Formal software verification for the migration of embedded code from single- to multicore systems.
Proceedings of the Software Engineering 2014, Fachtagung des GI-Fachbereichs Softwaretechnik, 25. Februar, 2014
Generalised Lyndon-Schützenberger Equations.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
Communication in Massively-Parallel SAT Solving.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014
2013
Finding Pseudo-repetitions.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Defining Requirements on Domain-Specific Languages in Model-Driven Software Engineering of Safety-Critical Systems.
Proceedings of the Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium), Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar, 2013
Formal Verification of Concurrent Embedded Software.
Proceedings of the Embedded Systems: Design, Analysis and Verification, 2013
On the Pseudoperiodic Extension of u^l = v^m w^n.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013
Discovering Hidden Repetitions in Words.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013
2012
The Ehrenfeucht-Silberger problem.
J. Comb. Theory A, 2012
Unary Patterns with involution.
Int. J. Found. Comput. Sci., 2012
Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju.
Fundam. Informaticae, 2012
String Matching with Involutions.
Proceedings of the Unconventional Computation and Natural Computation, 2012
Fine and Wilf's Theorem and Pseudo-repetitions.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
The Avoidability of Cubes under Permutations.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012
MEMICS - Memory Interval Constraint Solving of (concurrent) Machine Code.
Proceedings of the Automotive, 2012
2011
Int. J. Found. Comput. Sci., 2011
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081).
Dagstuhl Reports, 2011
Pattern Avoidability with Involution
Proceedings of the Proceedings 8th International Conference Words 2011, 2011
The Number of Positions Starting a Square in Binary Words.
Electron. J. Comb., 2011
2010
Maximal Intersection Queries in Randomized Input Models.
Theory Comput. Syst., 2010
Cyclically repetition-free words on small alphabets.
Inf. Process. Lett., 2010
On the Relation between Periodicity and Unbordered Factors of Finite Words.
Int. J. Found. Comput. Sci., 2010
2009
Klassifikationsbäume in Echtzeit.
Softwaretechnik-Trends, 2009
Äquivalenzklassen mit Zeit und Zuständen.
Proceedings of the Informatiktage 2009, 2009
2008
A note on an extension of PDL.
J. Appl. Log., 2008
Unbordered factors and Lyndon words.
Discret. Math., 2008
Bordered Conjugates of Words over Large Alphabets.
Electron. J. Comb., 2008
2007
Periodicity and unbordered words: A proof of the extended duval conjecture.
J. ACM, 2007
On a Non-Context-Free Extension of PDL
CoRR, 2007
Height-Deterministic Pushdown Automata.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007
Estimation of the Click Volume by Large Scale Regression Analysis.
Proceedings of the Computer Science, 2007
Maximal Intersection Queries in Randomized Graph Models.
Proceedings of the Computer Science, 2007
2006
On unique factorizations of primitive words.
Theor. Comput. Sci., 2006
Binary Words with Few Squares.
Bull. EATCS, 2006
Periods in Extensions of Words.
Acta Informatica, 2006
2005
Counting bordered and primitive words with a fixed weight.
Theor. Comput. Sci., 2005
On the equation in a free semigroup.
Theor. Comput. Sci., 2005
A characterization of periodicity of bi-infinite words.
Theor. Comput. Sci., 2005
2004
Border correlation of binary words.
J. Comb. Theory A, 2004
Minimal Duval Extensions.
Int. J. Found. Comput. Sci., 2004
Periodicity and Unbordered Words: A Proof of Duval?s Conjecture.
Proceedings of the STACS 2004, 2004
2003
On the independence of equations in three variables.
Theor. Comput. Sci., 2003
Periodicity and Unbordered Segments of Words.
Bull. EATCS, 2003
About Duval's Conjecture.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003
2002
Density of Critical Factorizations.
RAIRO Theor. Informatics Appl., 2002
1998
Program Abstraction in a Higher-Order Logic Framework.
Proceedings of the Theorem Proving in Higher Order Logics, 11th International Conference, 1998
Computer Arithmetic: Logic, Calculus and Rewriting.
Proceedings of the Frontiers of Combining Systems, Second International Workshop, 1998