Joel D. Day

According to our database, Joel D. Day authored at least 35 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Novel tree-search method for synthesizing SMT strategies.

Zhengyang John Lu, Joel D. Day, Piyush Jha, Paul Sarnighausen-Cahn, Stefan Siemer, Florin Manea, Vijay Ganesh

Acta Informatica, September, 2025

Word Equations with Length Constraints via Weak Arithmetics and Matrix Reachability Problems.

Joel D. Day, Matthew Konefal

Proceedings of the Reachability Problems - 19th International Conference, 2025

FC-Datalog as a Framework for Efficient String Querying.

Owen M. Bell, Joel D. Day, Dominik D. Freydenberger

Proceedings of the 28th International Conference on Database Theory, 2025

2024

A Closer Look at the Expressive Power of Logics Based on Word Equations.

Joel D. Day, Vijay Ganesh, Nathan Grewal, Matthew Konefal, Florin Manea

Theory Comput. Syst., June, 2024

Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis.

Zhengyang Lu, Stefan Siemer, Piyush Jha, Joel D. Day, Florin Manea, Vijay Ganesh

Proceedings of the 22nd International Workshop on Satisfiability Modulo Theories co-located with the 36th International Conference on Computer Aided Verification (CAV 2024), 2024

2023

On the Expressive Power of String Constraints.

Joel D. Day, Vijay Ganesh, Nathan Grewal, Florin Manea

Proc. ACM Program. Lang., January, 2023

Towards more efficient methods for solving regular-expression heavy string constraints.

Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka

Theor. Comput. Sci., 2023

Formal Languages via Theories over Strings: An Overview of Some Recent Results.

Joel D. Day, Vijay Ganesh, Florin Manea

Bull. EATCS, 2023

2022

Unambiguous injective morphisms in free groups.

Joel D. Day, Daniel Reidenbach

Inf. Comput., 2022

A Generic Information Extraction System for String Constraints.

Joel D. Day, Adrian Kröger, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen

CoRR, 2022

Formal Languages via Theories over Strings.

Joel D. Day, Vijay Ganesh, Nathan Grewal, Florin Manea

CoRR, 2022

Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems.

Joel D. Day, Maria Kosche, Florin Manea, Markus L. Schmid

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Word Equations in the Context of String Solving.

Joel D. Day

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

The Edit Distance to k-Subsequence Universality.

Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

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

Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

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

Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel D. Day, Dirk Nowotka, Vijay Ganesh

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020

A Length-aware Regular Expression SMT Solver.

Murphy Berzish, Mitja Kulczynski, Federico Mora, Florin Manea, Joel D. Day, Dirk Nowotka, Vijay Ganesh

CoRR, 2020

Rule-based Word Equation Solving.

Joel D. Day, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen

Proceedings of the FormaliSE@ICSE 2020: 8th International Conference on Formal Methods in Software Engineering, 2020

On the Structure of Solution Sets to Regular Word Equations.

Joel D. Day, Florin Manea

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

k-Spectra of c-Balanced Words.

Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka

CoRR, 2019

On Solving Word Equations Using SAT.

Joel D. Day, Thorsten Ehlers, Mitja Kulczynski, Florin Manea, Dirk Nowotka, Danny Bøgsted Poulsen

Proceedings of the Reachability Problems - 13th International Conference, 2019

Upper Bounds on the Length of Minimal Solutions to Certain Quadratic Word Equations.

Joel D. Day, Florin Manea, Dirk Nowotka

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number.

Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

k-Spectra of Weakly-c-Balanced Words.

Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018

The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability.

Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka

CoRR, 2018

The Satisfiability of Word Equations: Decidable and Undecidable Theories.

Joel D. Day, Vijay Ganesh, Paul He, Florin Manea, Dirk Nowotka

Proceedings of the Reachability Problems - 12th International Conference, 2018

On Matching Generalised Repetitive Patterns.

Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

The Hardness of Solving Simple Word Equations.

Joel D. Day, Florin Manea, Dirk Nowotka

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Local Patterns.

Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Equations Enforcing Repetitions Under Permutations.

Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

On restricting the ambiguity in morphic images of words.

Joel D. Day

PhD thesis, 2016

2015

Ambiguity of Morphisms in a Free Group.

Joel D. Day, Daniel Reidenbach

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014

Closure Properties of Pattern Languages.

Joel D. Day, Daniel Reidenbach, Markus L. Schmid

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

On the Dual Post Correspondence Problem.

Joel D. Day, Daniel Reidenbach, Johannes C. Schneider

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Periodicity Forcing Words.

Joel D. Day, Daniel Reidenbach, Johannes C. Schneider

Proceedings of the Combinatorics on Words - 9th International Conference, 2013