On the public citation graph

Decision procedures for path feasibility of string-manipulating programs with complex operations

0 signed · 135 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.1007/3-540-46432-8_17openalex-snapshot
On Rational Graphs
inferredcites →https://doi.org/10.1007/3-540-61474-5_93openalex-snapshot
Symbolic model checking
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-10575-8_11openalex-snapshot
Satisfiability Modulo Theories
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-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-540-32275-7_3openalex-snapshot
Abstract DPLL and Abstract DPLL Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-540-89439-1_20openalex-snapshot
A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
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-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-23822-2_9openalex-snapshot
A Systematic Analysis of XSS Sanitization in Web Application Frameworks
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/978-3-642-85706-5openalex-snapshot
Automata and Computability
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/0141-9331(94)90007-8openalex-snapshot
Symbolic Model Checking
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1017/cbo9781107326019openalex-snapshot
Algebraic Combinatorics on Words
inferredcites →https://doi.org/10.1017/cbo9781107326019.013openalex-snapshot
Makanin's Algorithm
inferredcites →https://doi.org/10.1017/s0956796800003889openalex-snapshot
The expressive power of higher-order types or, life without CONS
inferredcites →https://doi.org/10.1051/ita:2006005openalex-snapshot
Decision problems among the main subfamilies of rational relations
inferredcites →https://doi.org/10.1109/sp.2010.38openalex-snapshot
A Symbolic Execution Framework for JavaScript
inferredcites →https://doi.org/10.1145/1060745.1060809openalex-snapshot
Static approximation of dynamically generated Web pages
inferredcites →https://doi.org/10.1145/1064978.1065036openalex-snapshot
DART
inferredcites →https://doi.org/10.1145/1081706.1081750openalex-snapshot
CUTE
inferredcites →https://doi.org/10.1145/1180405.1180445openalex-snapshot
EXE
inferredcites →https://doi.org/10.1145/1995376.1995394openalex-snapshot
Satisfiability modulo theories
inferredcites →https://doi.org/10.1145/2377656.2377662openalex-snapshot
HAMPI
inferredcites →https://doi.org/10.1145/2408776.2408795openalex-snapshot
Symbolic execution for software testing
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/2643134openalex-snapshot
Securing the tangled web
inferredcites →https://doi.org/10.1145/2660267.2660372openalex-snapshot
S3
inferredcites →https://doi.org/10.1145/2743014openalex-snapshot
Recompression
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/3040488openalex-snapshot
Monadic Decomposition
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/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/360248.360252openalex-snapshot
Symbolic execution and program testing
inferredcites →https://doi.org/10.1145/371316.371512openalex-snapshot
MSO definable string transductions and two-way finite-state transducers
inferredcites →https://doi.org/10.1145/876638.876642openalex-snapshot
Definable relations and first-order query languages over strings
inferredcites →https://doi.org/10.1145/937555.937557openalex-snapshot
Variable independence for first-order definable constraints
inferredcites →https://doi.org/10.1145/990308.990312openalex-snapshot
Satisfiability of word equations with constants is in PSPACE
inferredcites →https://doi.org/10.1201/9781315148175openalex-snapshot
Automata and Computability
inferredcites →https://doi.org/10.2168/lmcs-9(3:1)2013openalex-snapshot
Graph Logics with Rational Relations
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.3233/faia336openalex-snapshot
Handbook of Satisfiability
inferredcites →https://doi.org/10.48550/arxiv.0705.0262openalex-snapshot
The Complexity of Games on Higher Order Pushdown Automata
inferredcites →https://doi.org/10.5555/1855741.1855756openalex-snapshot
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
inferredcites →https://doi.org/10.5555/2591370.2591389openalex-snapshot
From Two-Way to One-Way Finite State Transducers

What points at this work

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

inferred← citeshttps://doi.org/10.1002/smr.2647openalex-snapshot
Tarsis : An effective automata‐based abstract domain for string analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_2openalex-snapshot
High-Level Abstractions for Simplifying Extended String Constraints in SMT
inferred← citeshttps://doi.org/10.1007/978-3-030-30806-3_8openalex-snapshot
On Solving Word Equations Using SAT
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-34175-6_2openalex-snapshot
On Strings in Software Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-45093-9_59openalex-snapshot
Solving String Constraints with Approximate Parikh Image
inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_8openalex-snapshot
Monadic Decomposition in Integer Linear Arithmetic
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-67067-2_13openalex-snapshot
Twinning Automata and Regular Expressions for String Static Analysis
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-030-90870-6_21openalex-snapshot
Z3str4: A Multi-armed String Solver
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_2openalex-snapshot
Word Equations in the Context of String Solving
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_11openalex-snapshot
Even Faster Conflicts and Lazier Reductions for String Solvers
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-37703-7_9openalex-snapshot
Solving String Constraints Using SAT
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-40247-0_15openalex-snapshot
Verified Verifying: SMT-LIB for Strings in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-031-57246-3_2openalex-snapshot
Z3-Noodler: An Automata-based String Solver
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-78116-2_2openalex-snapshot
SMTQuery: Analysing SMT-LIB String Benchmarks
inferred← citeshttps://doi.org/10.1007/978-3-031-78709-6_14openalex-snapshot
Guiding Word Equation Solving Using Graph Neural Networks
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_1openalex-snapshot
Polyregular Model Checking
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-04167-8_18openalex-snapshot
When GNNs Met a Word Equations Solver: Learning to Rank Equations
inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_7openalex-snapshot
On Solving String Equations via Powers and Parikh Images
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-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/s00224-023-10154-8openalex-snapshot
A Closer Look at the Expressive Power of Logics Based on Word Equations
inferred← citeshttps://doi.org/10.1007/s10270-020-00849-8openalex-snapshot
A formal approach to finding inconsistencies in a metamodel
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.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.scico.2026.103526openalex-snapshot
SMTQuery: A novel tool for analyzing SMT-LIB string benchmarks
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.2022.12.009openalex-snapshot
Towards more efficient methods for solving regular-expression heavy string constraints
inferred← citeshttps://doi.org/10.1109/ase51524.2021.9678881openalex-snapshot
Data-Driven Design and Evaluation of SMT Meta-Solving Strategies: Balancing Performance, Accuracy, and Cost
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.1109/iwqos65803.2025.11215174openalex-snapshot
LEOPARD: Accelerating Cloud-based Access Control Policy Verification Using Logical Encoding Optimization
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175722openalex-snapshot
Revisiting Membership Problems in Subclasses of Rational Relations
inferred← citeshttps://doi.org/10.1109/mo2re66661.2025.00009openalex-snapshot
Exploring Large Language Models for Requirements on String Values
inferred← citeshttps://doi.org/10.1109/re63999.2025.00030openalex-snapshot
LLM-based Satisfiability Checking of String Requirements by Consistent Data and Checker Generation
inferred← citeshttps://doi.org/10.1145/3373394.3373396openalex-snapshot
Strings at MOSCA
inferred← citeshttps://doi.org/10.1145/3385412.3386034openalex-snapshot
Efficient handling of string-number conversion
inferred← citeshttps://doi.org/10.1145/3428260openalex-snapshot
Inter-theory dependency analysis for SMT string solvers
inferred← citeshttps://doi.org/10.1145/3453483.3454066openalex-snapshot
Symbolic Boolean derivatives for efficiently solving extended regular expression constraints
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/3576915.3616582openalex-snapshot
Black Ostrich: Web Application Scanning with String Solvers
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/3632907openalex-snapshot
Parikh’s Theorem Made Symbolic
inferred← citeshttps://doi.org/10.1145/3649855openalex-snapshot
A Constraint Solving Approach to Parikh Images of Regular Languages
inferred← citeshttps://doi.org/10.1145/3652620.3687822openalex-snapshot
Verifying UML Models Annotated with OCL Strings
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/3763054openalex-snapshot
Static Inference of Regular Grammars for Ad Hoc Parsers
inferred← citeshttps://doi.org/10.1145/3763165openalex-snapshot
The Power of Regular Constraint Propagation
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.21941/kcss/2022/1openalex-snapshot
Light On String Solving
inferred← citeshttps://doi.org/10.2197/ipsjjip.27.810openalex-snapshot
Solving String Constraints with Streaming String Transducers
inferred← citeshttps://doi.org/10.3233/faia200431openalex-snapshot
String Constraint Solving: Past, Present and Future
inferred← citeshttps://doi.org/10.3389/fcomp.2025.1655377openalex-snapshot
Whole-value analysis by abstract interpretation
inferred← citeshttps://doi.org/10.34727/2020/isbn.978-3-85448-042-6_30openalex-snapshot
Reductions for Strings and Regular Expressions Revisited
inferred← citeshttps://doi.org/10.4204/eptcs.341.4openalex-snapshot
Program Specialization as a Tool for Solving Word Equations
inferred← citeshttps://doi.org/10.4230/lipics.concur.2020.16openalex-snapshot
On the Separability Problem of String Constraints
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.103openalex-snapshot
Monadic Decomposability of Regular Relations
inferred← citeshttps://doi.org/10.48550/arxiv.2004.12371openalex-snapshot
Monadic Decomposition in Integer Linear Arithmetic (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.2007.12247openalex-snapshot
On Solving Word Equations via Program Transformation
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.