On the public citation graph
String constraints with concatenation and transducers solved efficiently
0 signed · 127 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/11591191_28openalex-snapshot
Experimental Evaluation of Classical Automata Constructions
inferredcites →https://doi.org/10.1007/3-540-18088-5_43openalex-snapshot
A generalization of the procedure of karp and miller to well structured transition systems
inferredcites →https://doi.org/10.1007/3-540-40922-x_8openalex-snapshot
Checking Safety Properties Using Induction and a SAT-Solver
inferredcites →https://doi.org/10.1007/3-540-60915-6_6openalex-snapshot
An automata-theoretic approach to linear temporal logic
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_22openalex-snapshot
The nuXmv Symbolic Model Checker
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-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-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-540-32275-7_3openalex-snapshot
Abstract DPLL and Abstract DPLL Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_1openalex-snapshot
Interpolation and SAT-Based Model Checking
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-00768-2_28openalex-snapshot
Symbolic String Verification: Combining String Analysis and Size Analysis
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-12002-2_2openalex-snapshot
Antichain Algorithms for Finite Automata
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_5openalex-snapshot
ABC: An Academic Industrial-Strength Verification Tool
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-36742-7_20openalex-snapshot
Unbounded Model-Checking with Interpolation for Regular Language Constraints
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-39799-8_10openalex-snapshot
Incremental, Inductive Coverability
inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bfb0054336openalex-snapshot
Solving equations in strings: On Makanin's algorithm
inferredcites →https://doi.org/10.1007/s00165-011-0214-3openalex-snapshot
Simple linear string constraints
inferredcites →https://doi.org/10.1007/s10515-012-0111-xopenalex-snapshot
StrSolve: solving string constraints lazily
inferredcites →https://doi.org/10.1007/s10703-013-0189-1openalex-snapshot
Automata-based symbolic string analysis for vulnerability detection
inferredcites →https://doi.org/10.1007/s10703-016-0247-6openalex-snapshot
An efficient SMT solver for string constraints
inferredcites →https://doi.org/10.1016/0004-3702(80)90011-9openalex-snapshot
Circumscription—A form of non-monotonic reasoning
inferredcites →https://doi.org/10.1016/j.entcs.2018.03.017openalex-snapshot
A Symbolic Decision Procedure for Symbolic Alternating Finite Automata
inferredcites →https://doi.org/10.1017/cbo9781107326019openalex-snapshot
Algebraic Combinatorics on Words
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.1142/s012905410200128xopenalex-snapshot
MONA IMPLEMENTATION SECRETS
inferredcites →https://doi.org/10.1142/s0129054111009112openalex-snapshot
RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA
inferredcites →https://doi.org/10.1145/1132516.1132584openalex-snapshot
An efficient algorithm for solving word equations
inferredcites →https://doi.org/10.1145/1390630.1390661openalex-snapshot
Dynamic test input generation for web applications
inferredcites →https://doi.org/10.1145/1985793.1985995openalex-snapshot
Symbolic execution for software testing in practice
inferredcites →https://doi.org/10.1145/1995376.1995394openalex-snapshot
Satisfiability modulo theories
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/2389241.2389250openalex-snapshot
Expressive Languages for Path Queries over Graph-Structured Data
inferredcites →https://doi.org/10.1145/2389836.2389853openalex-snapshot
Symbolic execution of programs with strings
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/2642937.2643003openalex-snapshot
Evaluation of string constraint solvers in the context of symbolic execution
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/2898375.2898393openalex-snapshot
Efficient solving of string constraints for security analysis
inferredcites →https://doi.org/10.1145/3092282.3092295openalex-snapshot
ExpoSE: practical symbolic execution of standalone JavaScript
inferredcites →https://doi.org/10.1145/990308.990312openalex-snapshot
Satisfiability of word equations with constants is in PSPACE
inferredcites →https://doi.org/10.2140/pjm.1966.16.285openalex-snapshot
Semigroups, Presburger formulas, and languages
inferredcites →https://doi.org/10.2168/lmcs-9(3:1)2013openalex-snapshot
Graph Logics with Rational Relations
inferredcites →https://doi.org/10.4230/lipics.sat.2024.15openalex-snapshot
Antichain with SAT and Tries
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.2400openalex-snapshot
ZaligVinder: A generic test framework for string solvers
inferred← citeshttps://doi.org/10.1007/978-3-030-01090-4_21openalex-snapshot
Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility
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-19212-9_1openalex-snapshot
Constraint Programming for Dynamic Symbolic Execution of JavaScript
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-58475-7_1openalex-snapshot
Dashed Strings and the Replace(-all) Constraint
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-85088-3_5openalex-snapshot
String Theories Involving Regular Membership Predicates: From Practice to Theory and Back
inferred← citeshttps://doi.org/10.1007/978-3-030-89051-3_14openalex-snapshot
Simplifying Alternating Automata for Emptiness Testing
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-15077-7_8openalex-snapshot
Solving String Theories Involving Regular Membership Predicates Using SAT
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-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-3-319-98334-9_2openalex-snapshot
Propagating Regular Membership with Dashed Strings
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/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/s10270-020-00849-8openalex-snapshot
A formal approach to finding inconsistencies in a metamodel
inferred← citeshttps://doi.org/10.1007/s10817-022-09654-yopenalex-snapshot
A Solver for Arrays with Concatenation
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103368openalex-snapshot
Dashed strings for string constraint solving
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.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/issre55969.2022.00033openalex-snapshot
String Test Data Generation for Java Programs
inferred← citeshttps://doi.org/10.1145/3209108.3209204openalex-snapshot
A Fixpoint Logic and Dependent Effects for Temporal Property Verification
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/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/3622872openalex-snapshot
Solving String Constraints with Lengths by Stabilization
inferred← citeshttps://doi.org/10.1145/3649855openalex-snapshot
A Constraint Solving Approach to Parikh Images of Regular Languages
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/3779031.3779094openalex-snapshot
Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
inferred← citeshttps://doi.org/10.23919/fmcad.2018.8602997openalex-snapshot
Trau: SMT solver for string constraints
inferred← citeshttps://doi.org/10.3233/faia200431openalex-snapshot
String Constraint Solving: Past, Present and Future
inferred← citeshttps://doi.org/10.3390/app10103525openalex-snapshot
Static Analysis for ECMAScript String Manipulation Programs
inferred← citeshttps://doi.org/10.4204/eptcs.299.5openalex-snapshot
Static Program Analysis for String Manipulation Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1805.09123openalex-snapshot
Decidable Logics Combining Word Equations, Regular Expressions and Length Constraints
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.