On the public citation graph

Rely-Guarantee-Based Simulation for Compositional Verification of Concurrent Program Transformations

https://doi.org/10.1145/2576235
0 signed · 71 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/11864219_14openalex-snapshot
Transactional Locking II
inferredcites →https://doi.org/10.1007/3-540-61052-9_49openalex-snapshot
Compiler correctness for concurrent languages
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-642-11957-6_23openalex-snapshot
Verifying a Compiler for Java Threads
inferredcites →https://doi.org/10.1007/978-3-642-11970-5_7openalex-snapshot
Verifying Local Transformations on Relaxed Memory Models
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/bf00289507openalex-snapshot
Proof of correctness of data representations
inferredcites →https://doi.org/10.1007/s10817-009-9155-4openalex-snapshot
A Formally Verified Compiler Back-end
inferredcites →https://doi.org/10.1007/s10992-011-9195-1openalex-snapshot
Fine-grained Concurrency with Separation Logic
inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1016/c2011-0-06993-4openalex-snapshot
The Art of Multiprocessor Programming
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.036openalex-snapshot
Relational separation logic
inferredcites →https://doi.org/10.1016/j.tcs.2010.09.021openalex-snapshot
Abstraction for concurrent objects
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/lics.2006.52openalex-snapshot
Variables as Resource in Hoare Logics
inferredcites →https://doi.org/10.1145/1064978.1065042openalex-snapshot
Threads cannot be implemented as a library
inferredcites →https://doi.org/10.1145/1065010.1065042openalex-snapshot
Threads cannot be implemented as a library
inferredcites →https://doi.org/10.1145/1108970.1108972openalex-snapshot
A parallel, incremental, mostly concurrent garbage collector for servers
inferredcites →https://doi.org/10.1145/1133255.1134022openalex-snapshot
Correctness-preserving derivation of concurrent garbage collection algorithms
inferredcites →https://doi.org/10.1145/1133981.1134022openalex-snapshot
Correctness-preserving derivation of concurrent garbage collection algorithms
inferredcites →https://doi.org/10.1145/113445.113459openalex-snapshot
Mostly parallel garbage collection
inferredcites →https://doi.org/10.1145/1250734.1250788openalex-snapshot
A general framework for certifying garbage collectors and their mutators
inferredcites →https://doi.org/10.1145/1375581.1375591openalex-snapshot
Foundations of the C++ concurrency memory model
inferredcites →https://doi.org/10.1145/1480881.1480887openalex-snapshot
A model of cooperative threads
inferredcites →https://doi.org/10.1145/1480881.1480922openalex-snapshot
Local rely-guarantee reasoning
inferredcites →https://doi.org/10.1145/1596550.1596567openalex-snapshot
Biorthogonality, step-indexing and compiler correctness
inferredcites →https://doi.org/10.1145/1925844.1926393openalex-snapshot
Relaxed-memory concurrency and verified compilation
inferredcites →https://doi.org/10.1145/1925844.1926402openalex-snapshot
A kripke logical relation between ML and assembly
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.1926402openalex-snapshot
A kripke logical relation between ML and assembly
inferredcites →https://doi.org/10.1145/1926385.1926415openalex-snapshot
A separation logic for refining concurrent objects
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/224164.224193openalex-snapshot
Compiler correctness for parallel languages
inferredcites →https://doi.org/10.1145/69575.69577openalex-snapshot
Tentative steps toward a development method for interfering programs
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.48456/tr-726openalex-snapshot
Modular fine-grained concurrency verification
inferredcites →https://doi.org/10.48550/arxiv.1006.4342openalex-snapshot
Formal Derivation of Concurrent Garbage Collectors

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-99336-8_10openalex-snapshot
Abstraction for Crash-Resilient Objects
inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_5openalex-snapshot
Specifying and Reasoning About Shared-Variable Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_5openalex-snapshot
A Denotational Approach to Release/Acquire Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_26openalex-snapshot
Automated and Modular Refinement Reasoning for Concurrent Programs
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/978-3-319-95582-7_31openalex-snapshot
Compositional Reasoning for Shared-Variable Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_34openalex-snapshot
A Higher-Order Logic for Concurrent Termination-Preserving Refinement
inferred← citeshttps://doi.org/10.1007/s00165-019-00482-3openalex-snapshot
Investigating the limits of rely/guarantee relations based on a concurrent garbage collector example
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.1109/csf.2016.36openalex-snapshot
Compositional Verification and Refinement of Concurrent Value-Dependent Noninterference
inferred← citeshttps://doi.org/10.1109/etfa.2016.7733551openalex-snapshot
Towards certified compilation of RTFM-core applications
inferred← citeshttps://doi.org/10.1109/tase49443.2020.00021openalex-snapshot
Rely-Guarantee Reasoning about Messaging System for Autonomous Vehicles
inferred← citeshttps://doi.org/10.1145/2786558.2786561openalex-snapshot
Short Paper
inferred← citeshttps://doi.org/10.1145/3167132.3167333openalex-snapshot
Verified compilation of linearizable data structures
inferred← citeshttps://doi.org/10.1145/3267468openalex-snapshot
Test-Based Security Certification of Composite Services
inferred← citeshttps://doi.org/10.1145/3290371openalex-snapshot
Decoupling lock-free data structures from memory reclamation for static analysis
inferred← citeshttps://doi.org/10.1145/3371136openalex-snapshot
Pointer life cycle types for lock-free data structures with memory reclamation
inferred← citeshttps://doi.org/10.1145/3436808openalex-snapshot
CSim 2
inferred← citeshttps://doi.org/10.1145/3470639openalex-snapshot
Study of Fine-grained Nested Parallelism in CDCL SAT Solvers
inferred← citeshttps://doi.org/10.1145/3519939.3523718openalex-snapshot
Sequential reasoning for optimizing compilers under weak memory concurrency
inferred← citeshttps://doi.org/10.1145/3609703.3609714openalex-snapshot
Survey of the Formal Verification of Operating Systems in Power Monitoring System
inferred← citeshttps://doi.org/10.1145/3643668openalex-snapshot
A Compositional Theory of Linearizability
inferred← citeshttps://doi.org/10.1145/3656399openalex-snapshot
Compositional Semantics for Shared-Variable Concurrency
inferred← citeshttps://doi.org/10.1145/3701729openalex-snapshot
A Proof System for the SMrCaIT Calculus
inferred← citeshttps://doi.org/10.1145/3715096openalex-snapshot
A Brookes-Style Denotational Semantics for Release/Acquire Concurrency
inferred← citeshttps://doi.org/10.1145/3783996openalex-snapshot
A Brief History of Formal Methods in China
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01535openalex-snapshot
High-Assurance Separation Kernels: A Survey on Formal Methods
inferred← citeshttps://doi.org/10.48550/arxiv.1701.05888openalex-snapshot
A Higher-Order Logic for Concurrent Termination-Preserving Refinement
inferred← citeshttps://doi.org/10.48550/arxiv.2111.03881openalex-snapshot
Abstraction for Crash-Resilient Objects (Extended Version)
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.