On the public citation graph

Fair Operational Semantics

https://doi.org/10.1145/3591253
0 signed · 35 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/978-3-642-22012-8_36openalex-snapshot
Liveness-Preserving Atomicity Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-40184-8_17openalex-snapshot
Characterizing Progress Properties of Concurrent Objects via Contextual Refinements
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_8openalex-snapshot
Modular Termination Verification for Non-blocking Concurrency
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_34openalex-snapshot
A Higher-Order Logic for Concurrent Termination-Preserving Refinement
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.034openalex-snapshot
A semantics for concurrent separation logic
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/1111037.1111042openalex-snapshot
Formal certification of a compiler back-end or
inferredcites →https://doi.org/10.1145/2676726.2676975openalex-snapshot
Deep Specifications and Certified Abstraction Layers
inferredcites →https://doi.org/10.1145/2775051.2676980openalex-snapshot
Iris
inferredcites →https://doi.org/10.1145/2837614.2837635openalex-snapshot
A program logic for concurrent objects under fair scheduling
inferredcites →https://doi.org/10.1145/3009837.3009850openalex-snapshot
A promising semantics for relaxed-memory concurrency
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3158108openalex-snapshot
Progress of concurrent objects with partial methods
inferredcites →https://doi.org/10.1145/3371119openalex-snapshot
Interaction trees: representing recursive and impure programs in Coq
inferredcites →https://doi.org/10.1145/3385412.3386010openalex-snapshot
Promising 2.0: global optimizations in relaxed memory concurrency
inferredcites →https://doi.org/10.1145/3437992.3439931openalex-snapshot
Reasoning about monotonicity in separation logic
inferredcites →https://doi.org/10.1145/3477082openalex-snapshot
TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs
inferredcites →https://doi.org/10.1145/3485475openalex-snapshot
Making weak memory models fair
inferredcites →https://doi.org/10.1145/3498689openalex-snapshot
Simuliris: a separation logic framework for verifying concurrent program optimizations
inferredcites →https://doi.org/10.1145/3519939.3523718openalex-snapshot
Sequential reasoning for optimizing compilers under weak memory concurrency
inferredcites →https://doi.org/10.1145/3571232openalex-snapshot
Conditional Contextual Refinement
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/362759.362813openalex-snapshot
Concurrent control with “readers” and “writers”
inferredcites →https://doi.org/10.5281/zenodo.7711062openalex-snapshot
PLDI23 artifact for Fair Operational Semantics

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.sysarc.2023.103046openalex-snapshot
ThreadAbs: A template to build verified thread-local interfaces with software scheduler abstractions
inferred← citeshttps://doi.org/10.1145/3622857openalex-snapshot
Stuttering for Free
inferred← citeshttps://doi.org/10.1145/3674645openalex-snapshot
Refinement Composition Logic
inferred← citeshttps://doi.org/10.1145/3720435openalex-snapshot
Soundness of Predictive Concurrency Analyses
inferred← citeshttps://doi.org/10.1145/3720525openalex-snapshot
Lilo: A Higher-Order, Relational Concurrent Separation Logic for Liveness
inferred← citeshttps://doi.org/10.1145/3729250openalex-snapshot
Nola: Later-Free Ghost State for Verifying Termination in Iris
inferred← citeshttps://doi.org/10.1145/3747512openalex-snapshot
Almost Fair Simulations
inferred← citeshttps://doi.org/10.1145/3763091openalex-snapshot
Structural Temporal Logic for Mechanized Program Verification
inferred← citeshttps://doi.org/10.1145/3798240openalex-snapshot
Lawyer: Modular Obligations-Based Liveness Reasoning in Higher-Order Impredicative Concurrent Separation Logic
inferred← citeshttps://doi.org/10.18255/1818-1015-2026-2-122-149openalex-snapshot
Building operational semantics of programming languages as executable ontological models of 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.