On the public citation graph

Atomicity Refinement for Verified Compilation

0 signed · 47 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.1006/inco.1996.0056openalex-snapshot
Full Abstraction for a Shared-Variable Parallel Language
inferredcites →https://doi.org/10.1007/978-3-540-74407-8_18openalex-snapshot
A Marriage of Rely/Guarantee and Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-78739-6_27openalex-snapshot
Oracle Semantics for Concurrent Separation Logic
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_26openalex-snapshot
Deny-Guarantee Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-11957-6_23openalex-snapshot
Verifying a Compiler for Java Threads
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_25openalex-snapshot
Simplifying Linearizability Proofs with Reduction and Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-15057-9_4openalex-snapshot
A Rely-Guarantee Proof System for x86-TSO
inferredcites →https://doi.org/10.1007/978-3-642-28869-2_5openalex-snapshot
Concurrent Library Correctness on the TSO Memory Model
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_28openalex-snapshot
Software Verification for Weak Memory via Program Transformation
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_29openalex-snapshot
Checking and Enforcing Robustness against TSO
inferredcites →https://doi.org/10.1007/s10817-009-9155-4openalex-snapshot
A Formally Verified Compiler Back-end
inferredcites →https://doi.org/10.1145/1480881.1480885openalex-snapshot
A calculus of atomic actions
inferredcites →https://doi.org/10.1145/1480881.1480922openalex-snapshot
Local rely-guarantee reasoning
inferredcites →https://doi.org/10.1145/158511.158611openalex-snapshot
A concurrent, generational garbage collector for a multithreaded implementation of ML
inferredcites →https://doi.org/10.1145/1594834.1480885openalex-snapshot
A calculus of atomic actions
inferredcites →https://doi.org/10.1145/1594834.1480922openalex-snapshot
Local rely-guarantee reasoning
inferredcites →https://doi.org/10.1145/174675.174673openalex-snapshot
Portable, unobtrusive garbage collection for multiprocessor systems
inferredcites →https://doi.org/10.1145/1863543.1863584openalex-snapshot
A certified framework for compiling and executing garbage-collected languages
inferredcites →https://doi.org/10.1145/1925844.1926393openalex-snapshot
Relaxed-memory concurrency and verified compilation
inferredcites →https://doi.org/10.1145/1925844.1926394openalex-snapshot
Mathematizing C++ concurrency
inferredcites →https://doi.org/10.1145/1925844.1926415openalex-snapshot
A separation logic for refining concurrent objects
inferredcites →https://doi.org/10.1145/1926385.1926393openalex-snapshot
Relaxed-memory concurrency and verified compilation
inferredcites →https://doi.org/10.1145/1926385.1926394openalex-snapshot
Mathematizing C++ concurrency
inferredcites →https://doi.org/10.1145/1926385.1926415openalex-snapshot
A separation logic for refining concurrent objects
inferredcites →https://doi.org/10.1145/1993316.1993520openalex-snapshot
Understanding POWER multiprocessors
inferredcites →https://doi.org/10.1145/1993498.1993520openalex-snapshot
Understanding POWER multiprocessors
inferredcites →https://doi.org/10.1145/2103621.2103711openalex-snapshot
A rely-guarantee-based simulation for verifying concurrent program transformations
inferredcites →https://doi.org/10.1145/2103656.2103711openalex-snapshot
A rely-guarantee-based simulation for verifying concurrent program transformations
inferredcites →https://doi.org/10.1145/2487241.2487248openalex-snapshot
CompCertTSO
inferredcites →https://doi.org/10.1145/325164.325100openalex-snapshot
Weak ordering---a new definition
inferredcites →https://doi.org/10.1145/362422.362484openalex-snapshot
Implementing an on-the-fly garbage collector for Java
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/69575.69577openalex-snapshot
Tentative steps toward a development method for interfering programs
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects

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-319-29613-5_10openalex-snapshot
Moving Around: Lipton’s Reduction for TSO
inferred← citeshttps://doi.org/10.1007/978-3-319-66107-0_31openalex-snapshot
Verifying a Concurrent Garbage Collector Using a Rely-Guarantee Methodology
inferred← citeshttps://doi.org/10.1007/s10817-018-9489-xopenalex-snapshot
Verifying a Concurrent Garbage Collector with a Rely-Guarantee Methodology
inferred← citeshttps://doi.org/10.1145/2594291.2594346openalex-snapshot
Atomicity refinement for verified compilation
inferred← citeshttps://doi.org/10.1145/2666356.2594346openalex-snapshot
Atomicity refinement for verified compilation
inferred← citeshttps://doi.org/10.1145/2737924.2738006openalex-snapshot
Relaxing safely: verified on-the-fly garbage collection for x86-TSO
inferred← citeshttps://doi.org/10.1145/2813885.2738006openalex-snapshot
Relaxing safely: verified on-the-fly garbage collection for x86-TSO
inferred← citeshttps://doi.org/10.1145/2837614.2837643openalex-snapshot
Taming release-acquire consistency
inferred← citeshttps://doi.org/10.1145/2914770.2837643openalex-snapshot
Taming release-acquire consistency
inferred← citeshttps://doi.org/10.1145/3167132.3167333openalex-snapshot
Verified compilation of linearizable data structures
inferred← citeshttps://doi.org/10.1145/3314221.3314595openalex-snapshot
Towards certified separate compilation for concurrent programs
inferred← citeshttps://doi.org/10.1145/3527324openalex-snapshot
C4: verified transactional objects
inferred← citeshttps://doi.org/10.70675/17cadd9fzfc41z474ez9d5az4268292af437openalex-snapshot
Verification of a Concurrent Garbage Collector
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.