On the public citation graph
Synthesizing abstract transformers
0 signed · 51 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/11513988_5openalex-snapshot
Predicate Abstraction via Symbolic Decision Procedures
inferredcites →https://doi.org/10.1007/11817963_39openalex-snapshot
SMT Techniques for Fast Predicate Abstraction
inferredcites →https://doi.org/10.1007/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferredcites →https://doi.org/10.1007/978-3-319-63387-9_12openalex-snapshot
Learning a Static Analyzer from Data
inferredcites →https://doi.org/10.1007/978-3-319-96145-3_22openalex-snapshot
Learning Abstractions for Program Synthesis
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_21openalex-snapshot
Symbolic Implementation of the Best Transformer
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_10openalex-snapshot
Low-Level Library Analysis and Summarization
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_17openalex-snapshot
A Method for Symbolic Computation of Abstract Operations
inferredcites →https://doi.org/10.1007/978-3-642-33125-1_10openalex-snapshot
Bilateral Algorithms for Symbolic Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-35182-2_9openalex-snapshot
Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code
inferredcites →https://doi.org/10.1007/978-3-642-54807-9_12openalex-snapshot
String Analysis for Dynamic Field Access
inferredcites →https://doi.org/10.1007/978-3-662-49122-5_1openalex-snapshot
Automating Abstract Interpretation
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_3openalex-snapshot
Combining String Abstract Domains for JavaScript Analysis: An Evaluation
inferredcites →https://doi.org/10.1016/j.entcs.2015.02.003openalex-snapshot
PostHat and All That: Automating Abstract Interpretation
inferredcites →https://doi.org/10.1109/fmcad.2009.5351147openalex-snapshot
Software model checking via large-block encoding
inferredcites →https://doi.org/10.1109/icse43902.2021.00079openalex-snapshot
Data-Driven Synthesis of Provably Sound Side Channel Analyses
inferredcites →https://doi.org/10.1109/sp.2016.14openalex-snapshot
Back in Black: Towards Formal, Black Box Analysis of Sanitizers and Filters
inferredcites →https://doi.org/10.1145/1250734.1250750openalex-snapshot
Automatic inference of optimizer flow functions from semantic meanings
inferredcites →https://doi.org/10.1145/3293882.3330554openalex-snapshot
Deferred concretization in symbolic execution via fuzzing
inferredcites →https://doi.org/10.1145/3385412.3385967openalex-snapshot
Data-driven inference of representation invariants
inferredcites →https://doi.org/10.1145/3453483.3454104openalex-snapshot
Specification synthesis with constrained Horn clauses
inferredcites →https://doi.org/10.1145/3485481openalex-snapshot
Synthesizing contracts correct modulo a test generator
inferredcites →https://doi.org/10.1145/3533767.3534381openalex-snapshot
Almost correct invariants: synthesizing inductive invariants by fuzzing proofs
inferredcites →https://doi.org/10.1145/3563332openalex-snapshot
Satisfiability modulo fuzzing: a synergistic combination of SMT solving and fuzzing
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-613openalex-snapshot
MaxSAT, Hard and Soft Constraints
inferredcites →https://doi.org/10.48550/arxiv.2105.00493openalex-snapshot
Synthesizing Abstract Transformers
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-65627-9_24openalex-snapshot
Interactive Theorem Proving Modulo Fuzzing
inferred← citeshttps://doi.org/10.1007/978-3-031-74776-2_6openalex-snapshot
Synthesizing Abstract Transformers for Reduced-Product Domains
inferred← citeshttps://doi.org/10.1007/978-3-032-07106-4_7openalex-snapshot
Comparing the Precision of Abstract Operators in the eBPF Verifier Using Differential Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-032-40374-2_3openalex-snapshot
Rocq Bottom: Beyond Soundness with Precise Reasoning about Analysis Precision
inferred← citeshttps://doi.org/10.1007/978-981-95-3585-9_10openalex-snapshot
Specification Inference Modulo Oracles for Database-Backed Web Applications
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00101openalex-snapshot
An Integrated Program Analysis Framework for Graduate Courses in Programming Languages and Software Engineering
inferred← citeshttps://doi.org/10.1109/icse-seet58685.2023.00021openalex-snapshot
A Theorem Proving Approach to Programming Language Semantics
inferred← citeshttps://doi.org/10.1145/3563768.3565544openalex-snapshot
Program Synthesis for Artifacts beyond Programs
inferred← citeshttps://doi.org/10.1145/3649837openalex-snapshot
Hydra: Generalizing Peephole Optimizations with Program Synthesis
inferred← citeshttps://doi.org/10.1145/3720470openalex-snapshot
LOUD: Synthesizing Strongest and Weakest Specifications
inferred← citeshttps://doi.org/10.1145/3720509openalex-snapshot
Automated Verification of Soundness of DNN Certifiers
inferred← citeshttps://doi.org/10.1145/3728905openalex-snapshot
Program Analysis Combining Generalized Bit-Level and Word-Level Abstractions
inferred← citeshttps://doi.org/10.1145/3729309openalex-snapshot
First-Class Verification Dialects for MLIR
inferred← citeshttps://doi.org/10.1145/3733716openalex-snapshot
Automated Abstract Transformer Synthesis for Reduced Product Domains
inferred← citeshttps://doi.org/10.1145/3748355.3748361openalex-snapshot
Automatic Synthesis of Abstract Operators for eBPF
inferred← citeshttps://doi.org/10.1145/3763088openalex-snapshot
Synthesizing Sound and Precise Abstract Transformers for Nonlinear Hyperbolic PDE Solvers
inferred← citeshttps://doi.org/10.1145/3763090openalex-snapshot
Memory-Safety Verification of Open Programs with Angelic Assumptions
inferred← citeshttps://doi.org/10.1145/3776722openalex-snapshot
Nice to Meet You: Synthesizing Practical MLIR Abstract Transformers
inferred← citeshttps://doi.org/10.1145/3798216openalex-snapshot
Mechanically Translating Iterative Dataflow Analysis to Algebraic Program Analysis
inferred← citeshttps://doi.org/10.1145/3821419openalex-snapshot
Incorrectness Proofs with Underapproximation Invariants
inferred← citeshttps://doi.org/10.1145/3839451openalex-snapshot
LLM-Assisted Unsatisfiability Proofs for Satisfiability Modulo Theories, Oracles, and Natural Language
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.