Negated string containment is decidable
From MaRDI portal
Cites work
- A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type
- A decision procedure for regular membership and length constraints over unbounded strings
- An efficient SMT solver for string constraints
- An SMT solver for regular expressions and linear arithmetic over string length
- Chain-free string constraints
- Computer aided verification. 34th international conference, CAV 2022, Haifa, Israel, August 7--10, 2022. Proceedings. Part I
- Die Isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden.
- Even Faster Conflicts and Lazier Reductions for String Solvers
- High-level abstractions for simplifying extended string constraints in SMT
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Monadic decomposition
- On solving word equations using SAT
- On the satisfiability of context-free string constraints with subword-ordering
- Path Feasibility Analysis for String-Manipulating Programs
- Satisfiability of word equations with constants is in PSPACE
- Scaling up DPLL(T) string solvers using context-dependent simplification
- Solving Not-Substring Constraint withFlat Abstraction
- Solving string constraints using SAT
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- String solving with word equations and transducers: towards a logic for analysing mutation XSS
- Syntax-guided quantifier instantiation
- The equation \(a_ M=b^ Nc^ P\) in a free group
- The expressibility of languages and relations by word equations
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Procee
- Towards more efficient methods for solving regular-expression heavy string constraints
- Word equations in synergy with regular constraints
This page was built for publication: Negated string containment is decidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310230)
