On the public citation graph

A Constraint Solving Approach to Parikh Images of Regular Languages

https://doi.org/10.1145/3649855
0 signed · 35 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/11532231_25openalex-snapshot
On the Complexity of Equational Horn Clauses
inferredcites →https://doi.org/10.1007/3-540-18625-5openalex-snapshot
Foundations of Software Technology and Theoretical Computer Science
inferredcites →https://doi.org/10.1007/978-1-4612-1844-9openalex-snapshot
Automata and Computability
inferredcites →https://doi.org/10.1007/978-1-4612-2360-3openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-030-45093-9_59openalex-snapshot
Solving String Constraints with Approximate Parikh Image
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-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-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-319-08867-9_22openalex-snapshot
The nuXmv Symbolic Model Checker
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-63390-9_24openalex-snapshot
Scaling Up DPLL(T) String Solvers Using Context-Dependent Simplification
inferredcites →https://doi.org/10.1007/978-3-319-68670-7openalex-snapshot
String Analysis for Software Verification and Security
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_94openalex-snapshot
Counting in Trees for Free
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-540-89439-1_20openalex-snapshot
A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic
inferredcites →https://doi.org/10.1016/0020-0190(93)90029-9openalex-snapshot
Optimal speedup of Las Vegas algorithms
inferredcites →https://doi.org/10.1016/j.ic.2013.06.003openalex-snapshot
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
inferredcites →https://doi.org/10.1016/j.ipl.2011.03.019openalex-snapshot
Parikhʼs theorem: A simple and direct automaton construction
inferredcites →https://doi.org/10.1016/s0019-9958(80)90493-3openalex-snapshot
Generalized Parikh mappings and homomorphisms
inferredcites →https://doi.org/10.1109/lics.2015.39openalex-snapshot
Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
inferredcites →https://doi.org/10.1109/sp.2010.38openalex-snapshot
A Symbolic Execution 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/3062341.3062384openalex-snapshot
Flatten and conquer: a framework for efficient analysis of string constraints
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/3290362openalex-snapshot
Decision procedures for path feasibility of string-manipulating programs with complex operations
inferredcites →https://doi.org/10.1145/3453483.3454066openalex-snapshot
Symbolic Boolean derivatives for efficiently solving extended regular expression constraints
inferredcites →https://doi.org/10.23919/fmcad.2017.8102241openalex-snapshot
Z3str3: A String Solver with Theory-aware Heuristics
inferredcites →https://doi.org/10.5075/epfl-thesis-10546openalex-snapshot
Decision Procedures for Power Structures
inferredcites →https://doi.org/10.5281/zenodo.10796554openalex-snapshot
Reproduction Package for `A Constraint Solving Approach to Parikh Images of Regular Languages'
inferredcites →https://doi.org/10.5860/choice.47-3211openalex-snapshot
Handbook of practical logic and automated reasoning

What points at this work

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

inferred← backgroundhttps://doi.org/10.5281/zenodo.10796555zenodo-depositor-declared
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.1016/j.tcs.2025.115249openalex-snapshot
Incremental algorithms for solving regular expression intersection non-emptiness
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.