On the public citation graph
CAAT: consistency as a theory
0 signed · 94 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/3-540-36135-9_16openalex-snapshot
Bounded Model Checking for Timed Systems
inferredcites →https://doi.org/10.1007/3-540-44880-2_1openalex-snapshot
Alloy: A Logical Modelling Language
inferredcites →https://doi.org/10.1007/978-1-4612-4980-1_17openalex-snapshot
Naive Evaluation of Recursively Defined Relations
inferredcites →https://doi.org/10.1007/978-1-4615-3604-8_2openalex-snapshot
Formal Specification of Memory Models
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-25540-4_22openalex-snapshot
Cerberus-BMC: A Principled Reference Semantics and Exploration Tool for Concurrent and Sequential C
inferredcites →https://doi.org/10.1007/978-3-030-44914-8_23openalex-snapshot
ARMv8-A System Semantics: Instruction Fetch in Relaxed Architectures
inferredcites →https://doi.org/10.1007/978-3-030-45237-7_24openalex-snapshot
Dartagnan: Bounded Model Checking for Weak Memory Models (Competition Contribution)
inferredcites →https://doi.org/10.1007/978-3-030-54997-8_31openalex-snapshot
PrideMM: Second Order Model Checking for Memory Consistency Models
inferredcites →https://doi.org/10.1007/978-3-030-71500-7_11openalex-snapshot
Efficient Bounded Model Checking of Heap-Manipulating Programs using Tight Field Bounds
inferredcites →https://doi.org/10.1007/978-3-030-81685-8_14openalex-snapshot
Isla: Integrating Full-Scale ISA Semantics and Axiomatic Concurrency Models
inferredcites →https://doi.org/10.1007/978-3-030-81685-8_20openalex-snapshot
GenMC: A Model Checker for Weak Memory Models
inferredcites →https://doi.org/10.1007/978-3-030-81688-9_9openalex-snapshot
JavaSMT 3: Interacting with SMT Solvers in Java
inferredcites →https://doi.org/10.1007/978-3-030-99336-8_6openalex-snapshot
Relaxed virtual memory in Armv8-A
inferredcites →https://doi.org/10.1007/978-3-030-99527-0_20openalex-snapshot
Progress on Software Verification: SV-COMP 2022
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-48869-1_11openalex-snapshot
JavaSMT: A Unified Interface for SMT Solvers in Java
inferredcites →https://doi.org/10.1007/978-3-319-66706-5_15openalex-snapshot
Portability Analysis for Weak Memory Models porthos: One Tool for all Models
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_12openalex-snapshot
Effective Program Verification for Relaxed Memory Models
inferredcites →https://doi.org/10.1007/978-3-540-71209-1_49openalex-snapshot
Kodkod: A Relational Model Finder
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_36openalex-snapshot
An Axiomatic Memory Model for POWER Multiprocessors
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/978-3-642-38856-9_7openalex-snapshot
Predicate Abstraction for Relaxed Memory Models
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-03811-6openalex-snapshot
Principles of Program Analysis
inferredcites →https://doi.org/10.1007/978-3-662-46081-8_25openalex-snapshot
Effective Abstractions for Verification under Relaxed Memory Models
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_12openalex-snapshot
The Problem of Programming Language Concurrency Semantics
inferredcites →https://doi.org/10.1007/978-3-662-46681-0_28openalex-snapshot
Stateless Model Checking for TSO and PSO
inferredcites →https://doi.org/10.1007/s10703-011-0135-zopenalex-snapshot
Fences in weak memory models (extended version)
inferredcites →https://doi.org/10.1016/0304-3975(80)90059-6openalex-snapshot
Complexity, convexity and combinations of theories
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1023/a:1011276507260openalex-snapshot
Bounded Model Checking Using Satisfiability Solving
inferredcites →https://doi.org/10.1109/2.546611openalex-snapshot
Shared memory consistency models: a tutorial
inferredcites →https://doi.org/10.1109/swat.1971.10openalex-snapshot
Depth-first search and linear graph algorithms
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.2003.1199067openalex-snapshot
Information-flow models for shared memory with an application to the powerPC architecture
inferredcites →https://doi.org/10.1142/9789811273117_0001openalex-snapshot
Introduction to Graph Theory
inferredcites →https://doi.org/10.1145/1328911.1328917openalex-snapshot
A faster and simpler fully dynamic transitive closure
inferredcites →https://doi.org/10.1145/1379022.1375591openalex-snapshot
Foundations of the C++ concurrency memory model
inferredcites →https://doi.org/10.1145/1706299.1706303openalex-snapshot
On the verification problem for weak memory models
inferredcites →https://doi.org/10.1145/1925844.1926394openalex-snapshot
Mathematizing C++ concurrency
inferredcites →https://doi.org/10.1145/1993316.1993520openalex-snapshot
Understanding POWER multiprocessors
inferredcites →https://doi.org/10.1145/2103621.2103717openalex-snapshot
Clarifying and compiling C/C++ concurrency
inferredcites →https://doi.org/10.1145/2535838.2535845openalex-snapshot
Optimal dynamic partial order reduction
inferredcites →https://doi.org/10.1145/2676726.2676995openalex-snapshot
Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it
inferredcites →https://doi.org/10.1145/2814270.2814297openalex-snapshot
SATCheck: SAT-directed stateless model checking for SC and TSO
inferredcites →https://doi.org/10.1145/2837614.2837637openalex-snapshot
Overhauling SC atomics in C11 and OpenCL
inferredcites →https://doi.org/10.1145/2837614.2837643openalex-snapshot
Taming release-acquire consistency
inferredcites →https://doi.org/10.1145/2933575.2934536openalex-snapshot
On Thin Air Reads Towards an Event Structures Model of Relaxed Memory
inferredcites →https://doi.org/10.1145/3062341.3062352openalex-snapshot
Repairing sequential consistency in C/C++11
inferredcites →https://doi.org/10.1145/3093333.3009838openalex-snapshot
Automatically comparing memory consistency models
inferredcites →https://doi.org/10.1145/3140587.3062353openalex-snapshot
Synthesizing memory models from framework sketches and Litmus tests
inferredcites →https://doi.org/10.1145/3158107openalex-snapshot
Simplifying ARM concurrency: multicopy-atomic axiomatic and operational models for ARMv8
inferredcites →https://doi.org/10.1145/3173162.3177156openalex-snapshot
Frightening Small Children and Disconcerting Grown-ups
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/3276505openalex-snapshot
Optimal stateless model checking under the release-acquire semantics
inferredcites →https://doi.org/10.1145/3290371openalex-snapshot
Decoupling lock-free data structures from memory reclamation for static analysis
inferredcites →https://doi.org/10.1145/3290382openalex-snapshot
Bridging the gap between programming languages and hardware weak memory models
inferredcites →https://doi.org/10.1145/3314221.3314609openalex-snapshot
Model checking for weakly consistent libraries
inferredcites →https://doi.org/10.1145/3371136openalex-snapshot
Pointer life cycle types for lock-free data structures with memory reclamation
inferredcites →https://doi.org/10.1145/3445814.3446748openalex-snapshot
VSync: push-button verification and optimization for synchronization primitives on weak memory models
inferredcites →https://doi.org/10.1145/3453483.3454108openalex-snapshot
Satisfiability modulo ordering consistency theory for multi-threaded program verification
inferredcites →https://doi.org/10.1145/3486607.3486751openalex-snapshot
Kotlin coroutines: design and implementation
inferredcites →https://doi.org/10.1145/3503221.3508424openalex-snapshot
Interference relation-guided SMT solving for multi-threaded program verification
inferredcites →https://doi.org/10.1145/357474.355063openalex-snapshot
Automating first-order relational logic
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/42190.42277openalex-snapshot
Efficient and correct execution of parallel programs that share memory
inferredcites →https://doi.org/10.23919/fmcad.2018.8603021openalex-snapshot
BMC with Memory Models as Modules
inferredcites →https://doi.org/10.3233/faia201017openalex-snapshot
Chapter 33. Satisfiability Modulo Theories
inferredcites →https://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferredcites →https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_25openalex-snapshot
Dynamic Partial Order Reductions for Spinloops
inferredcites →https://doi.org/10.5281/zenodo.7079673openalex-snapshot
CAAT: Consistency as a Theory (Artifact)
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-031-56222-8_7openalex-snapshot
On Verifying Concurrent Programs Under Weak Consistency Models: Decidability and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_4openalex-snapshot
Enhancing GenMC’s Usability and Performance
inferred← citeshttps://doi.org/10.1007/978-3-031-90643-5_1openalex-snapshot
On Stability in a Happens-Before Propagator for Concurrent Programs (Reproducibility Study)
inferred← citeshttps://doi.org/10.1007/978-3-032-26204-2_26openalex-snapshot
A Refined Ordering Consistency Theory: Full Sequential Consistency and Generalized Preventive Reasoning
inferred← citeshttps://doi.org/10.1109/dsn-w65791.2025.00037openalex-snapshot
Reasoning with Happens-Before Relations About Concurrent Programs in the THETA Framework
inferred← citeshttps://doi.org/10.1109/indicon59947.2023.10440892openalex-snapshot
Meow: Memory Evaluation through Optimized Workloads - Synthesizing Litmus Tests for Memory Consistency Verification
inferred← citeshttps://doi.org/10.1109/tse.2023.3326056openalex-snapshot
Simulating Operational Memory Models Using Off-the-Shelf Program Analysis Tools
inferred← citeshttps://doi.org/10.1145/3622855openalex-snapshot
Static Analysis of Memory Models for SMT Encodings
inferred← citeshttps://doi.org/10.1145/3720504openalex-snapshot
Checking Observational Correctness of Database Systems
inferred← citeshttps://doi.org/10.1145/3776687openalex-snapshot
Recurrence Sets for Proving Fair Non-termination under Axiomatic Memory Consistency Models
inferred← citeshttps://doi.org/10.1145/3798208openalex-snapshot
RAT-CAT-SAT: Model Checking Memory Consistency Models
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.