On the public citation graph
What is decidable about string constraints with the ReplaceAll function
0 signed · 75 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
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-319-08867-9_10openalex-snapshot
String Constraints for Verification
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_43openalex-snapshot
A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions
inferredcites →https://doi.org/10.1007/978-3-319-41528-4openalex-snapshot
Computer Aided Verification
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-00768-2_27openalex-snapshot
Path Feasibility Analysis for String-Manipulating Programs
inferredcites →https://doi.org/10.1007/978-3-642-35873-9_14openalex-snapshot
Static Analysis of String Encoders and Decoders
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/s10703-013-0189-1openalex-snapshot
Automata-based symbolic string analysis for vulnerability detection
inferredcites →https://doi.org/10.1070/sm1977v032n02abeh002376openalex-snapshot
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1109/sp.2008.22openalex-snapshot
Saner: Composing Static and Dynamic Analysis to Validate Sanitization in Web Applications
inferredcites →https://doi.org/10.1109/sp.2010.38openalex-snapshot
A Symbolic Execution Framework for JavaScript
inferredcites →https://doi.org/10.1145/2103621.2103674openalex-snapshot
Symbolic finite state transducers
inferredcites →https://doi.org/10.1145/2103656.2103674openalex-snapshot
Symbolic finite state transducers
inferredcites →https://doi.org/10.1145/2491411.2491447openalex-snapshot
Jalangi: a selective record-replay and dynamic analysis framework for JavaScript
inferredcites →https://doi.org/10.1145/2491411.2491456openalex-snapshot
Z3-str: a z3-based string solver for web application analysis
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/3062341.3062384openalex-snapshot
Flatten and conquer: a framework for efficient analysis of string constraints
inferredcites →https://doi.org/10.1145/360248.360252openalex-snapshot
Symbolic execution and program testing
inferredcites →https://doi.org/10.1145/990308.990312openalex-snapshot
Satisfiability of word equations with constants is in PSPACE
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2010.1openalex-snapshot
Expressiveness of streaming string transducers
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-030-02768-1_19openalex-snapshot
A Decision Procedure for String Logic with Quadratic Equations, Regular Expressions and Length Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-31784-3_16openalex-snapshot
Chain-Free String Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-46714-2_10openalex-snapshot
Towards Constraint Logic Programming over Strings for Test Data Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_18openalex-snapshot
A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type
inferred← citeshttps://doi.org/10.1007/978-3-030-64437-6_18openalex-snapshot
A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_14openalex-snapshot
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length
inferred← citeshttps://doi.org/10.1007/978-3-030-89051-3_17openalex-snapshot
Solving Not-Substring Constraint withFlat Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_23openalex-snapshot
Word Equations in Synergy with Regular Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_17openalex-snapshot
Reasoning About Regular Properties: A Comparative Study
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_7openalex-snapshot
Mata: A Fast and Simple Finite Automata Library
inferred← citeshttps://doi.org/10.1007/978-3-031-90653-4_2openalex-snapshot
Z3-Noodler 1.3: Shepherding Decision Procedures for Strings with Model Generation
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/978-3-319-96145-3_10openalex-snapshot
JBMC: A Bounded Model Checking Tool for Verifying Java Bytecode
inferred← citeshttps://doi.org/10.1007/978-981-95-3585-9_11openalex-snapshot
Decision Procedure for a Theory of String Sequences
inferred← citeshttps://doi.org/10.1007/978-981-99-8664-4_1openalex-snapshot
String Constraints with Regex-Counting and String-Length Solved More Efficiently
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/s00236-023-00446-4openalex-snapshot
A decision procedure for string constraints with string/integer conversion and flat regular constraints
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/s10817-022-09654-yopenalex-snapshot
A Solver for Arrays with Concatenation
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.jss.2023.111673openalex-snapshot
A symbolic algorithm for the case-split rule in solving word constraints with extensions
inferred← citeshttps://doi.org/10.1016/j.sysarc.2025.103340openalex-snapshot
An efficient string solver for string constraints with regex-counting and string-length
inferred← citeshttps://doi.org/10.1051/e3sconf/202456801006openalex-snapshot
Fostering local SDGs performance with green government initiative: Insights from Sidoarjo Regency, Indonesia
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00027openalex-snapshot
Relia: Accelerating the Analysis of Cloud Access Control Policies
inferred← citeshttps://doi.org/10.1109/icse48619.2023.00117openalex-snapshot
Verifying Data Constraint Equivalence in FinTech Systems
inferred← citeshttps://doi.org/10.1145/3238147.3238189openalex-snapshot
A symbolic model checking approach to the analysis of string and length constraints
inferred← citeshttps://doi.org/10.1145/3290362openalex-snapshot
Decision procedures for path feasibility of string-manipulating programs with complex operations
inferred← citeshttps://doi.org/10.1145/3385412.3386034openalex-snapshot
Efficient handling of string-number conversion
inferred← citeshttps://doi.org/10.1145/3484198openalex-snapshot
A Survey on String Constraint Solving
inferred← citeshttps://doi.org/10.1145/3497775.3503691openalex-snapshot
CertiStr: a certified string solver
inferred← citeshttps://doi.org/10.1145/3498707openalex-snapshot
Solving string constraints with Regex-dependent functions through transducers with priorities and variables
inferred← citeshttps://doi.org/10.1145/3531130.3533329openalex-snapshot
On the Satisfiability of Context-free String Constraints with Subword-Ordering
inferred← citeshttps://doi.org/10.1145/3571203openalex-snapshot
On the Expressive Power of String Constraints
inferred← citeshttps://doi.org/10.1145/3597926.3598122openalex-snapshot
Data Constraint Mining for Automatic Reconciliation Scripts Generation
inferred← citeshttps://doi.org/10.1145/3622872openalex-snapshot
Solving String Constraints with Lengths by Stabilization
inferred← citeshttps://doi.org/10.1145/3691620.3695005openalex-snapshot
Repairing Regex-Dependent String Functions
inferred← citeshttps://doi.org/10.1145/3729273openalex-snapshot
A Uniform Framework for Handling Position Constraints in String Solving
inferred← citeshttps://doi.org/10.1145/3729336openalex-snapshot
A Concurrent Approach to String Transformation Synthesis
inferred← citeshttps://doi.org/10.1145/3763165openalex-snapshot
The Power of Regular Constraint Propagation
inferred← citeshttps://doi.org/10.1145/3832221openalex-snapshot
Solving String Split Constraints via Structural Relaxation
inferred← citeshttps://doi.org/10.1145/3832783.3837545openalex-snapshot
ReSEDA: Automatic and Precise Program-Level ReDoS Triage via Interprocedural Taint Analysis and Agentic Exploit Generation
inferred← citeshttps://doi.org/10.4230/lipics.concur.2020.16openalex-snapshot
On the Separability Problem of String Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1904.11254openalex-snapshot
SafeStrings: Representing Strings as Structured Data
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.