On the public citation graph

Solving String Constraints with Lengths by Stabilization

https://doi.org/10.1145/3622872
0 signed · 90 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.1007/3-540-44898-5_1openalex-snapshot
Precise Analysis of String Expressions
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-25543-5_2openalex-snapshot
High-Level Abstractions for Simplifying Extended String Constraints in SMT
inferredcites →https://doi.org/10.1007/978-3-030-30806-3_8openalex-snapshot
On Solving Word Equations Using SAT
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-030-59152-6_18openalex-snapshot
A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type
inferredcites →https://doi.org/10.1007/978-3-030-64437-6_18openalex-snapshot
A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving
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-89051-3_17openalex-snapshot
Solving Not-Substring Constraint withFlat Abstraction
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-030-99524-9_24openalex-snapshot
cvc5: A Versatile and Industrial-Strength SMT Solver
inferredcites →https://doi.org/10.1007/978-3-031-13185-1_1openalex-snapshot
A Billion SMT Queries a Day (Invited Paper)
inferredcites →https://doi.org/10.1007/978-3-031-13185-1_16openalex-snapshot
SolCMC: Solidity Compiler’s Model Checker
inferredcites →https://doi.org/10.1007/978-3-031-13188-2_11openalex-snapshot
Even Faster Conflicts and Lazier Reductions for String Solvers
inferredcites →https://doi.org/10.1007/978-3-031-27481-7_23openalex-snapshot
Word Equations in Synergy with Regular Constraints
inferredcites →https://doi.org/10.1007/978-3-031-38499-8_17openalex-snapshot
Reasoning About Regular Properties: A Comparative Study
inferredcites →https://doi.org/10.1007/978-3-319-03077-7_2openalex-snapshot
PASS: String Solving with Parameterized Array and Interval Automaton
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-11194-0_12openalex-snapshot
Conpy: Concolic Execution Engine for Python Applications
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-21690-4_15openalex-snapshot
Automata-Based Model Counting for String Constraints
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-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-63390-9_24openalex-snapshot
Scaling Up DPLL(T) String Solvers Using Context-Dependent Simplification
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-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-39611-3_21openalex-snapshot
Word Equations with Length Constraints: What’s Decidable?
inferredcites →https://doi.org/10.1007/bf01457113openalex-snapshot
Die Isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden
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/j.jss.2023.111673openalex-snapshot
A symbolic algorithm for the case-split rule in solving word constraints with extensions
inferredcites →https://doi.org/10.1016/j.tcs.2022.12.009openalex-snapshot
Towards more efficient methods for solving regular-expression heavy string constraints
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.2010.38openalex-snapshot
A Symbolic Execution Framework for JavaScript
inferredcites →https://doi.org/10.1142/s0129054111009112openalex-snapshot
RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA
inferredcites →https://doi.org/10.1145/1217856.1217859openalex-snapshot
Solving SAT and SAT Modulo Theories
inferredcites →https://doi.org/10.1145/2103656.2103674openalex-snapshot
Symbolic finite state transducers
inferredcites →https://doi.org/10.1145/2377656.2377662openalex-snapshot
HAMPI
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/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/2898375.2898393openalex-snapshot
Efficient solving of string constraints for security analysis
inferredcites →https://doi.org/10.1145/301250.301443openalex-snapshot
Satisfiability of word equations with constants is in NEXPTIME
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/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/321356.321364openalex-snapshot
On Context-Free Languages
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/3385412openalex-snapshot
Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
inferredcites →https://doi.org/10.1145/3453483.3454066openalex-snapshot
Symbolic Boolean derivatives for efficiently solving extended regular expression constraints
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/635499.635502openalex-snapshot
Simulation-based minimization
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.8602994openalex-snapshot
Semantic-based Automated Reasoning for AWS Access Policies using SMT
inferredcites →https://doi.org/10.23919/fmcad.2018.8602997openalex-snapshot
Trau: SMT solver for string constraints
inferredcites →https://doi.org/10.3233/978-1-61499-495-4-26openalex-snapshot
Deconstructing Dynamic Symbolic Execution
inferredcites →https://doi.org/10.3233/fi-1997-3112openalex-snapshot
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
inferredcites →https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_30openalex-snapshot
Reductions for Strings and Regular Expressions Revisited
inferredcites →https://doi.org/10.4230/lipics.icalp.2021.130openalex-snapshot
The Theory of Concatenation over Finite Models
inferredcites →https://doi.org/10.5281/zenodo.8147919openalex-snapshot
Artifact for the OOPSLA'23 paper "Solving String Constraints with Lengths by Stabilization"

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-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-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-98682-6_7openalex-snapshot
Regex Decision Procedures in Extended RE#
inferred← citeshttps://doi.org/10.1007/978-3-032-09524-4_4openalex-snapshot
Word Equations with Length Constraints via Weak Arithmetics and Matrix Reachability Problems
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.1016/j.tcs.2025.115249openalex-snapshot
Incremental algorithms for solving regular expression intersection non-emptiness
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/iwqos65803.2025.11215174openalex-snapshot
LEOPARD: Accelerating Cloud-based Access Control Policy Verification Using Logical Encoding Optimization
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/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.1145/3832221openalex-snapshot
Solving String Split Constraints via Structural Relaxation
inferred← citeshttps://doi.org/10.51903/jtie.v3i2.184openalex-snapshot
A Hybrid Approach to Typo Correction in Indonesian Documents Using Levenshtein Distance
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.