On the public citation graph
Natural synthesis of provably-correct data-structure manipulations
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.
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/3-540-44802-0_1openalex-snapshot
Local Reasoning about Programs that Alter Data Structures
inferredcites →https://doi.org/10.1007/978-3-540-45099-3_15openalex-snapshot
TVLA: A System for Implementing Static Analyses
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_2openalex-snapshot
VCC: A Practical System for Verifying Concurrent C
inferredcites →https://doi.org/10.1007/978-3-642-20398-5_4openalex-snapshot
VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java
inferredcites →https://doi.org/10.1007/978-3-642-23702-7_23openalex-snapshot
Satisfiability Modulo Recursive Programs
inferredcites →https://doi.org/10.1007/978-3-642-38574-2_2openalex-snapshot
The Tree Width of Separation Logic with Recursive Definitions
inferredcites →https://doi.org/10.1016/j.scico.2010.07.004openalex-snapshot
Automated verification of shape, size and bag properties via user-defined predicates in separation logic
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1145/1168857.1168907openalex-snapshot
Combinatorial sketching for finite programs
inferredcites →https://doi.org/10.1145/1375581.1375598openalex-snapshot
Deriving linearizable fine-grained concurrent objects
inferredcites →https://doi.org/10.1145/1706299.1706337openalex-snapshot
From program verification to program synthesis
inferredcites →https://doi.org/10.1145/1925844.1926455openalex-snapshot
Decidable logics combining heap structures and data
inferredcites →https://doi.org/10.1145/1926385.1926455openalex-snapshot
Decidable logics combining heap structures and data
inferredcites →https://doi.org/10.1145/1993316.1993526openalex-snapshot
Mostly-automated verification of low-level programs in computational separation logic
inferredcites →https://doi.org/10.1145/1993498.1993504openalex-snapshot
Data representation synthesis
inferredcites →https://doi.org/10.1145/1993498.1993526openalex-snapshot
Mostly-automated verification of low-level programs in computational separation logic
inferredcites →https://doi.org/10.1145/2025113.2025153openalex-snapshot
Synthesizing data structure manipulations from storyboards
inferredcites →https://doi.org/10.1145/2103621.2103673openalex-snapshot
Recursive proofs for inductive tree data-structures
inferredcites →https://doi.org/10.1145/2103656.2103673openalex-snapshot
Recursive proofs for inductive tree data-structures
inferredcites →https://doi.org/10.1145/2491956.2462169openalex-snapshot
Natural proofs for structure, data, and separation
inferredcites →https://doi.org/10.1145/2509136.2509555openalex-snapshot
Synthesis modulo recursive functions
inferredcites →https://doi.org/10.1145/2594291.2594325openalex-snapshot
Natural proofs for data structure manipulation in C using separation logic
inferredcites →https://doi.org/10.1145/2594291.2594340openalex-snapshot
A lightweight symbolic virtual machine for solver-aided host languages
inferredcites →https://doi.org/10.1145/2660193.2660211openalex-snapshot
Natural proofs for asynchronous programs using almost-synchronous reductions
inferredcites →https://doi.org/10.1145/2666356.2594325openalex-snapshot
Natural proofs for data structure manipulation in C using separation logic
inferredcites →https://doi.org/10.1145/2737924.2737977openalex-snapshot
Synthesizing data structure transformations from input-output examples
inferredcites →https://doi.org/10.1145/2908080.2908093openalex-snapshot
Program synthesis from polymorphic refinement types
inferredcites →https://doi.org/10.1145/347324.348031openalex-snapshot
Putting static analysis to work for verification
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-44914-8_6openalex-snapshot
Concise Read-Only Specifications for Better Synthesis of Programs with Pointers
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_32openalex-snapshot
Decidable Synthesis of Programs with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_17openalex-snapshot
Automated Repair of Heap-Manipulating Programs Using Deductive Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_5openalex-snapshot
Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities
inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_10openalex-snapshot
SR-SFLL: Structurally Robust Stripped Functionality Logic Locking
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.1007/s10703-017-0269-8openalex-snapshot
An empirical study of adaptive concretization for parallel program synthesis
inferred← citeshttps://doi.org/10.1007/s10703-023-00420-3openalex-snapshot
Symbolic encoding of LL(1) parsing and its applications
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102536openalex-snapshot
A family of multi-concept program synthesisers in Alloy⁎
inferred← citeshttps://doi.org/10.1109/tse.2021.3124323openalex-snapshot
Trident: Controlling Side Effects in Automated Program Repair
inferred← citeshttps://doi.org/10.1145/3290385openalex-snapshot
Structuring the synthesis of heap-manipulating programs
inferred← citeshttps://doi.org/10.1145/3314221.3314602openalex-snapshot
Resource-guided program synthesis
inferred← citeshttps://doi.org/10.1145/3533767.3534381openalex-snapshot
Almost correct invariants: synthesizing inductive invariants by fuzzing proofs
inferred← citeshttps://doi.org/10.1145/3563308openalex-snapshot
Synthesis-powered optimization of smart contracts via data type refactoring
inferred← citeshttps://doi.org/10.1145/3563338openalex-snapshot
Compilation of dynamic sparse tensor algebra
inferred← citeshttps://doi.org/10.1145/3632870openalex-snapshot
Semantic Code Refactoring for Abstract Data Types
inferred← citeshttps://doi.org/10.1145/3648440openalex-snapshot
Decomposition-based Synthesis for Applying Divide-and-Conquer-like Algorithmic Paradigms
inferred← citeshttps://doi.org/10.1145/3763090openalex-snapshot
Memory-Safety Verification of Open Programs with Angelic Assumptions
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
inferred← citeshttps://doi.org/10.48550/arxiv.1808.02066openalex-snapshot
The Internals of the Data Calculator
inferred← citeshttps://doi.org/10.48550/arxiv.2001.10723openalex-snapshot
Concise Read-Only Specifications for Better Synthesis of Programs with Pointers -- Extended Version
inferred← citeshttps://doi.org/10.48550/arxiv.2112.01394openalex-snapshot
Dynamic Sparse Tensor Algebra Compilation
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.