On the public citation graph

Formal Verification of the Heap Manager of an Operating System Using Separation Logic

0 signed · 54 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/11575467_5openalex-snapshot
Symbolic Execution with Separation Logic
inferredcites →https://doi.org/10.1007/11591191_33openalex-snapshot
A Unified Memory Model for Pointers
inferredcites →https://doi.org/10.1007/978-3-540-30124-0_21openalex-snapshot
Towards Mechanized Program Verification with Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-30482-1_10openalex-snapshot
Multi-prover Verification of C Programs
inferredcites →https://doi.org/10.1007/978-3-540-30538-5_9openalex-snapshot
A Decidable Fragment of Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-32275-7_26openalex-snapshot
A Verification Environment for Sequential Imperative Programs in Isabelle/HOL
inferredcites →https://doi.org/10.1016/j.ic.2004.10.007openalex-snapshot
Proving pointer programs in higher-order logic
inferredcites →https://doi.org/10.1016/j.scico.2004.01.003openalex-snapshot
Building certified libraries for PCC: dynamic storage allocation
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1109/sefm.2005.1openalex-snapshot
A case study of C source code verification: the Schorr-Waite algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11823230_13openalex-snapshot
Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic
inferred← citeshttps://doi.org/10.1007/11874683_12openalex-snapshot
Abstracting Allocation
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_29openalex-snapshot
Rely-Guarantee Reasoning About Concurrent Memory Management in Zephyr RTOS
inferred← citeshttps://doi.org/10.1007/978-3-030-35540-1_8openalex-snapshot
A Verified Specification of TLSF Memory Management Allocator Using State Monads
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_16openalex-snapshot
Hypermap Specification and Certified Linked Implementation Using Orbits
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_14openalex-snapshot
Scalable Specification and Reasoning: Challenges for Program Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_34openalex-snapshot
Enhancing Program Verification with Lemmas
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_5openalex-snapshot
Tutorial on Separation Logic (Invited Tutorial)
inferred← citeshttps://doi.org/10.1007/978-3-540-75670-5_10openalex-snapshot
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_27openalex-snapshot
An Approach to Formal Verification of Arithmetic Functions in Assembly
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_6openalex-snapshot
Separation Logic Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_24openalex-snapshot
Practical Tactics for Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_33openalex-snapshot
Developer-Oriented Correctness Proofs
inferred← citeshttps://doi.org/10.1007/s10817-008-9099-0openalex-snapshot
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
inferred← citeshttps://doi.org/10.1007/s10817-009-9120-2openalex-snapshot
Formal Verification of C Systems Code
inferred← citeshttps://doi.org/10.1007/s11334-013-0195-xopenalex-snapshot
On construction of a library of formally verified low-level arithmetic functions
inferred← citeshttps://doi.org/10.1007/s11390-007-9049-zopenalex-snapshot
Garbage Collector Verification for Proof-Carrying Code
inferred← citeshttps://doi.org/10.1007/s11432-017-9280-9openalex-snapshot
Formal modelling of list based dynamic memory allocators
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.041openalex-snapshot
Structured Types and Separation Logic
inferred← citeshttps://doi.org/10.1016/j.scico.2011.07.003openalex-snapshot
Certifying assembly with formal security proofs: The case of BBS
inferred← citeshttps://doi.org/10.1016/j.scico.2017.06.012openalex-snapshot
Formal proof of dynamic memory isolation based on MMU
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.041openalex-snapshot
Formal study of functional orbits in finite domains
inferred← citeshttps://doi.org/10.1109/iceccs.2019.00023openalex-snapshot
A Formally Verified Buddy Memory Allocation Model
inferred← citeshttps://doi.org/10.1109/tase.2016.28openalex-snapshot
Formal Proof of Dynamic Memory Isolation Based on MMU
inferred← citeshttps://doi.org/10.1109/tr.2021.3074709openalex-snapshot
Memory State Verification Based on Inductive and Deductive Reasoning
inferred← citeshttps://doi.org/10.1109/trustcom.2011.153openalex-snapshot
A Precise Memory Model for Operating System Code Verification
inferred← citeshttps://doi.org/10.11185/imt.4.304openalex-snapshot
A Certified Verifier for a Fragment of Separation Logic
inferred← citeshttps://doi.org/10.1145/1190215.1190234openalex-snapshot
Types, bytes, and separation logic
inferred← citeshttps://doi.org/10.1145/1190216.1190234openalex-snapshot
Types, bytes, and separation logic
inferred← citeshttps://doi.org/10.1145/1345169.1345175openalex-snapshot
Cooperative reasoning for automatic software verification
inferred← citeshttps://doi.org/10.1145/2245276.2231986openalex-snapshot
On construction of a library of formally verified low-level arithmetic functions
inferred← citeshttps://doi.org/10.1145/2429069.2429095openalex-snapshot
A theorem prover for Boolean BI
inferred← citeshttps://doi.org/10.1145/2429069.2429131openalex-snapshot
The ramifications of sharing in data structures
inferred← citeshttps://doi.org/10.1145/2480359.2429095openalex-snapshot
A theorem prover for Boolean BI
inferred← citeshttps://doi.org/10.1145/2480359.2429131openalex-snapshot
The ramifications of sharing in data structures
inferred← citeshttps://doi.org/10.1145/3092255.3092275openalex-snapshot
A refinement hierarchy for free list memory allocators
inferred← citeshttps://doi.org/10.1145/3127041.3127061openalex-snapshot
Using the coq theorem prover to verify complex data structure invariants
inferred← citeshttps://doi.org/10.1145/3156685.3092275openalex-snapshot
A refinement hierarchy for free list memory allocators
inferred← citeshttps://doi.org/10.1145/3381898.3397211openalex-snapshot
Verified sequential Malloc/Free
inferred← citeshttps://doi.org/10.1145/3408998openalex-snapshot
Separation logic for sequential programs (functional pearl)
inferred← citeshttps://doi.org/10.1145/3689773openalex-snapshot
StarMalloc: Verifying a Modern, Hardened Memory Allocator
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.53.788.785openalex-snapshot
Semi-automatic Proofs about Object Graphs in Separation Logic
inferred← citeshttps://doi.org/10.3233/978-1-60750-100-8-195openalex-snapshot
Mechanized semantics
inferred← citeshttps://doi.org/10.48550/arxiv.1204.6719openalex-snapshot
The Design and Algorithms of a Verification Condition Generator
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.