Joel D. Day

Orcid: 0000-0002-3660-7766

According to our database1, Joel D. Day authored at least 31 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2023
On the Expressive Power of String Constraints.
Proc. ACM Program. Lang., January, 2023

Towards more efficient methods for solving regular-expression heavy string constraints.
Theor. Comput. Sci., 2023

Formal Languages via Theories over Strings: An Overview of Some Recent Results.
Bull. EATCS, 2023

2022
Unambiguous injective morphisms in free groups.
Inf. Comput., 2022

A Generic Information Extraction System for String Constraints.
CoRR, 2022

Formal Languages via Theories over Strings.
CoRR, 2022

Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Word Equations in the Context of String Solving.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021
The Edit Distance to k-Subsequence Universality.
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.
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

Rule-based Word Equation Solving.
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.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
k-Spectra of c-Balanced Words.
CoRR, 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

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

k-Spectra of Weakly-c-Balanced Words.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

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

The Satisfiability of Word Equations: Decidable and Undecidable Theories.
Proceedings of the Reachability Problems - 12th International Conference, 2018

On Matching Generalised Repetitive Patterns.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017
Closure properties of pattern languages.
J. Comput. Syst. Sci., 2017

The Hardness of Solving Simple Word Equations.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

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

2016
On restricting the ambiguity in morphic images of words.
PhD thesis, 2016

2015
Periodicity forcing words.
Theor. Comput. Sci., 2015

Ambiguity of Morphisms in a Free Group.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014
On the Dual Post Correspondence Problem.
Int. J. Found. Comput. Sci., 2014


  Loading...