On the public citation graph

On the Expressive Power of String Constraints

0 signed · 55 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19880340410openalex-snapshot
Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory
inferredcites →https://doi.org/10.1002/smr.2400openalex-snapshot
ZaligVinder: A generic test framework for string solvers
inferredcites →https://doi.org/10.1007/11523468_89openalex-snapshot
Congruences for Visibly Pushdown Languages
inferredcites →https://doi.org/10.1007/3-540-06473-7_11openalex-snapshot
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages
inferredcites →https://doi.org/10.1007/3-540-55124-7_4openalex-snapshot
Makanin's algorithm for word equations-two improvements and a generalization
inferredcites →https://doi.org/10.1007/978-3-030-00250-3_2openalex-snapshot
The Satisfiability of Word Equations: Decidable and Undecidable Theories
inferredcites →https://doi.org/10.1007/978-3-030-01090-4_21openalex-snapshot
Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility
inferredcites →https://doi.org/10.1007/978-3-030-02768-1_19openalex-snapshot
A Decision Procedure for String Logic with Quadratic Equations, Regular Expressions and Length Constraints
inferredcites →https://doi.org/10.1007/978-3-030-81688-9_14openalex-snapshot
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length
inferredcites →https://doi.org/10.1007/978-3-030-85088-3_5openalex-snapshot
String Theories Involving Regular Membership Predicates: From Practice to Theory and Back
inferredcites →https://doi.org/10.1007/978-3-030-90870-6_21openalex-snapshot
Z3str4: A Multi-armed String Solver
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_29openalex-snapshot
Norn: An SMT Solver for String Constraints
inferredcites →https://doi.org/10.1007/978-3-319-24246-0_9openalex-snapshot
A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_12openalex-snapshot
Progressive Reasoning over Recursively-Defined Strings
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_14openalex-snapshot
CVC4
inferredcites →https://doi.org/10.1007/978-3-642-39611-3_21openalex-snapshot
Word Equations with Length Constraints: What’s Decidable?
inferredcites →https://doi.org/10.1007/bf02112533openalex-snapshot
Undecidability of the positive ∀∃3-theory of a free semigroup
inferredcites →https://doi.org/10.1007/s00224-017-9770-0openalex-snapshot
Document Spanners: From Expressive Power to Decision Problems
inferredcites →https://doi.org/10.1007/s00224-018-9874-1openalex-snapshot
A Logic for Document Spanners
inferredcites →https://doi.org/10.1007/s00233-004-0146-9openalex-snapshot
Algebraic Combinatorics on Words
inferredcites →https://doi.org/10.1016/j.jcss.2021.08.001openalex-snapshot
Word equations in non-deterministic linear space
inferredcites →https://doi.org/10.1070/sm1977v032n02abeh002376openalex-snapshot
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1109/lics.2017.8005141openalex-snapshot
Decidability, complexity, and expressiveness of first-order logic over the subword ordering
inferredcites →https://doi.org/10.1109/sffcs.1999.814622openalex-snapshot
Satisfiability of word equations with constants is in PSPACE
inferredcites →https://doi.org/10.1145/1007352.1007390openalex-snapshot
Visibly pushdown languages
inferredcites →https://doi.org/10.1145/1516512.1516518openalex-snapshot
Adding nesting structure to words
inferredcites →https://doi.org/10.1145/1572272.1572286openalex-snapshot
HAMPI
inferredcites →https://doi.org/10.1145/2377656.2377662openalex-snapshot
HAMPI
inferredcites →https://doi.org/10.1145/2837614.2837641openalex-snapshot
String solving with word equations and transducers: towards a logic for analysing mutation XSS
inferredcites →https://doi.org/10.1145/3070822openalex-snapshot
Graph Logics with Rational Relations
inferredcites →https://doi.org/10.1145/3158091openalex-snapshot
What is decidable about string constraints with the ReplaceAll function
inferredcites →https://doi.org/10.1145/3158092openalex-snapshot
String constraints with concatenation and transducers solved efficiently
inferredcites →https://doi.org/10.1145/3290362openalex-snapshot
Decision procedures for path feasibility of string-manipulating programs with complex operations
inferredcites →https://doi.org/10.1145/337244.337255openalex-snapshot
The expressibility of languages and relations by word equations
inferredcites →https://doi.org/10.1145/3373394.3373396openalex-snapshot
Strings at MOSCA
inferredcites →https://doi.org/10.1145/3385412.3386034openalex-snapshot
Efficient handling of string-number conversion
inferredcites →https://doi.org/10.1145/3484198openalex-snapshot
A Survey on String Constraint Solving
inferredcites →https://doi.org/10.1145/3497775.3503691openalex-snapshot
CertiStr: a certified string solver
inferredcites →https://doi.org/10.1145/3498707openalex-snapshot
Solving string constraints with Regex-dependent functions through transducers with priorities and variables
inferredcites →https://doi.org/10.1145/3517804.3524159openalex-snapshot
Data Path Queries over Embedded Graph Databases
inferredcites →https://doi.org/10.1145/876638.876642openalex-snapshot
Definable relations and first-order query languages over strings
inferredcites →https://doi.org/10.2168/lmcs-11(4:1)2015openalex-snapshot
Expressive Path Queries on Graph with Data
inferredcites →https://doi.org/10.2307/2268308openalex-snapshot
Concatenation as a basis for arithmetic
inferredcites →https://doi.org/10.4230/lipics.icalp.2021.130openalex-snapshot
The Theory of Concatenation over Finite Models

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-78116-2_2openalex-snapshot
SMTQuery: Analysing SMT-LIB String Benchmarks
inferred← citeshttps://doi.org/10.1007/978-3-031-97100-6_8openalex-snapshot
On the Decidability and Expressive Power of Several Theories Based on String Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_8openalex-snapshot
Visibly Pushdown Languages in Groups
inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_3openalex-snapshot
String Solving with Stabilization and Transducers
inferred← citeshttps://doi.org/10.1007/s00224-023-10154-8openalex-snapshot
A Closer Look at the Expressive Power of Logics Based on Word Equations
inferred← citeshttps://doi.org/10.1007/s10009-024-00755-0openalex-snapshot
Non-numerical weakly relational domains
inferred← citeshttps://doi.org/10.1007/s10601-025-09379-wopenalex-snapshot
Word equations in synergy with regular constraints (extended version)
inferred← citeshttps://doi.org/10.1007/s11390-025-4684-9openalex-snapshot
A Separation Logic for Sequences in Block-Based Cloud Storage Systems and Its Decidability
inferred← citeshttps://doi.org/10.1016/j.scico.2026.103526openalex-snapshot
SMTQuery: A novel tool for analyzing SMT-LIB string benchmarks
inferred← citeshttps://doi.org/10.1145/3622876openalex-snapshot
Message Chains for Distributed System Verification
inferred← citeshttps://doi.org/10.1145/3689747openalex-snapshot
On the Expressive Power of Languages for Static Variability
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.