On the public citation graph

Verifying a garbage collection algorithm

https://doi.org/10.1007/bfb0055139
0 signed · 36 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/3-540-55602-8_217openalex-snapshot
PVS: A prototype verification system
inferredcites →https://doi.org/10.1007/3-540-57826-9_144openalex-snapshot
Predicates, temporal logic, and simulations
inferredcites →https://doi.org/10.1007/3-540-61474-5openalex-snapshot
Computer Aided Verification
inferredcites →https://doi.org/10.1007/3-540-61474-5_103openalex-snapshot
Verifying the safety of a practical concurrent garbage collector
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot
Parallel Program Design
inferredcites →https://doi.org/10.1007/bf01211305openalex-snapshot
A mechanically verified incremental garbage collector
inferredcites →https://doi.org/10.1007/bfb0098007openalex-snapshot
Mechanical verification of a garbage collector
inferredcites →https://doi.org/10.1016/0304-3975(91)90041-yopenalex-snapshot
Completing the temporal picture
inferredcites →https://doi.org/10.1093/oso/9780198538332.003.0002openalex-snapshot
Introducing Labelled Deductive Systems
inferredcites →https://doi.org/10.1145/177492.177726openalex-snapshot
The temporal logic of actions
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/359642.359655openalex-snapshot
On-the-fly garbage collection
inferredcites →https://doi.org/10.1145/579.587openalex-snapshot
Algorithms for on-the-fly garbage collection

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44464-5_13openalex-snapshot
Reflecting BDDs in Coq
inferred← citeshttps://doi.org/10.1007/3-540-44557-9_9openalex-snapshot
Memory Management: An Abstract Formulation of Incremental Tracing
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_20openalex-snapshot
Total-Correctness Refinement for Sequential Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-1-4419-5998-0_8openalex-snapshot
Verifying Concurrent Protocols Using Refinements
inferred← citeshttps://doi.org/10.1007/978-3-030-31514-6_6openalex-snapshot
A Refinement Proof for a Garbage Collector
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_10openalex-snapshot
What Is a Garbage Collector? An Exercise in Compositional Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-15057-9_10openalex-snapshot
Reusable Verification of a Copying Collector
inferred← citeshttps://doi.org/10.1007/bfb0055125openalex-snapshot
Theorem Proving in Higher Order Logics
inferred← citeshttps://doi.org/10.1007/pl00013315openalex-snapshot
A construction of distributed reference counting
inferred← citeshttps://doi.org/10.1007/s10817-012-9258-1openalex-snapshot
Specification and Verification of Concurrent Programs Through Refinements
inferred← citeshttps://doi.org/10.1007/s10817-025-09721-0openalex-snapshot
A Mechanically Verified Garbage Collector for OCaml
inferred← citeshttps://doi.org/10.1007/s11390-007-9049-zopenalex-snapshot
Garbage Collector Verification for Proof-Carrying Code
inferred← citeshttps://doi.org/10.1016/j.scico.2006.10.001openalex-snapshot
Lock-free parallel and concurrent garbage collection by mark&sweep
inferred← citeshttps://doi.org/10.1023/a:1024746015231openalex-snapshot
A Mechanized Proof Environment for the Convenient Computations Proof Method
inferred← citeshttps://doi.org/10.1109/tase.2007.28openalex-snapshot
Foundational Typed Assembly Language with Certified Garbage Collection
inferred← citeshttps://doi.org/10.1145/1108970.1108976openalex-snapshot
Birrell's distributed reference listing revisited
inferred← citeshttps://doi.org/10.1145/1133255.1134022openalex-snapshot
Correctness-preserving derivation of concurrent garbage collection algorithms
inferred← citeshttps://doi.org/10.1145/1250734.1250787openalex-snapshot
CGCExplorer
inferred← citeshttps://doi.org/10.1145/1250734.1250788openalex-snapshot
A general framework for certifying garbage collectors and their mutators
inferred← citeshttps://doi.org/10.1145/1377492.1377499openalex-snapshot
Local reasoning about a copying garbage collector
inferred← citeshttps://doi.org/10.1145/1480881.1480935openalex-snapshot
Automated verification of practical garbage collectors
inferred← citeshttps://doi.org/10.2168/lmcs-6(3:6)2010openalex-snapshot
Automated Verification of Practical Garbage Collectors
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.