1 citations · 1 across the 4 of their papers we have counts for
4 papers
Decision Procedure for A Theory of String Sequences
Denghang Hu, Taolue Chen, Philipp Rümmer +2
The theory of sequences, supported by many SMT solvers, can model program data types including bounded arrays and lists. Sequences are parameterized by the element data type and pr…
OSTRICH2: Solver for Complex String Constraints
Matthew Hague, Denghang Hu, Artur Jeż +4
We present OSTRICH2, the latest evolution of the SMT solver OSTRICH for string constraints. OSTRICH2 supports a wide range of complex functions on strings and provides completeness…
Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorities And Variables
Taolue Chen, Alejandro Flores Lamas, Matthew Hague +6
Regular expressions are a classical concept in formal language theory. Regular expressions in programming languages (RegEx) such as JavaScript, feature non-standard semantics of op…
A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type
Taolue Chen, Matthew Hague, Jinlong He +4
Strings are widely used in programs, especially in web applications. Integer data type occurs naturally in string-manipulating programs, and is frequently used to refer to lengths…