On the public citation graph

C4: verified transactional objects

0 signed · 86 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.1995.1134openalex-snapshot
Forward and Backward Simulations
inferredcites →https://doi.org/10.1007/3540543961_7openalex-snapshot
Functional programming with bananas, lenses, envelopes and barbed wire
inferredcites →https://doi.org/10.1007/978-3-030-25543-5_30openalex-snapshot
Violat: Generating Tests of Observational Refinement for Concurrent Objects
inferredcites →https://doi.org/10.1007/978-3-030-53288-8_14openalex-snapshot
Refinement for Structured Concurrent Programs
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_37openalex-snapshot
Automatic Atomicity Verification for Clients of Concurrent Data Structures
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_26openalex-snapshot
Automated and Modular Refinement Reasoning for Concurrent Programs
inferredcites →https://doi.org/10.1007/978-3-319-60225-7_4openalex-snapshot
Proving Opacity via Linearizability: A Sound and Complete Method
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_28openalex-snapshot
Proving Linearizability Using Forward Simulations
inferredcites →https://doi.org/10.1007/978-3-642-15291-7_2openalex-snapshot
Transactional Mutex Locks
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_21openalex-snapshot
How to Prove Algorithms Linearisable
inferredcites →https://doi.org/10.1007/978-3-642-32940-1_19openalex-snapshot
Linearizability with Ownership Transfer
inferredcites →https://doi.org/10.1007/978-3-642-32940-1_36openalex-snapshot
A Framework for Formally Verifying Software Transactional Memory Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_16openalex-snapshot
Communicating State Transition Systems for Fine-Grained Concurrent Resources
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_9openalex-snapshot
Parameterised Linearisability
inferredcites →https://doi.org/10.1007/978-3-662-44202-9_9openalex-snapshot
TaDA: A Logic for Time and Data Abstraction
inferredcites →https://doi.org/10.1007/s00165-012-0225-8openalex-snapshot
Towards formally specifying and verifying transactional memory
inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1016/j.scico.2005.03.001openalex-snapshot
A transactional object calculus
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.024openalex-snapshot
Preface
inferredcites →https://doi.org/10.1016/j.tcs.2010.09.021openalex-snapshot
Abstraction for concurrent objects
inferredcites →https://doi.org/10.1145/1065944.1065952openalex-snapshot
Composable memory transactions
inferredcites →https://doi.org/10.1145/1345206.1345233openalex-snapshot
On the correctness of transactional memory
inferredcites →https://doi.org/10.1145/1345206.1345237openalex-snapshot
Transactional boosting
inferredcites →https://doi.org/10.1145/1402227.1402235openalex-snapshot
Single global lock semantics in a weakly atomic STM
inferredcites →https://doi.org/10.1145/1480881.1480922openalex-snapshot
Local rely-guarantee reasoning
inferredcites →https://doi.org/10.1145/165123.165164openalex-snapshot
Transactional memory
inferredcites →https://doi.org/10.1145/1785414.1785443openalex-snapshot
x86-TSO
inferredcites →https://doi.org/10.1145/1835698.1835703openalex-snapshot
Transactional predication
inferredcites →https://doi.org/10.1145/2048066.2048073openalex-snapshot
Testing atomicity of composed concurrent operations
inferredcites →https://doi.org/10.1145/224964.224987openalex-snapshot
Software transactional memory
inferredcites →https://doi.org/10.1145/2429069.2429111openalex-snapshot
Logical relations for fine-grained concurrency
inferredcites →https://doi.org/10.1145/2480359.2429099openalex-snapshot
Library abstraction for C/C++ concurrency
inferredcites →https://doi.org/10.1145/2491411.2491435openalex-snapshot
Finding incorrect compositions of atomicity
inferredcites →https://doi.org/10.1145/2491956.2462172openalex-snapshot
Concurrent libraries with foresight
inferredcites →https://doi.org/10.1145/2491956.2462189openalex-snapshot
Modular verification of linearizability with non-fixed linearization points
inferredcites →https://doi.org/10.1145/2555243.2555283openalex-snapshot
Optimistic transactional boosting
inferredcites →https://doi.org/10.1145/2601339openalex-snapshot
Atomicity Refinement for Verified Compilation
inferredcites →https://doi.org/10.1145/2660193.2660217openalex-snapshot
Flint
inferredcites →https://doi.org/10.1145/2660193.2660243openalex-snapshot
GPS
inferredcites →https://doi.org/10.1145/2676726.2676975openalex-snapshot
Deep Specifications and Certified Abstraction Layers
inferredcites →https://doi.org/10.1145/2901318.2901348openalex-snapshot
Type-aware transactions for faster concurrent code
inferredcites →https://doi.org/10.1145/2908080.2908112openalex-snapshot
Transactional data structure libraries
inferredcites →https://doi.org/10.1145/2951913.2951943openalex-snapshot
Higher-order ghost state
inferredcites →https://doi.org/10.1145/3131360openalex-snapshot
Characterizing Transactional Memory Consistency Conditions Using Observational Refinement
inferredcites →https://doi.org/10.1145/3148964openalex-snapshot
A Transactional Correctness Tool for Abstract Data Types
inferredcites →https://doi.org/10.1145/3192366.3192381openalex-snapshot
Certified concurrent abstraction layers
inferredcites →https://doi.org/10.1145/3209690openalex-snapshot
Lock-Free Transactional Transformation for Linked Data Structures
inferredcites →https://doi.org/10.1145/322154.322158openalex-snapshot
The serializability of concurrent database updates
inferredcites →https://doi.org/10.1145/3290381openalex-snapshot
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models
inferredcites →https://doi.org/10.1145/3293880.3294106openalex-snapshot
From C to interaction trees: specifying, verifying, and testing a networked server
inferredcites →https://doi.org/10.1145/3293883.3301491openalex-snapshot
LOFT
inferredcites →https://doi.org/10.1145/3303084.3309491openalex-snapshot
Wait-free Dynamic Transactions for Linked Data Structures
inferredcites →https://doi.org/10.1145/3332466.3374514openalex-snapshot
Nesting and composition in transactional data structure libraries
inferredcites →https://doi.org/10.1145/3371119openalex-snapshot
Interaction trees: representing recursive and impure programs in Coq
inferredcites →https://doi.org/10.1145/3372885.3373813openalex-snapshot
An equational theory for weak bisimulation via generalized parameterized coinduction
inferredcites →https://doi.org/10.1145/3380536.3380543openalex-snapshot
Lock-free transactional vector
inferredcites →https://doi.org/10.1145/3473599openalex-snapshot
Skipping the binder bureaucracy with mixed embeddings in a semantics course (functional pearl)
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.5281/zenodo.6342475openalex-snapshot
C4: Verified Transactional Objects

What points at this work

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

inferred← citeshttps://doi.org/10.1017/s0956796825100105openalex-snapshot
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
inferred← citeshttps://doi.org/10.1145/3547632openalex-snapshot
Program adverbs and Tlön embeddings
inferred← citeshttps://doi.org/10.1145/3563352openalex-snapshot
Implementing and verifying release-acquire transactional memory in C11
inferred← citeshttps://doi.org/10.1145/3571206openalex-snapshot
Executing Microservice Applications on Serverless, Correctly
inferred← citeshttps://doi.org/10.1145/3571231openalex-snapshot
A Compositional Theory of Linearizability
inferred← citeshttps://doi.org/10.1145/3571254openalex-snapshot
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq
inferred← citeshttps://doi.org/10.1145/3591220openalex-snapshot
Formally Verified Samplers from Probabilistic Programs with Loops and Conditioning
inferred← citeshttps://doi.org/10.1145/3632854openalex-snapshot
Modular Denotational Semantics for Effects with Guarded Interaction Trees
inferred← citeshttps://doi.org/10.1145/3643668openalex-snapshot
A Compositional Theory of Linearizability
inferred← citeshttps://doi.org/10.1145/3703595.3705890openalex-snapshot
Monadic Interpreters for Concurrent Memory Models
inferred← citeshttps://doi.org/10.1145/3705593openalex-snapshot
Formal Verification of Just-in-Time Compilation
inferred← citeshttps://doi.org/10.1145/3705593.3705594openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3705593.3705595openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1145/3705593.3705596openalex-snapshot
Background on Just-in-Time Compilation
inferred← citeshttps://doi.org/10.1145/3705593.3705597openalex-snapshot
Background on the CompCert Compiler
inferred← citeshttps://doi.org/10.1145/3705593.3705598openalex-snapshot
Designing Formally Verified JITs
inferred← citeshttps://doi.org/10.1145/3705593.3705599openalex-snapshot
Formally Verified Speculative Optimizations
inferred← citeshttps://doi.org/10.1145/3705593.3705600openalex-snapshot
Formal Verification of Impure Coq JITs
inferred← citeshttps://doi.org/10.1145/3705593.3705601openalex-snapshot
Formal Verification of a JIT Backend Compiler
inferred← citeshttps://doi.org/10.1145/3705593.3705602openalex-snapshot
Assessment
inferred← citeshttps://doi.org/10.1145/3705593.3705603openalex-snapshot
Conclusion
inferred← citeshttps://doi.org/10.1145/3705593.3705604openalex-snapshot
Relating the Developments to the Book
inferred← citeshttps://doi.org/10.1145/3705593.3705605openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1145/3705593.3705606openalex-snapshot
Authors’ Biography/Index
inferred← citeshttps://doi.org/10.1145/3747515openalex-snapshot
Reasoning about Weak Isolation Levels in Separation Logic
inferred← citeshttps://doi.org/10.1145/3763091openalex-snapshot
Structural Temporal Logic for Mechanized Program Verification
inferred← citeshttps://doi.org/10.70675/bfb1bf73z45cez4651z9900z881984e8c420openalex-snapshot
Formal Verification of Just-in-Time Compilation
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.