On the public citation graph
Solving string constraints with Regex-dependent functions through transducers with priorities and variables
0 signed · 94 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/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-19212-9_1openalex-snapshot
Constraint Programming for Dynamic Symbolic Execution of JavaScript
inferredcites →https://doi.org/10.1007/978-3-030-31784-3_16openalex-snapshot
Chain-Free String Constraints
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-21690-4_14openalex-snapshot
Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Constraints
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-319-41528-4_13openalex-snapshot
String Analysis via Automata Manipulation with Logic Circuit Representation
inferredcites →https://doi.org/10.1007/978-3-319-59776-8_5openalex-snapshot
Design and Implementation of Bounded-Length Sequence Variables
inferredcites →https://doi.org/10.1007/978-3-319-66158-2_1openalex-snapshot
A Novel Approach to String Constraint Solving
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-00982-2_24openalex-snapshot
On Extended Regular Expressions
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_13openalex-snapshot
Stranger: An Automata-Based String Analysis Tool for PHP
inferredcites →https://doi.org/10.1007/978-3-642-22012-8_1openalex-snapshot
Nondeterministic Streaming String Transducers
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/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/s00224-012-9389-0openalex-snapshot
Extended Regular Expressions: Succinctness and Decidability
inferredcites →https://doi.org/10.1007/s10703-013-0189-1openalex-snapshot
Automata-based symbolic string analysis for vulnerability detection
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(91)90015-topenalex-snapshot
Iterated stack automata and complexity classes
inferredcites →https://doi.org/10.1016/j.ic.2016.02.003openalex-snapshot
Characterising REGEX languages by regular languages equipped with factor-referencing
inferredcites →https://doi.org/10.1016/j.jcss.2019.04.001openalex-snapshot
Deterministic regular expressions with back-references
inferredcites →https://doi.org/10.1016/j.tcs.2016.09.006openalex-snapshot
On the semantics of regular expression parsing in the wild
inferredcites →https://doi.org/10.1017/cbo9780511576430openalex-snapshot
Handbook of Practical Logic and Automated Reasoning
inferredcites →https://doi.org/10.1051/ita:2006005openalex-snapshot
Decision problems among the main subfamilies of rational relations
inferredcites →https://doi.org/10.1109/ase.2019.00047openalex-snapshot
Regexes are Hard: Decision-Making, Difficulties, and Risks in Programming Regular Expressions
inferredcites →https://doi.org/10.1109/sp.2010.38openalex-snapshot
A Symbolic Execution Framework for JavaScript
inferredcites →https://doi.org/10.1142/s012905410300214xopenalex-snapshot
A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
inferredcites →https://doi.org/10.1145/1217856.1217859openalex-snapshot
Solving SAT and SAT Modulo Theories
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/3092282.3092295openalex-snapshot
ExpoSE: practical symbolic execution of standalone JavaScript
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/3238147.3238189openalex-snapshot
A symbolic model checking approach to the analysis of string and length constraints
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/3314221.3314645openalex-snapshot
Sound regular expression semantics for dynamic symbolic execution of JavaScript
inferredcites →https://doi.org/10.1145/3338906.3338909openalex-snapshot
Why aren’t regular expressions a lingua franca? an empirical study on the re-use and portability of regular expressions
inferredcites →https://doi.org/10.1145/3484198openalex-snapshot
A Survey on String Constraint Solving
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm
inferredcites →https://doi.org/10.2197/ipsjjip.27.810openalex-snapshot
Solving String Constraints with Streaming String Transducers
inferredcites →https://doi.org/10.23919/fmcad.2017.8102241openalex-snapshot
Z3str3: A String Solver with Theory-aware Heuristics
inferredcites →https://doi.org/10.23919/fmcad.2018.8602997openalex-snapshot
Trau: SMT solver for string constraints
inferredcites →https://doi.org/10.4204/eptcs.151.7openalex-snapshot
Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2010.1openalex-snapshot
Expressiveness of streaming string transducers
inferredcites →https://doi.org/10.4230/lipics.sat.2024.15openalex-snapshot
Antichain with SAT and Tries
inferredcites →https://doi.org/10.48550/arxiv.1605.09442openalex-snapshot
Undecidability of a Theory of Strings, Linear Arithmetic over Length, and String-Number Conversion
inferredcites →https://doi.org/10.5860/choice.47-3211openalex-snapshot
Handbook of practical logic and automated reasoning
inferredcites →https://doi.org/10.60882/cispa.32771274openalex-snapshot
Freezing the Web: A Study of ReDoS Vulnerabilities in JavaScript-based Web Servers.
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-27481-7_23openalex-snapshot
Word Equations in Synergy with Regular Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-37703-7_2openalex-snapshot
Decision Procedures for Sequence Theories
inferred← citeshttps://doi.org/10.1007/978-3-031-47963-2_14openalex-snapshot
Algorithms for Checking Intersection Non-emptiness of Regular Expressions
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_3openalex-snapshot
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic
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-031-98668-0_10openalex-snapshot
$$\textsf{HornStr}$$: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_7openalex-snapshot
Regex Decision Procedures in Extended RE#
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_8openalex-snapshot
Integrating String Reasoning in Symbolic Execution of C Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-30693-7_3openalex-snapshot
Generation of Non-matching Strings for Testing Regular Expressions via Complement Automaton Coverage
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_14openalex-snapshot
Repairing Regex-Dependent String-Manipulation Programs
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-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/978-981-99-8664-4_12openalex-snapshot
Modeling Regex Operators for Solving Regex Crossword Puzzles
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/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.103510openalex-snapshot
Effective methods for solving regex crossword puzzles
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.1016/j.tcs.2025.115249openalex-snapshot
Incremental algorithms for solving regular expression intersection non-emptiness
inferred← citeshttps://doi.org/10.1109/issre55969.2022.00033openalex-snapshot
String Test Data Generation for Java Programs
inferred← citeshttps://doi.org/10.1109/siml65326.2025.11080791openalex-snapshot
Exploring React Library Related Questions on Stack Overflow: Answered vs. Unanswered
inferred← citeshttps://doi.org/10.1145/3497775.3503691openalex-snapshot
CertiStr: a certified string solver
inferred← citeshttps://doi.org/10.1145/3571203openalex-snapshot
On the Expressive Power of String Constraints
inferred← citeshttps://doi.org/10.1145/3591287openalex-snapshot
Repairing Regular Expressions for Extraction
inferred← citeshttps://doi.org/10.1145/3597503.3639118openalex-snapshot
Testing the Limits: Unusual Text Inputs Generation for Mobile App Crash Detection with Large Language Model
inferred← citeshttps://doi.org/10.1145/3622872openalex-snapshot
Solving String Constraints with Lengths by Stabilization
inferred← citeshttps://doi.org/10.1145/3674666openalex-snapshot
A Coq Mechanization of JavaScript Regular Expression Semantics
inferred← citeshttps://doi.org/10.1145/3691620.3695005openalex-snapshot
Repairing Regex-Dependent String Functions
inferred← citeshttps://doi.org/10.1145/3704837openalex-snapshot
RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement, and Restricted Lookarounds
inferred← citeshttps://doi.org/10.1145/3729273openalex-snapshot
A Uniform Framework for Handling Position Constraints in String Solving
inferred← citeshttps://doi.org/10.1145/3763165openalex-snapshot
The Power of Regular Constraint Propagation
inferred← citeshttps://doi.org/10.1145/3776710openalex-snapshot
Formal Verification for JavaScript Regular Expressions: A Proven Mechanized Semantics and Its Applications
inferred← citeshttps://doi.org/10.1145/3779031.3779094openalex-snapshot
Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
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.15407/pp2025.01.063openalex-snapshot
Neurosymbolic models for ensuring cybersecurity in critical cyberphysical systems
inferred← citeshttps://doi.org/10.23939/jcpee2024.01.042openalex-snapshot
Neuro-symbolic models for ensuring cybersecurity in critical cyber-physical systems
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.