Solving string constraints with regex-dependent functions through transducers with priorities and variables
Regular expressions are a classical concept in formal language theory. Regular
expressions in programming languages (RegEx) such as JavaScript, feature non-standard …
expressions in programming languages (RegEx) such as JavaScript, feature non-standard …
Solving string constraints with lengths by stabilization
We present a new algorithm for solving string constraints. The algorithm builds upon a
recent method for solving word equations and regular constraints that interprets string …
recent method for solving word equations and regular constraints that interprets string …
Word equations in synergy with regular constraints
F Blahoudek, YF Chen, D Chocholatý… - … Symposium on Formal …, 2023 - Springer
We argue that in string solving, word equations and regular constraints are better mixed
together than approached separately as in most current string solvers. We propose a fast …
together than approached separately as in most current string solvers. We propose a fast …
On the expressive power of string constraints
We investigate properties of strings which are expressible by canonical types of string
constraints. Specifically, we consider a landscape of 20 logical theories, whose syntax is …
constraints. Specifically, we consider a landscape of 20 logical theories, whose syntax is …
[PDF][PDF] An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic.
An efficient entailment proof system is essential to compositional verification using
separation logic. Unfortunately, existing decision procedures are either inexpressive or …
separation logic. Unfortunately, existing decision procedures are either inexpressive or …
High-level abstractions for simplifying extended string constraints in SMT
Abstract Satisfiability Modulo Theories (SMT) solvers with support for the theory of strings
have recently emerged as powerful tools for reasoning about string-manipulating programs …
have recently emerged as powerful tools for reasoning about string-manipulating programs …
Z3-Noodler: An Automata-based String Solver
Abstract z3-Noodler is a fork of z3 that replaces its string theory solver with a custom solver
implementing the recently introduced stabilization-based algorithm for solving word …
implementing the recently introduced stabilization-based algorithm for solving word …
Formal Languages via Theories over Strings: An Overview of Some Recent Results
JD Day, V Ganesh, F Mane - Bulletin of EATCS, 2023 - smtp.eatcs.org
In this note, we overview a series of results that were obtained in [16, 15]. In these papers,
we have investigated the properties of formal languages ex-pressible in terms of formulas …
we have investigated the properties of formal languages ex-pressible in terms of formulas …
A symbolic algorithm for the case-split rule in solving word constraints with extensions
Case split is a core proof rule in current decision procedures for the theory of string
constraints. Its use is the primary cause of the state space explosion in string constraint …
constraints. Its use is the primary cause of the state space explosion in string constraint …
Compositional satisfiability solving in separation logic
QL Le - … , Model Checking, and Abstract Interpretation: 22nd …, 2021 - Springer
We introduce a novel decision procedure to the satisfiability problem in array separation
logic combined with general inductively defined predicates and arithmetic. Our proposal …
logic combined with general inductively defined predicates and arithmetic. Our proposal …