A Uniform Framework for Handling Position Constraints in String Solving

Simple item page
dc.contributor.authorChen, Yu-Fangcs
dc.contributor.authorHavlena, Vojtěchcs
dc.contributor.authorHečko, Michalcs
dc.contributor.authorHolík, Lukášcs
dc.contributor.authorLengál, Ondřejcs
dc.coverage.issuePLDIcs
dc.coverage.volume9cs
dc.date.accessioned2025-07-17T06:56:53Z
dc.date.available2025-07-17T06:56:53Z
dc.date.issued2025-06-16cs
dc.description.abstractWe introduce a novel decision procedure for solving the class of position string constraints, which includes string disequalities, prefixof, suffixof, str.at, and str.at. These constraints are generated frequently in almost any application of string constraint solving. Our procedure avoids expensive encoding of the constraints to word equations and, instead, reduces the problem to checking conflicts on positions satisfying an integerconstraint obtained from the Parikh image of a polynomial-sized finite automaton with a special structure. By the reduction to counting, solving position constraints becomes NP-complete and for some cases even falls into PTime. This is much cheaper than the previously used techniques, which either used reductions generating word equations and length constraints (for which modern string solvers use exponential-space algorithms) or incomplete techniques. Our method is relevant especially for automata-based string solvers, which have recently achieved the best results in terms of practical efficiency, generality, and completeness guarantees. This work allows them to excel also on position constraints, which used to be their weakness. Besides the efficiency gains, we show that our framework may be extended to solve a large fragment of contains (in NExpTime), for which decidability has been long open, and gives a hope to solve the general problem. Our implementation of the technique within the Z3-Noodler solver significantly improves its performance on position constraints.en
dc.description.abstractTento článek zavádí uniformní rámec pro řešení fragmentu logiky nad řetězci s regulárními a pozičními omezeními.cs
dc.formattextcs
dc.format.extent550-575cs
dc.format.mimetypeapplication/pdfcs
dc.identifier.citationProceedings of the ACM on Programming Languages. 2025, vol. 9, issue PLDI, p. 550-575.en
dc.identifier.doi10.1145/3729273cs
dc.identifier.issn2475-1421cs
dc.identifier.orcid0000-0003-4375-7954cs
dc.identifier.orcid0000-0001-6957-1651cs
dc.identifier.orcid0000-0002-3038-5875cs
dc.identifier.other197690cs
dc.identifier.researcheridJCO-1846-2023cs
dc.identifier.scopus57189895456cs
dc.identifier.scopus24468124100cs
dc.identifier.scopus24822331700cs
dc.identifier.urihttps://hdl.handle.net/11012/255172
dc.language.isoencs
dc.publisherACMcs
dc.relation.ispartofProceedings of the ACM on Programming Languagescs
dc.relation.urihttps://dl.acm.org/doi/10.1145/3729273cs
dc.rightsCreative Commons Attribution 4.0 Internationalcs
dc.rights.accessopenAccesscs
dc.rights.sherpahttp://www.sherpa.ac.uk/romeo/issn/2475-1421/cs
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/cs
dc.subjectstring constraintsen
dc.subjectSMTen
dc.subjectautomataen
dc.subjectposition constraintsen
dc.subjectdisequalitiesen
dc.subjectnot containsen
dc.subjectregular languagesen
dc.titleA Uniform Framework for Handling Position Constraints in String Solvingen
dc.title.alternativeUniformní rámec pro řešení pozičních omezení nad řetězcics
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
sync.item.dbidVAV-197690en
sync.item.dbtypeVAVen
sync.item.insts2025.07.17 08:56:53en
sync.item.modts2025.07.17 08:33:51en
thesis.grantorVysoké učení technické v Brně. Fakulta informačních technologií. Ústav inteligentních systémůcs
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
3729273.pdf
Size:
2.32 MB
Format:
Adobe Portable Document Format
Description:
file 3729273.pdf
Download
Collections
Ústav inteligentních systémů