On the public citation graph

Searching entangled program spaces

https://doi.org/10.1145/3547622
0 signed · 55 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.1006/jsco.1995.1048openalex-snapshot
Automata for Reduction Properties Solving
inferredcites →https://doi.org/10.1007/3-540-49019-1_11openalex-snapshot
The Recognizability Problem for Tree Automata with Comparisons between Brothers
inferredcites →https://doi.org/10.1007/3-540-55210-3_181openalex-snapshot
Equality and disequality constraints on direct subterms in tree automata
inferredcites →https://doi.org/10.1007/3-540-59340-3_8openalex-snapshot
Rewriting and tree automata
inferredcites →https://doi.org/10.1007/3-540-62688-3_47openalex-snapshot
Inhabitation in typed lambda-calculi (a syntactic approach)
inferredcites →https://doi.org/10.1007/978-3-319-47166-2_21openalex-snapshot
A Long and Winding Road Towards Modular Synthesis
inferredcites →https://doi.org/10.1007/978-3-540-32033-3_26openalex-snapshot
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
inferredcites →https://doi.org/10.1007/978-3-642-16242-8_41openalex-snapshot
Bottom-Up Tree Automata with Term Constraints
inferredcites →https://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1007/s10817-004-6246-0openalex-snapshot
Reachability Analysis over Term Rewriting Systems
inferredcites →https://doi.org/10.1016/j.scico.2009.07.004openalex-snapshot
Silver: An extensible attribute grammar system
inferredcites →https://doi.org/10.1023/a:1025671410623openalex-snapshot
Programming by Demonstration Using Version Space Algebra
inferredcites →https://doi.org/10.1109/lics.2010.28openalex-snapshot
The Emptiness Problem for Tree Automata with Global Constraints
inferredcites →https://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/12130.12138openalex-snapshot
The complexity of optimization problems
inferredcites →https://doi.org/10.1145/1217856.1217859openalex-snapshot
Solving SAT and SAT Modulo Theories
inferredcites →https://doi.org/10.1145/1480881.1480915openalex-snapshot
Equality saturation
inferredcites →https://doi.org/10.1145/174652.174655openalex-snapshot
Equational inference, canonical proofs, and proof orderings
inferredcites →https://doi.org/10.1145/1926385.1926423openalex-snapshot
Automating string processing in spreadsheets using input-output examples
inferredcites →https://doi.org/10.1145/210376.197409openalex-snapshot
Attribute grammar paradigms—a high-level methodology in language implementation
inferredcites →https://doi.org/10.1145/2858965.2814310openalex-snapshot
FlashMeta: a framework for inductive program synthesis
inferredcites →https://doi.org/10.1145/3009837.3009851openalex-snapshot
Component-based synthesis for complex APIs
inferredcites →https://doi.org/10.1145/3133886openalex-snapshot
Synthesis of data completion scripts using finite tree automata
inferredcites →https://doi.org/10.1145/3133906openalex-snapshot
Restricting grammars with tree automata
inferredcites →https://doi.org/10.1145/3158151openalex-snapshot
Program synthesis using abstraction refinement
inferredcites →https://doi.org/10.1145/322186.322198openalex-snapshot
Fast Decision Procedures Based on Congruence Closure
inferredcites →https://doi.org/10.1145/3299711.3242760openalex-snapshot
Suggesting valid hole fits for typed-holes (experience report)
inferredcites →https://doi.org/10.1145/3371080openalex-snapshot
Program synthesis by type-guided abstraction refinement
inferredcites →https://doi.org/10.1145/3385412.3386001openalex-snapshot
Semantic code search via equational reasoning
inferredcites →https://doi.org/10.1145/3385412.3386012openalex-snapshot
Synthesizing structured CAD models with equality saturation and inverse transformations
inferredcites →https://doi.org/10.1145/3428273openalex-snapshot
Digging for fold: synthesis-aided API discovery for Haskell
inferredcites →https://doi.org/10.1145/3434304openalex-snapshot
egg: Fast and extensible equality saturation
inferredcites →https://doi.org/10.1145/3485496openalex-snapshot
Rewrite rule inference using equality saturation
inferredcites →https://doi.org/10.1145/3485530openalex-snapshot
LooPy: interactive program synthesis with control structures
inferredcites →https://doi.org/10.1145/3547622openalex-snapshot
Searching entangled program spaces
inferredcites →https://doi.org/10.1145/3815481openalex-snapshot
egg: Fast and Extensible Equality Saturation
inferredcites →https://doi.org/10.2168/lmcs-9(2:1)2013openalex-snapshot
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
inferredcites →https://doi.org/10.48550/arxiv.2107.12568openalex-snapshot
Version Space Algebras are Acyclic Tree Automata

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4578348openalex-extracted
Wasm-Mutate: Fast and Effective Binary Diversification for Webassembly
inferred← citeshttps://doi.org/10.1007/978-3-031-24841-2_2openalex-snapshot
Program Synthesis Using Example Propagation
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_15openalex-snapshot
Liquid Tree Automata
inferred← citeshttps://doi.org/10.1016/j.cose.2024.103731openalex-snapshot
Wasm-Mutate: Fast and effective binary diversification for WebAssembly
inferred← citeshttps://doi.org/10.1109/icst57152.2023.00035openalex-snapshot
Spectacular: Finding Laws from 25 Trillion Terms
inferred← citeshttps://doi.org/10.1145/3586032openalex-snapshot
Languages with Decidable Learning: A Meta-theorem
inferred← citeshttps://doi.org/10.1145/3591255openalex-snapshot
Trace-Guided Inductive Synthesis of Recursive Functional Programs
inferred← citeshttps://doi.org/10.1145/3632894openalex-snapshot
Efficient Bottom-Up Synthesis for Programs with Local Variables
inferred← citeshttps://doi.org/10.1145/3632904openalex-snapshot
API-Driven Program Synthesis for Testing Static Typing Implementations
inferred← citeshttps://doi.org/10.1145/3652561.3652565openalex-snapshot
ExEl: Building an Elaborator Using Extensible Constraints
inferred← citeshttps://doi.org/10.1145/3656453openalex-snapshot
Equivalence by Canonicalization for Synthesis-Backed Refactoring
inferred← citeshttps://doi.org/10.1145/3674636openalex-snapshot
Example-Based Reasoning about the Realizability of Polymorphic Programs
inferred← citeshttps://doi.org/10.1145/3704913openalex-snapshot
Dis/Equality Graphs
inferred← citeshttps://doi.org/10.1145/3729264openalex-snapshot
Programming by Navigation
inferred← citeshttps://doi.org/10.1145/3763171openalex-snapshot
Validating Soundness and Completeness in Pattern-Match Coverage Analyzers
inferred← citeshttps://doi.org/10.1145/3779209.3779535openalex-snapshot
Hole Refinements for Polymorphic Type-and-Example Driven Synthesis
showing the first 16 of 17 · page through all 17
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.