On the public citation graph

Automata modulo theories

https://doi.org/10.1145/3419404

0 signed · 59 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/978-3-030-17462-0_24openalex-snapshot

Symbolic Regex Matcher

inferredcites →https://doi.org/10.1007/978-3-030-25540-4_1openalex-snapshot

Symbolic Register Automata

inferredcites →https://doi.org/10.1007/978-3-319-08867-9_14openalex-snapshot

Symbolic Visibly Pushdown Automata

inferredcites →https://doi.org/10.1007/978-3-319-63121-9_8openalex-snapshot

A Generic Algorithm for Learning Symbolic Automata from Membership Queries

inferredcites →https://doi.org/10.1007/978-3-319-63387-9_3openalex-snapshot

The Power of Symbolic Automata and Transducers

inferredcites →https://doi.org/10.1007/978-3-319-96145-3_23openalex-snapshot

The Learnability of Symbolic Automata

inferredcites →https://doi.org/10.1007/978-3-662-54577-5_10openalex-snapshot

Learning Symbolic Automata

inferredcites →https://doi.org/10.1007/978-3-662-54577-5_30openalex-snapshot

Forward Bisimulations for Nondeterministic Symbolic Finite Automata

inferredcites →https://doi.org/10.1007/s10703-015-0233-4openalex-snapshot

Extended symbolic finite automata and transducers

inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot

Introduction to automata theory, languages, and computation

inferredcites →https://doi.org/10.1016/0304-3975(94)90242-9openalex-snapshot

Finite-memory automata

inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot

AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON

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.1109/32.588521openalex-snapshot

The model checker SPIN

inferredcites →https://doi.org/10.1109/icst.2010.15openalex-snapshot

Rex: Symbolic Regular Expression Explorer

inferredcites →https://doi.org/10.1109/sfcs.1981.29openalex-snapshot

On the equivalence and containment problems for unambiguous regular expressions, grammars, and automata

inferredcites →https://doi.org/10.1137/0216062openalex-snapshot

Three Partition Refinement Algorithms

inferredcites →https://doi.org/10.1145/1273496openalex-snapshot

Proceedings of the 24th international conference on Machine learning

inferredcites →https://doi.org/10.1145/1629175.1629180openalex-snapshot

ACM's annual report

inferredcites →https://doi.org/10.1145/1995376.1995394openalex-snapshot

Satisfiability modulo theories

inferredcites →https://doi.org/10.1145/2103656.2103674openalex-snapshot

Symbolic finite state transducers

inferredcites →https://doi.org/10.1145/2676726.2676986openalex-snapshot

Abstract Symbolic Automata

inferredcites →https://doi.org/10.1145/2791292openalex-snapshot

Fast

inferredcites →https://doi.org/10.1145/2976749.2978383openalex-snapshot

SFADiff

inferredcites →https://doi.org/10.1145/3062341.3062345openalex-snapshot

Automatic program inversion using symbolic transducers

inferredcites →https://doi.org/10.1145/3062341.3062362openalex-snapshot

Fusing effectful comprehensions

inferredcites →https://doi.org/10.1145/321466.321473openalex-snapshot

The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

inferredcites →https://doi.org/10.1145/503272.503291openalex-snapshot

Predicate abstraction for software verification

inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot

Gedanken-Experiments on Sequential Machines

inferredcites →https://doi.org/10.2168/lmcs-11(3:13)2015openalex-snapshot

Learning Regular Languages over Large Ordered Alphabets

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-030-99253-8_17openalex-snapshot

Temporal Stream Logic modulo Theories

inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_13openalex-snapshot

Reasoning About Data Trees Using CHCs

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-65941-6_9openalex-snapshot

The Hrewrite Library: A Term Rewriting Engine for Automatic Code Assembly

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-28404-4_18openalex-snapshot

Passive Learning of Symbolic Automata over Monotonic Algebras

inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_13openalex-snapshot

An $$L^{\#}$$ Based Algorithm for Active Learning of Minimal Separating Automata

inferred← citeshttps://doi.org/10.1007/978-981-99-8664-4_19openalex-snapshot

Deducing Matching Strings for Real-World Regular Expressions

inferred← citeshttps://doi.org/10.1007/s10270-024-01179-9openalex-snapshot

Modular language product lines: concept, tool and analysis

inferred← citeshttps://doi.org/10.11144/javeriana.upsy20.ccppopenalex-snapshot

Cambio cognitivo en problemas de proporcionalidad modelado bajo autómatas finitos: Estudio de casos

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/3497775.3503691openalex-snapshot

CertiStr: a certified string solver

inferred← citeshttps://doi.org/10.1145/3550355.3552444openalex-snapshot

Modular language product lines

inferred← citeshttps://doi.org/10.1145/3563293openalex-snapshot

Local Reasoning about Parameterized Reconfigurable Distributed Systems

inferred← citeshttps://doi.org/10.1145/3571230openalex-snapshot

A Robust Theory of Series Parallel Graphs

inferred← citeshttps://doi.org/10.1145/3632875openalex-snapshot

An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification

inferred← citeshttps://doi.org/10.1145/3632907openalex-snapshot

Parikh’s Theorem Made Symbolic

inferred← citeshttps://doi.org/10.1145/3636501.3636959openalex-snapshot

Lean Formalization of Extended Regular Expression Matching with Lookarounds

inferred← citeshttps://doi.org/10.1145/3640310.3674082openalex-snapshot

Product Lines of Graphical Modelling Languages

inferred← citeshttps://doi.org/10.1145/3702975openalex-snapshot

Adaptive Modelling Languages: Abstract Syntax and Model Migration

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/3704838openalex-snapshot

Symbolic Automata: Omega-Regularity Modulo Theories

inferred← citeshttps://doi.org/10.1145/3704888openalex-snapshot

Translation of Temporal Logic for Efficient Infinite-State Reactive Synthesis

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/3808349openalex-snapshot

EREQ: Regular Expressions with Quantifiers and Incremental Quantifier Elimination

inferred← citeshttps://doi.org/10.1145/3849378openalex-snapshot

Symbolic Derivatives: Regularity and �-Regularity Modulo Theories

inferred← citeshttps://doi.org/10.1587/transinf.2024fcp0008openalex-snapshot

Bilaterally Colored Finite Automata and Bilaterally Colored Regular Expressions

inferred← citeshttps://doi.org/10.2139/ssrn.5117439openalex-snapshot

Model Checking For Multi-Agent Systems Modeled By Epistemic Process Calculus

inferred← citeshttps://doi.org/10.29007/fgz5openalex-snapshot

On Symbolic Derivatives and Transition Regexes

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.