On the public citation graph
Unifying Operational Weak Memory Verification: An Axiomatic Approach
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.
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/978-3-030-25540-4_19openalex-snapshot
BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings
inferredcites →https://doi.org/10.1007/978-3-030-44914-8_22openalex-snapshot
Modular Relaxed Dependencies in Weak Memory Concurrency
inferredcites →https://doi.org/10.1007/978-3-030-90870-6_13openalex-snapshot
Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies
inferredcites →https://doi.org/10.1007/978-3-030-90870-6_16openalex-snapshot
Rely/Guarantee Reasoning for Multicopy Atomic Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-030-99336-8_9openalex-snapshot
View-Based Owicki–Gries Reasoning for Persistent x86-TSO
inferredcites →https://doi.org/10.1007/978-3-319-03077-7_21openalex-snapshot
SPIN as a Linearizability Checker under Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-319-41540-6_8openalex-snapshot
Stateless Model Checking for POWER
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_13openalex-snapshot
A Separation Logic for a Promising Semantics
inferredcites →https://doi.org/10.1007/978-3-319-89960-2_11openalex-snapshot
Automating Deductive Verification for Weak-Memory Programs
inferredcites →https://doi.org/10.1007/978-3-642-03359-9_27openalex-snapshot
A Better x86 Memory Model: x86-TSO
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_9openalex-snapshot
Getting Rid of Store-Buffers in TSO Analysis
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-39799-8_9openalex-snapshot
Partial Orders for Efficient Bounded Model Checking of Concurrent Software
inferredcites →https://doi.org/10.1007/978-3-662-47666-6_25openalex-snapshot
Owicki-Gries Reasoning for Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-662-49122-5_20openalex-snapshot
A Program Logic for C11 Memory Fences
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_17openalex-snapshot
Tackling Real-Life Relaxed Concurrency with FSL++
inferredcites →https://doi.org/10.1007/978-3-662-54580-5_4openalex-snapshot
Context-Bounded Analysis for POWER
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/s00236-016-0275-0openalex-snapshot
Stateless model checking for TSO and PSO
inferredcites →https://doi.org/10.1007/s10817-021-09610-2openalex-snapshot
Integrating Owicki–Gries for C11-Style Memory Models into Isabelle/HOL
inferredcites →https://doi.org/10.1016/j.cl.2016.02.003openalex-snapshot
Effective abstractions for verification under relaxed memory models
inferredcites →https://doi.org/10.1016/j.jlap.2011.04.005openalex-snapshot
Concurrent Kleene Algebra and its Foundations
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.069openalex-snapshot
Algebras of modal operators and partial correctness
inferredcites →https://doi.org/10.1109/2.546611openalex-snapshot
Shared memory consistency models: a tutorial
inferredcites →https://doi.org/10.1109/tc.1979.1675439openalex-snapshot
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
inferredcites →https://doi.org/10.1109/tpds.2011.159openalex-snapshot
User-Level Implementations of Read-Copy Update
inferredcites →https://doi.org/10.1145/1926385.1926394openalex-snapshot
Mathematizing C++ concurrency
inferredcites →https://doi.org/10.1145/1993498.1993520openalex-snapshot
Understanding POWER multiprocessors
inferredcites →https://doi.org/10.1145/2429069.2429099openalex-snapshot
Library abstraction for C/C++ concurrency
inferredcites →https://doi.org/10.1145/2837614.2837615openalex-snapshot
Modelling the ARMv8 architecture, operationally: concurrency and ISA
inferredcites →https://doi.org/10.1145/2983990.2983997openalex-snapshot
An operational semantics for C/C++11 concurrency
inferredcites →https://doi.org/10.1145/3009837.3009838openalex-snapshot
Automatically comparing memory consistency models
inferredcites →https://doi.org/10.1145/3009837.3009850openalex-snapshot
A promising semantics for relaxed-memory concurrency
inferredcites →https://doi.org/10.1145/3009837.3009883openalex-snapshot
Ogre and Pythia: an invariance proof method for weak consistency models
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3158105openalex-snapshot
Effective stateless model checking for C/C++ concurrency
inferredcites →https://doi.org/10.1145/3276505openalex-snapshot
Optimal stateless model checking under the release-acquire semantics
inferredcites →https://doi.org/10.1145/3293883.3295702openalex-snapshot
Verifying C11 programs operationally
inferredcites →https://doi.org/10.1145/3314221.3314609openalex-snapshot
Model checking for weakly consistent libraries
inferredcites →https://doi.org/10.1145/3314221.3314624openalex-snapshot
Promising-ARM/RISC-V: a simpler and faster operational concurrency model
inferredcites →https://doi.org/10.1145/3314221.3314649openalex-snapshot
Verification of programs under the release-acquire semantics
inferredcites →https://doi.org/10.1145/3326938.3326942openalex-snapshot
Verification under causally consistent shared memory
inferredcites →https://doi.org/10.1145/3385412.3386010openalex-snapshot
Promising 2.0: global optimizations in relaxed memory concurrency
inferredcites →https://doi.org/10.1145/3428262openalex-snapshot
Pomsets with preconditions: a simple model of relaxed memory
inferredcites →https://doi.org/10.1145/3453483.3454027openalex-snapshot
Revamping hardware persistency models: view-based and axiomatic persistency models for Intel-x86 and Armv8
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/78969.78970openalex-snapshot
win and sin : predicate transformers for concurrency
inferredcites →https://doi.org/10.6084/m9.figshare.19779415openalex-snapshot
Isabelle/HOL files for "Unifying Operational Weak Memory Verification: An Axiomatic Approach"
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70484openalex-snapshot
Weak Memory Model Formalisms: Introduction and Survey
inferred← citeshttps://doi.org/10.1002/smr.70149openalex-snapshot
A Lightweight Modeling and Verification Framework for Programs Over Weak Memory Models in an Algebraic Semantics Style
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_17openalex-snapshot
Reasoning About Promises in Weak Memory Models with Event Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_18openalex-snapshot
A Fine-Grained Semantics for Arrays and Pointers Under Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-031-35257-7_17openalex-snapshot
View-Based Axiomatic Reasoning for PSO
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_11openalex-snapshot
Rely-Guarantee Reasoning for Causally Consistent Shared Memory
inferred← citeshttps://doi.org/10.1007/978-3-031-47705-8_10openalex-snapshot
Lifting the Reasoning Level in Generic Weak Memory Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_4openalex-snapshot
Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures
inferred← citeshttps://doi.org/10.1007/978-3-031-66676-6_5openalex-snapshot
A Rely-Guarantee Framework for Proving Deadlock Freedom Under Causal Consistency
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_27openalex-snapshot
Unifying Weak Memory Verification Using Potentials
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_20openalex-snapshot
Reasoning over Relaxed Shared Memory Models: A Tutorial
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103225openalex-snapshot
View-based axiomatic reasoning for the weak memory models PSO and SRA
inferred← citeshttps://doi.org/10.1142/s0218126625300089openalex-snapshot
Specifying and Verifying Programs Over the MCA ARMv8 Architecture with TLA+
inferred← citeshttps://doi.org/10.1145/3580285openalex-snapshot
Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies
inferred← citeshttps://doi.org/10.1145/3622855openalex-snapshot
Static Analysis of Memory Models for SMT Encodings
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.