Topical Selection on Advances in String Constraints Solving
Acta Informatica
Call for Papers
https://link.springer.com/collections/jcchgfggih
---
* Important Dates *
Submission Deadline: 1st of April 2026
* Scope *
String is a basic data type in almost every programming language and has been widely used in many scenarios, especially web programming. String constraint solving is a classical topic in theoretical computer science. In the last decade, it has received a lot of attention as a result of the momentum from formal verification of string-manipulating programs. Various string constraint solvers have been developed and used within verification and testing tools. Nevertheless, the area still poses many open questions, ranging from the fundamental decidability and complexity questions to devising powerful heuristics that can quickly handle real-world string constraints, to the design of algorithms that efficiently reason about string-manipulating programs. The objective of this topical collection is to highlight recent advances in the area of string constraints, including, but not limited to, decidability and complexity results for fragments of string constraints, decision procedures, heuristics for solving, as well as tools and systems for analysing string-related properties in programs.
We welcome original research and extended versions of conferences submissions that are well-suited to the topic of the journal.
* Editors *
Joel Day, Loughborough University, United Kingdom <
J....@lboro.ac.uk>
Matthew Hague, Royal Holloway, University of London, United Kingdom <
matthe...@rhul.ac.uk>
Ondřej Lengál, Brno University of Technology, Czech Republic <
len...@fit.vutbr.cz>