Negated String Containment is Decidable
| dc.contributor.author | Havlena, Vojtěch | cs |
| dc.contributor.author | Hečko, Michal | cs |
| dc.contributor.author | Holík, Lukáš | cs |
| dc.contributor.author | Lengál, Ondřej | cs |
| dc.date.issued | 2025-08-20 | cs |
| dc.description.abstract | We provide a positive answer to a long-standing open question of the decidability of the not-contains string predicate. Not-contains is practically relevant, for instance in symbolic execution of string manipulating programs. Particularly, we show that the predicate ¬Contains(x … x_n, y … y_m), where x … x_n and y … y_m are sequences of string variables constrained by regular languages, is decidable. Decidability of a not-contains predicate combined with chain-free word equations and regular membership constraints follows. | en |
| dc.description.abstract | We provide a positive answer to a long-standing open question of the decidability of the not-contains string predicate. Not-contains is practically relevant, for instance in symbolic execution of string manipulating programs. Particularly, we show that the predicate ¬Contains(x … x_n, y … y_m), where x … x_n and y … y_m are sequences of string variables constrained by regular languages, is decidable. Decidability of a not-contains predicate combined with chain-free word equations and regular membership constraints follows. | en |
| dc.format | text | cs |
| dc.format.extent | 1-20 | cs |
| dc.format.mimetype | application/pdf | cs |
| dc.identifier.citation | Leibniz International Proceedings in Informatics. 2025, p. 1-20. | en |
| dc.identifier.doi | 10.4230/LIPIcs.MFCS.2025.56 | cs |
| dc.identifier.issn | 1868-8969 | cs |
| dc.identifier.orcid | 0000-0003-4375-7954 | cs |
| dc.identifier.orcid | 0009-0003-2428-8547 | cs |
| dc.identifier.orcid | 0000-0001-6957-1651 | cs |
| dc.identifier.orcid | 0000-0002-3038-5875 | cs |
| dc.identifier.other | 198408 | cs |
| dc.identifier.researcherid | JCO-1846-2023 | cs |
| dc.identifier.scopus | 57189895456 | cs |
| dc.identifier.scopus | 24468124100 | cs |
| dc.identifier.scopus | 24822331700 | cs |
| dc.identifier.uri | http://hdl.handle.net/11012/255730 | |
| dc.language.iso | en | cs |
| dc.publisher | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik | cs |
| dc.relation.ispartof | Leibniz International Proceedings in Informatics | cs |
| dc.relation.uri | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.56 | cs |
| dc.rights | Creative Commons Attribution 4.0 International | cs |
| dc.rights.access | openAccess | cs |
| dc.rights.sherpa | http://www.sherpa.ac.uk/romeo/issn/1868-8969/ | cs |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | cs |
| dc.subject | not contains | en |
| dc.subject | regular languages | en |
| dc.subject | string constraints | en |
| dc.subject | combinatorics on words | en |
| dc.subject | not contains | |
| dc.subject | regular languages | |
| dc.subject | string constraints | |
| dc.subject | combinatorics on words | |
| dc.title | Negated String Containment is Decidable | en |
| dc.title.alternative | Negated String Containment is Decidable | en |
| dc.type.driver | conferenceObject | en |
| dc.type.status | Peer-reviewed | en |
| dc.type.version | publishedVersion | en |
| sync.item.dbid | VAV-198408 | en |
| sync.item.dbtype | VAV | en |
| sync.item.insts | 2026.02.06 08:53:59 | en |
| sync.item.modts | 2026.02.06 08:32:07 | en |
| thesis.grantor | Vysoké učení technické v Brně. Fakulta informačních technologií. Ústav inteligentních systémů | cs |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- LIPIcs.MFCS.2025.56.pdf
- Size:
- 1.11 MB
- Format:
- Adobe Portable Document Format
- Description:
- file LIPIcs.MFCS.2025.56.pdf