Solving Not-Substring Constraint withFlat Abstraction

DOI10.1007/978-3-030-89051-3_17MaRDI QIDQ6488164zbMATH OpenFDO

Authors Parosh A. Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukáš Holik, Wei-Lun Tsai, Di-De Yen

Publication date 29 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-89051-3_17

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Constraint reasoning over strings
• An efficient SMT solver for string constraints
• Subsequence versus substring constraints in sequence pattern languages
• Constraint solving in non-permutative nominal abstract syntax
• scientific article; zbMATH DE number 1953284
• Parameterized intractability of distinguishing substring selection
• scientific article; zbMATH DE number 7559472
• Constraint solving on bounded string variables
• Computing Covers Under Substring Consistent Equivalence Relations

Cites work

• A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type
• Chain-free string constraints
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 3757688 (Why is no real title available?)
• Symbolic execution and program testing

Cited in

(5)

• Avoiding substrings in compositons
• Word equations in synergy with regular constraints
• Satisfiability of context-free string constraints with subword-ordering and transducers
• Word equations in synergy with regular constraints (extended version)
• Negated string containment is decidable

This page was built for publication: Solving Not-Substring Constraint withFlat Abstraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488164)