On the public citation graph
A mechanically verified incremental garbage collector
0 signed · 59 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/bf01788566openalex-snapshot
An incremental garbage collection algorithm for multi-mutator systems
inferredcites →https://doi.org/10.1007/bf03180564openalex-snapshot
A verification system for concurrent programs based on the Boyer-Moore prover
inferredcites →https://doi.org/10.1016/0020-0190(87)90135-9openalex-snapshot
“Algorithms for on-the-fly garbage collection” revisited
inferredcites →https://doi.org/10.1016/0167-6423(84)90003-0openalex-snapshot
Adequate proof principles for invariance and liveness properties of concurrent programs
inferredcites →https://doi.org/10.1016/0378-4754(83)90038-1openalex-snapshot
The correctness problem in computer science
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/b978-0-12-450010-5.50007-4openalex-snapshot
Functional Instantiation in First-Order Logic
inferredcites →https://doi.org/10.1145/579.587openalex-snapshot
Algorithms for on-the-fly garbage collection
inferredcites →https://doi.org/10.1145/75199.75238openalex-snapshot
Developing formally verified Ada programs
inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,
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-44557-9_9openalex-snapshot
Memory Management: An Abstract Formulation of Incremental Tracing
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_57openalex-snapshot
Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_16openalex-snapshot
Experience with Predicate Abstraction
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-319-66107-0_28openalex-snapshot
A Verified Generational Garbage Collector for CakeML
inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_20openalex-snapshot
Formal Derivation of Concurrent Garbage Collectors
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/978-981-15-6401-7_38-1openalex-snapshot
Microprocessor Assurance and the Role of Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-981-97-9314-3_38openalex-snapshot
Microprocessor Assurance and the Role of Theorem Proving
inferred← citeshttps://doi.org/10.1007/bf03180564openalex-snapshot
A verification system for concurrent programs based on the Boyer-Moore prover
inferred← citeshttps://doi.org/10.1007/bfb0014321openalex-snapshot
Preprocessing for invariant validation
inferred← citeshttps://doi.org/10.1007/bfb0054187openalex-snapshot
Automated verification of Szymanski's algorithm
inferred← citeshttps://doi.org/10.1007/bfb0055139openalex-snapshot
Verifying a garbage collection algorithm
inferred← citeshttps://doi.org/10.1007/bfb0055652openalex-snapshot
Checking verifications of protocols and distributed systems by computer
inferred← citeshttps://doi.org/10.1007/bfb0098007openalex-snapshot
Mechanical verification of a garbage collector
inferred← citeshttps://doi.org/10.1007/pl00013315openalex-snapshot
A construction of distributed reference counting
inferred← citeshttps://doi.org/10.1007/s00236-013-0178-2openalex-snapshot
Verifying a simplification of mutual exclusion by Lycklama–Hadzilacos
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-018-9487-zopenalex-snapshot
A Verified Generational Garbage Collector for CakeML
inferred← citeshttps://doi.org/10.1007/s10817-025-09721-0openalex-snapshot
A Mechanically Verified Garbage Collector for OCaml
inferred← citeshttps://doi.org/10.1007/s10992-011-9195-1openalex-snapshot
Fine-grained Concurrency with Separation Logic
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.1016/s0304-3975(99)00217-0openalex-snapshot
Simplification of boolean verification conditions
inferred← citeshttps://doi.org/10.1023/a:1006262609127openalex-snapshot
A Mechanization of Unity in PC-NQTHM-92
inferred← citeshttps://doi.org/10.1109/acsd.2005.29openalex-snapshot
On Monitoring Concurrent Systems with TLA: An Example
inferred← citeshttps://doi.org/10.1109/lics.2001.932482openalex-snapshot
Successive approximation of abstract transition relations
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/1133981.1134022openalex-snapshot
Correctness-preserving derivation of concurrent garbage collection algorithms
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/1273442.1250788openalex-snapshot
A general framework for certifying garbage collectors and their mutators
inferred← citeshttps://doi.org/10.1145/1296907.1296924openalex-snapshot
A correct and useful incremental copying garbage collector
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.1145/1594834.1480935openalex-snapshot
Automated verification of practical garbage collectors
inferred← citeshttps://doi.org/10.1145/964001.964020openalex-snapshot
Local reasoning about a copying garbage collector
inferred← citeshttps://doi.org/10.1145/982962.964020openalex-snapshot
Local reasoning about a copying garbage collector
inferred← citeshttps://doi.org/10.2168/lmcs-6(3:6)2010openalex-snapshot
Automated Verification of Practical Garbage Collectors
inferred← citeshttps://doi.org/10.48456/tr-765openalex-snapshot
Formal verification of machine-code programs
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.