On the public citation graph
Structuring the synthesis of heap-manipulating programs
0 signed · 124 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/11575467_5openalex-snapshot
Symbolic Execution with Separation Logic
inferredcites →https://doi.org/10.1007/11804192_6openalex-snapshot
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
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-1-84882-736-3_7openalex-snapshot
Separation Logic and Concurrency
inferredcites →https://doi.org/10.1007/978-3-030-02768-1_13openalex-snapshot
Automated Synthesis of Functional Programs with Auxiliary Functions
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_47openalex-snapshot
Automating Separation Logic with Trees and Data
inferredcites →https://doi.org/10.1007/978-3-319-11737-9_18openalex-snapshot
A Resource-Based Logic for Termination and Non-termination Proofs
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_12openalex-snapshot
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT
inferredcites →https://doi.org/10.1007/978-3-319-66706-5_18openalex-snapshot
Synthesizing Imperative Programs from Examples Guided by Static Analysis
inferredcites →https://doi.org/10.1007/978-3-319-71237-6_10openalex-snapshot
Bringing Order to the Separation Logic Jungle
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_14openalex-snapshot
Logical Reasoning for Disjoint Permissions
inferredcites →https://doi.org/10.1007/978-3-540-69738-1_18openalex-snapshot
Automated Verification of Shape and Size Properties Via Separation Logic
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_24openalex-snapshot
Practical Tactics for Separation Logic
inferredcites →https://doi.org/10.1007/978-3-642-19718-5_1openalex-snapshot
Verified Software Toolchain
inferredcites →https://doi.org/10.1007/978-3-642-20398-5_33openalex-snapshot
Infer: An Automatic Program Verifier for Memory Safety of C Programs
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-22110-1_15openalex-snapshot
SLAyer: Memory Safety for Systems-Level Code
inferredcites →https://doi.org/10.1007/978-3-642-33386-6_14openalex-snapshot
Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data
inferredcites →https://doi.org/10.1007/978-3-642-35182-2_25openalex-snapshot
A Generic Cyclic Theorem Prover
inferredcites →https://doi.org/10.1007/978-3-642-35873-9_8openalex-snapshot
Reductions for Synthesis Procedures
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_67openalex-snapshot
Recursive Program Synthesis
inferredcites →https://doi.org/10.1007/978-3-662-49122-5_2openalex-snapshot
Viper: A Verification Infrastructure for Permission-Based Reasoning
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_18openalex-snapshot
Scaling Enumerative Program Synthesis via Divide and Conquer
inferredcites →https://doi.org/10.1007/s001650050057openalex-snapshot
Hoare Logic and Auxiliary Variables
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.1016/j.tcs.2009.07.041openalex-snapshot
Focusing and polarization in linear, intuitionistic, and classical logics
inferredcites →https://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
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/1190215.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferredcites →https://doi.org/10.1145/1190216.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferredcites →https://doi.org/10.1145/1328438.1328453openalex-snapshot
Cyclic proofs of program termination in separation logic
inferredcites →https://doi.org/10.1145/1498926.1498929openalex-snapshot
Separation and information hiding
inferredcites →https://doi.org/10.1145/1706299.1706331openalex-snapshot
Structuring the verification of heap-manipulating programs
inferredcites →https://doi.org/10.1145/1706299.1706337openalex-snapshot
From program verification to program synthesis
inferredcites →https://doi.org/10.1145/1806596.1806632openalex-snapshot
Complete functional synthesis
inferredcites →https://doi.org/10.1145/1863543.1863590openalex-snapshot
Program verification through characteristic formulae
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.1993506openalex-snapshot
Synthesis of loop-free programs
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/2034574.2034798openalex-snapshot
How to make ad hoc proof automation less ad hoc
inferredcites →https://doi.org/10.1145/2034773.2034798openalex-snapshot
How to make ad hoc proof automation less ad hoc
inferredcites →https://doi.org/10.1145/2048147.2048152openalex-snapshot
A HIP and SLEEK verification system
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/2384616.2384646openalex-snapshot
Program extrapolation with jennisys
inferredcites →https://doi.org/10.1145/2429069.2429131openalex-snapshot
The ramifications of sharing in 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.2594340openalex-snapshot
A lightweight symbolic virtual machine for solver-aided host languages
inferredcites →https://doi.org/10.1145/2737924.2737977openalex-snapshot
Synthesizing data structure transformations from input-output examples
inferredcites →https://doi.org/10.1145/2737924.2738007openalex-snapshot
Type-and-example-directed program synthesis
inferredcites →https://doi.org/10.1145/2814270.2814310openalex-snapshot
FlashMeta: a framework for inductive program synthesis
inferredcites →https://doi.org/10.1145/2815400.2815402openalex-snapshot
Using Crash Hoare logic for certifying the FSCQ file system
inferredcites →https://doi.org/10.1145/2837614.2837629openalex-snapshot
Example-directed synthesis: a type-theoretic interpretation
inferredcites →https://doi.org/10.1145/2908080.2908093openalex-snapshot
Program synthesis from polymorphic refinement types
inferredcites →https://doi.org/10.1145/2983990.2983993openalex-snapshot
Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations
inferredcites →https://doi.org/10.1145/3018610.3018623openalex-snapshot
Automatic cyclic termination proofs for recursive procedures in separation logic
inferredcites →https://doi.org/10.1145/3062341.3062351openalex-snapshot
Component-based synthesis of table consolidation and transformation tasks from examples
inferredcites →https://doi.org/10.1145/3133887openalex-snapshot
SQLizer: query synthesis from natural language
inferredcites →https://doi.org/10.1145/3133889openalex-snapshot
Natural synthesis of provably-correct data-structure manipulations
inferredcites →https://doi.org/10.1145/3136000.3136004openalex-snapshot
ScalaSMT: satisfiability modulo theory in Scala (tool paper)
inferredcites →https://doi.org/10.1145/3180155.3180250openalex-snapshot
Static automated program repair for heap properties
inferredcites →https://doi.org/10.1145/3236024.3236034openalex-snapshot
Syntax-guided synthesis of Datalog programs
inferredcites →https://doi.org/10.1145/3290385openalex-snapshot
Structuring the synthesis of heap-manipulating programs
inferredcites →https://doi.org/10.1145/357084.357090openalex-snapshot
A Deductive Approach to Program Synthesis
inferredcites →https://doi.org/10.1145/360204.360210openalex-snapshot
The size-change principle for program termination
inferredcites →https://doi.org/10.4230/lipics.snapl.2017.15openalex-snapshot
Search for Program Structure
inferredcites →https://doi.org/10.48550/arxiv.1703.05698openalex-snapshot
Neural Sketch Learning for Conditional Program Generation
inferredcites →https://doi.org/10.5555/2486788.2487050openalex-snapshot
Developing verified programs with dafny
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-25543-5_13openalex-snapshot
SecCSL: Security Concurrent Separation Logic
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-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-42441-0_8openalex-snapshot
Genetic Algorithm for Program Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_10openalex-snapshot
Synthesis of Recursive Programs in Saturation
inferred← citeshttps://doi.org/10.1007/978-3-031-91121-7_10openalex-snapshot
Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_1openalex-snapshot
Verifying Tree-Manipulating Programs via CHCs
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_11openalex-snapshot
Specification-Driven Generation of Summaries for Symbolic Execution
inferred← citeshttps://doi.org/10.1007/s10703-021-00387-zopenalex-snapshot
Debug-localize-repair: a symbiotic construction for heap manipulations
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.cola.2024.101275openalex-snapshot
Towards a Dynabook for verified VM construction
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/access.2021.3079351openalex-snapshot
Neural-Guided Inductive Synthesis of Functional Programs on List Manipulation by Offline Supervised Learning
inferred← citeshttps://doi.org/10.1109/saner56733.2023.00112openalex-snapshot
Deep Reinforcement Learning Guided Decision Tree Learning For Program Synthesis
inferred← citeshttps://doi.org/10.1109/tse.2021.3124323openalex-snapshot
Trident: Controlling Side Effects in Automated Program Repair
inferred← citeshttps://doi.org/10.1145/3365137.3365401openalex-snapshot
Trials and Tribulations in Synthesizing Operating Systems
inferred← citeshttps://doi.org/10.1145/3385412.3386027openalex-snapshot
Reconciling enumerative and deductive program synthesis
inferred← citeshttps://doi.org/10.1145/3414080.3414094openalex-snapshot
Proof-Carrying Plans: a Resource Logic for AI Planning
inferred← citeshttps://doi.org/10.1145/3428227openalex-snapshot
Programming with a read-eval-synth loop
inferred← citeshttps://doi.org/10.1145/3428245openalex-snapshot
Dataflow-based pruning for speeding up superoptimization
inferred← citeshttps://doi.org/10.1145/3453483.3454048openalex-snapshot
RbSyn: type- and effect-guided program synthesis
inferred← citeshttps://doi.org/10.1145/3473589openalex-snapshot
Certifying the synthesis of heap-manipulating programs
inferred← citeshttps://doi.org/10.1145/3546942openalex-snapshot
Hippodrome : Data Race Repair Using Static Analysis Summaries
inferred← citeshttps://doi.org/10.1145/3563310openalex-snapshot
Specification-guided component-based synthesis from effectful libraries
inferred← citeshttps://doi.org/10.1145/3563332openalex-snapshot
Satisfiability modulo fuzzing: a synergistic combination of SMT solving and fuzzing
inferred← citeshttps://doi.org/10.1145/3563835.3567658openalex-snapshot
Derivations with Holes for Concept-Based Program Synthesis
inferred← citeshttps://doi.org/10.1145/3563943openalex-snapshot
Towards Porting Operating Systems with Program Synthesis
inferred← citeshttps://doi.org/10.1145/3591278openalex-snapshot
Leveraging Rust Types for Program Synthesis
inferred← citeshttps://doi.org/10.1145/3622800openalex-snapshot
Synthesizing Efficient Memoization Algorithms
inferred← citeshttps://doi.org/10.1145/3622874openalex-snapshot
Explainable Program Synthesis by Localizing Specifications
inferred← citeshttps://doi.org/10.1145/3632913openalex-snapshot
Enhanced Enumeration Techniques for Syntax-Guided Synthesis of Bit-Vector Manipulations
inferred← citeshttps://doi.org/10.1145/3643737openalex-snapshot
ProveNFix: Temporal Property-Guided Program Repair
inferred← citeshttps://doi.org/10.1145/3678000openalex-snapshot
Proceedings of the 9th ACM SIGPLAN International Workshop on Type-Driven Development
inferred← citeshttps://doi.org/10.1145/3704903openalex-snapshot
Generically Automating Separation Logic by Functors, Homomorphisms, and Modules
inferred← citeshttps://doi.org/10.1145/3720420openalex-snapshot
Inductive Synthesis of Inductive Heap Predicates
inferred← citeshttps://doi.org/10.1145/3720448openalex-snapshot
Metamorph: Synthesizing Large Objects from Dafny Specifications
inferred← citeshttps://doi.org/10.1145/3733716openalex-snapshot
Automated Abstract Transformer Synthesis for Reduced Product Domains
inferred← citeshttps://doi.org/10.1145/3763158openalex-snapshot
We’ve Got You Covered: Type-Guided Repair of Incomplete Input Generators
inferred← citeshttps://doi.org/10.1145/3832783.3834410openalex-snapshot
Verifier-in-the-Loop LLM Solving of Heap Constraints for Concolic Execution
inferred← citeshttps://doi.org/10.1145/3832783.3837430openalex-snapshot
Smart Contract Synthesis via Multi-modal Specifications
inferred← citeshttps://doi.org/10.48550/arxiv.2008.12118openalex-snapshot
M3: Semantic API Migrations
showing the first 46 of 47 · page through all 47
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.