Word equations in synergy with regular constraints
From MaRDI portal
Publication:6174543
DOI10.1007/978-3-031-27481-7_23zbMath1529.68331arXiv2212.02317OpenAlexW4323026879MaRDI QIDQ6174543
Yu-Fang Chen, Ondřej Lengál, Juraj Síč, František Blahoudek, David Chocholatý, Lukáš Holík, Vojtěch Havlena
Publication date: 17 August 2023
Published in: Formal Methods (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.02317
Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient SMT solver for string constraints
- An SMT solver for regular expressions and linear arithmetic over string length
- Automata-based model counting for string constraints
- Design and implementation of bounded-length sequence variables
- A symbolic algorithm for the case-split rule in string constraint solving
- Scaling up DPLL(T) string solvers using context-dependent simplification
- Automata-based symbolic string analysis for vulnerability detection
- On solving word equations using SAT
- Satisfiability of word equations with constants is in NEXPTIME
- String solving with word equations and transducers: towards a logic for analysing mutation XSS
- Symbolic finite state transducers
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
- Recompression
- RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA
- Chain-Free String Constraints
- Path Feasibility Analysis for String-Manipulating Programs
- Progressive Reasoning over Recursively-Defined Strings
- String Analysis via Automata Manipulation with Logic Circuit Representation
- A decision procedure for string logic with quadratic equations, regular expressions and length constraints
