On the public citation graph
CheckFence
0 signed · 252 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/11513988_9openalex-snapshot
Bounded Model Checking of Concurrent Programs
inferredcites →https://doi.org/10.1007/11795490_3openalex-snapshot
A Lazy Concurrent List-Based Set Algorithm
inferredcites →https://doi.org/10.1007/11817963_44openalex-snapshot
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
inferredcites →https://doi.org/10.1007/11817963_45openalex-snapshot
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
inferredcites →https://doi.org/10.1007/11864219_11openalex-snapshot
Checking a Multithreaded Algorithm with + CAL
inferredcites →https://doi.org/10.1007/3-540-36108-1_18openalex-snapshot
A Practical Multi-word Compare-and-Swap Operation
inferredcites →https://doi.org/10.1007/3-540-40026-5_4openalex-snapshot
Even Better DCAS-Based Concurrent Deques
inferredcites →https://doi.org/10.1007/3-540-45414-4_21openalex-snapshot
A Pragmatic Implementation of Non-blocking Linked-lists
inferredcites →https://doi.org/10.1007/3-540-45937-5_16openalex-snapshot
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_15openalex-snapshot
A Tool for Checking ANSI-C Programs
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_31openalex-snapshot
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_4openalex-snapshot
A Formal Reduction for Lock-Free Parallel Algorithms
inferredcites →https://doi.org/10.1016/c2009-0-27261-8openalex-snapshot
Alpha Architecture Reference Manual
inferredcites →https://doi.org/10.1016/j.entcs.2007.04.005openalex-snapshot
A Simple Sequential Reasoning Approach for Sound Modular Verification of Mainstream Multithreaded Programs
inferredcites →https://doi.org/10.1016/j.jpdc.2004.12.005openalex-snapshot
Fast and lock-free concurrent priority queues for multi-thread systems
inferredcites →https://doi.org/10.1016/j.scico.2005.03.007openalex-snapshot
The java.util.concurrent synchronizer framework
inferredcites →https://doi.org/10.1016/s1571-0661(05)80006-4openalex-snapshot
Automatically Verifying Concurrent Queue Algorithms
inferredcites →https://doi.org/10.1057/978-1-349-95988-4_489openalex-snapshot
International Business Machines Corporation
inferredcites →https://doi.org/10.1109/2.546611openalex-snapshot
Shared memory consistency models: a tutorial
inferredcites →https://doi.org/10.1109/ipdps.2004.1302944openalex-snapshot
Nemos: a framework for axiomatic and executable specifications of memory consistency models
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.1145/1007912.1007945openalex-snapshot
DCAS is not a silver bullet for nonblocking algorithm design
inferredcites →https://doi.org/10.1145/1064978.1065013openalex-snapshot
A serializability violation detector for shared-memory server programs
inferredcites →https://doi.org/10.1145/1064978.1065042openalex-snapshot
Threads cannot be implemented as a library
inferredcites →https://doi.org/10.1145/1065010.1065013openalex-snapshot
A serializability violation detector for shared-memory server programs
inferredcites →https://doi.org/10.1145/1065010.1065042openalex-snapshot
Threads cannot be implemented as a library
inferredcites →https://doi.org/10.1145/1095408.1095421openalex-snapshot
Software and the Concurrency Revolution
inferredcites →https://doi.org/10.1145/1122971.1122992openalex-snapshot
Proving correctness of highly-concurrent linearisable objects
inferredcites →https://doi.org/10.1145/1133255.1134018openalex-snapshot
Effective static race detection for Java
inferredcites →https://doi.org/10.1145/1133981.1134018openalex-snapshot
Effective static race detection for Java
inferredcites →https://doi.org/10.1145/215399.215413openalex-snapshot
An executable specification, analyzer and verifier for RMO (relaxed memory order)
inferredcites →https://doi.org/10.1145/248052.248106openalex-snapshot
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
inferredcites →https://doi.org/10.1145/259380.259442openalex-snapshot
Practical implementations of non-blocking synchronization primitives
inferredcites →https://doi.org/10.1145/349299.349328openalex-snapshot
Type-based race detection for Java
inferredcites →https://doi.org/10.1145/42190.42277openalex-snapshot
Efficient and correct execution of parallel programs that share memory
inferredcites →https://doi.org/10.1145/782814.782854openalex-snapshot
Automatic fence insertion for shared memory multiprocessing
inferredcites →https://doi.org/10.1145/996841.996844openalex-snapshot
Race checking by context inference
inferredcites →https://doi.org/10.1145/996841.996848openalex-snapshot
Scalable lock-free dynamic memory allocation
inferredcites →https://doi.org/10.5555/1898953.1898968openalex-snapshot
On the effectiveness of speculative and selective memory fences
inferredcites →https://doi.org/10.7551/mitpress/9486.003.0016openalex-snapshot
Intel Threading Building Blocks
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-0-387-09766-4_38openalex-snapshot
Race Detection Techniques
inferred← citeshttps://doi.org/10.1007/978-1-4419-9359-5_6openalex-snapshot
Bounded Model Checking for Concurrent Systems: Synchronous Vs. Asynchronous
inferred← citeshttps://doi.org/10.1007/978-3-030-00359-3_2openalex-snapshot
Replacing Store Buffers by Load Buffers in TSO
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_19openalex-snapshot
On the Complexity of Checking Consistency for Replicated Data Types
inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_20openalex-snapshot
Stateful Dynamic Partial Order Reduction for Model Checking Event-Driven Applications that Do Not Terminate
inferred← citeshttps://doi.org/10.1007/978-3-031-01740-7openalex-snapshot
Shared-Memory Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_3openalex-snapshot
Sufficient Conditions for Robustness of RDMA Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_5openalex-snapshot
Deciding Serializability in Network Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-03077-7_21openalex-snapshot
SPIN as a Linearizability Checker under Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_10openalex-snapshot
Reasoning Algebraically About Refinement on TSO Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_15openalex-snapshot
Synthesis of Memory Fences via Refinement Propagation
inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_2openalex-snapshot
Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?
inferred← citeshttps://doi.org/10.1007/978-3-319-19249-9_19openalex-snapshot
Property-Driven Fence Insertion Using Reorder Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_26openalex-snapshot
PBMC: Symbolic Slicing for the Verification of Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-29613-5_10openalex-snapshot
Moving Around: Lipton’s Reduction for TSO
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_8openalex-snapshot
Stateless Model Checking for POWER
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_1openalex-snapshot
Verification of Concurrent Programs on Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-319-49583-5_2openalex-snapshot
Hardware-Based Sequential Consistency Violation Detection Made Simpler
inferred← citeshttps://doi.org/10.1007/978-3-319-59647-1_11openalex-snapshot
Locality and Singularity for Store-Atomic Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-319-66706-5_15openalex-snapshot
Portability Analysis for Weak Memory Models porthos: One Tool for all Models
inferred← citeshttps://doi.org/10.1007/978-3-319-89963-3_4openalex-snapshot
EMME: A Formal Tool for ECMAScript Memory Model Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_12openalex-snapshot
Effective Program Verification for Relaxed Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_4openalex-snapshot
Formalising Java’s Data Race Free Guarantee
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_10openalex-snapshot
Efficient Modeling of Concurrent Systems in BMC
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_2openalex-snapshot
Model Checking Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_21openalex-snapshot
Experience with Model Checking Linearizability
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_26openalex-snapshot
Software Transactional Memory on Relaxed Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_17openalex-snapshot
Symbolic Predictive Analysis for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_13openalex-snapshot
Checking Bounded Reachability in Asynchronous Systems by Symbolic Event Tracing
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_27openalex-snapshot
Trace-Based Symbolic Analysis for Atomicity Violations
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_26openalex-snapshot
Generating Litmus Tests for Contrasting Memory Consistency Models
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_41openalex-snapshot
Model Checking of Linearizability of Concurrent List Implementations
inferred← citeshttps://doi.org/10.1007/978-3-642-16164-3_16openalex-snapshot
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-642-16558-0_43openalex-snapshot
WOMM: A Weak Operational Memory Model
inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_27openalex-snapshot
Trace-Driven Verification of Multithreaded Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_3openalex-snapshot
Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_34openalex-snapshot
Deciding Robustness against Total Store Ordering
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_20openalex-snapshot
Quantitative Synthesis for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_6openalex-snapshot
Stability in Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-642-22306-8_10openalex-snapshot
A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_14openalex-snapshot
Verifying Fence Elimination Optimisations
inferred← citeshttps://doi.org/10.1007/978-3-642-25318-8_21openalex-snapshot
Soundness of Data Flow Analyses for Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_15openalex-snapshot
Counter-Example Guided Fence Insertion under TSO
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_2openalex-snapshot
What’s Decidable about Weak Memory Models?
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_13openalex-snapshot
Automatic Fence Insertion in Integer Programs via Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_24openalex-snapshot
A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_37openalex-snapshot
Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_17openalex-snapshot
Verifying Concurrent Programs against Sequential Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_28openalex-snapshot
Software Verification for Weak Memory via Program Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-38856-9_7openalex-snapshot
Predicate Abstraction for Relaxed Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_11openalex-snapshot
A High-Level Semantics for Program Execution under Total Store Order Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_9openalex-snapshot
Partial Orders for Efficient Bounded Model Checking of Concurrent Software
inferred← citeshttps://doi.org/10.1007/978-3-662-44202-9_8openalex-snapshot
Reusable Concurrent Data Types
inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_28openalex-snapshot
Stateless Model Checking for TSO and PSO
inferred← citeshttps://doi.org/10.1007/978-3-662-54580-5_4openalex-snapshot
Context-Bounded Analysis for POWER
inferred← citeshttps://doi.org/10.1007/s00165-011-0179-2openalex-snapshot
Symbolic predictive analysis for concurrent programs
inferred← citeshttps://doi.org/10.1007/s00236-016-0275-0openalex-snapshot
Stateless model checking for TSO and PSO
inferred← citeshttps://doi.org/10.1007/s00446-009-0092-6openalex-snapshot
Model checking transactional memories
inferred← citeshttps://doi.org/10.1007/s00450-013-0251-7openalex-snapshot
Quantitative reactive modeling and verification
inferred← citeshttps://doi.org/10.1007/s10009-016-0429-yopenalex-snapshot
A general model checking framework for various memory consistency models
inferred← citeshttps://doi.org/10.1007/s10703-007-0041-6openalex-snapshot
Memory model sensitive bytecode verification
inferred← citeshttps://doi.org/10.1007/s10703-011-0131-3openalex-snapshot
Verification of STM on relaxed memory models
inferred← citeshttps://doi.org/10.1007/s11704-016-6192-0openalex-snapshot
The role of model checking in software engineering
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.05.009openalex-snapshot
Rewriting Semantics and Analysis of Concurrency Features for a C-like Language
inferred← citeshttps://doi.org/10.1016/j.scico.2011.07.005openalex-snapshot
Exploiting step semantics for efficient bounded model checking of asynchronous systems
inferred← citeshttps://doi.org/10.1109/ase.2013.6693063openalex-snapshot
Proving MCAPI executions are correct using SMT
inferred← citeshttps://doi.org/10.1109/cgo.2009.29openalex-snapshot
Detecting and Eliminating Potential Violations of Sequential Consistency for Concurrent C/C++ Programs
inferred← citeshttps://doi.org/10.1109/csf.2014.14openalex-snapshot
Noninterference under Weak Memory Models
inferred← citeshttps://doi.org/10.1109/fmcad.2014.6987595openalex-snapshot
Efficient verification of periodic programs using sequential consistency and snapshots
inferred← citeshttps://doi.org/10.1109/fmcad.2015.7542261openalex-snapshot
Pattern-based synthesis of synchronization for the C++ memory model
inferred← citeshttps://doi.org/10.1109/fmcad.2016.7886679openalex-snapshot
Lazy sequentialization for TSO and PSO via shared memory abstractions
inferred← citeshttps://doi.org/10.1109/hpca.2016.7446069openalex-snapshot
SCsafe: Logging sequential consistency violations continuously and precisely
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.47openalex-snapshot
A General Model Checking Framework for Various Memory Consistency Models
inferred← citeshttps://doi.org/10.1109/issre.2016.48openalex-snapshot
Detecting, Exposing, and Classifying Sequential Consistency Violations
inferred← citeshttps://doi.org/10.1109/issre.2018.00028openalex-snapshot
Bugaroo: Exposing Memory Model Bugs in Many-Core Systems
inferred← citeshttps://doi.org/10.1109/micro.2012.41openalex-snapshot
Vulcan: Hardware Support for Detecting Sequential Consistency Violations Dynamically
inferred← citeshttps://doi.org/10.1109/tase.2017.8285629openalex-snapshot
Assembly program verification for multiprocessors with relaxed memory model using SMT solver
inferred← citeshttps://doi.org/10.1109/tse.2015.2477820openalex-snapshot
Verifying Synchronization for Atomicity Violation Fixing
inferred← citeshttps://doi.org/10.1109/tse.2016.2521368openalex-snapshot
A Survey on Software Fault Localization
inferred← citeshttps://doi.org/10.1109/wcre.2010.14openalex-snapshot
Static Analysis for Understanding Shared Objects in Open Concurrent Java Programs
inferred← citeshttps://doi.org/10.1145/1375581.1375584openalex-snapshot
Race directed random testing of concurrent programs
inferred← citeshttps://doi.org/10.1145/1375581.1375598openalex-snapshot
Deriving linearizable fine-grained concurrent objects
inferred← citeshttps://doi.org/10.1145/1375581.1375599openalex-snapshot
Sketching concurrent data structures
inferred← citeshttps://doi.org/10.1145/1375581.1375626openalex-snapshot
Model checking transactional memories
inferred← citeshttps://doi.org/10.1145/1379022.1375584openalex-snapshot
Race directed random testing of concurrent programs
inferred← citeshttps://doi.org/10.1145/1379022.1375599openalex-snapshot
Sketching concurrent data structures
inferred← citeshttps://doi.org/10.1145/1379022.1375626openalex-snapshot
Model checking transactional memories
inferred← citeshttps://doi.org/10.1145/1453101.1453121openalex-snapshot
Randomized active atomicity violation detection in concurrent programs
inferred← citeshttps://doi.org/10.1145/1480881.1480929openalex-snapshot
The semantics of x86-CC multiprocessor machine code
inferred← citeshttps://doi.org/10.1145/1512475.1512478openalex-snapshot
Java memory model aware software validation
inferred← citeshttps://doi.org/10.1145/1556444.1556453openalex-snapshot
State-space exploration for concurrent algorithms under weak memory orderings
inferred← citeshttps://doi.org/10.1145/1594834.1480929openalex-snapshot
The semantics of x86-CC multiprocessor machine code
inferred← citeshttps://doi.org/10.1145/1595696.1595702openalex-snapshot
Symbolic pruning of concurrent program executions
inferred← citeshttps://doi.org/10.1145/1639949.1640106openalex-snapshot
The design of a task parallel library
inferred← citeshttps://doi.org/10.1145/1640089.1640106openalex-snapshot
The design of a task parallel library
inferred← citeshttps://doi.org/10.1145/1706299.1706303openalex-snapshot
On the verification problem for weak memory models
inferred← citeshttps://doi.org/10.1145/1707801.1706303openalex-snapshot
On the verification problem for weak memory models
inferred← citeshttps://doi.org/10.1145/1882291.1882301openalex-snapshot
Staged concurrent program analysis
inferred← citeshttps://doi.org/10.1145/1993316.1993521openalex-snapshot
Partial-coherence abstractions for relaxed memory models
inferred← citeshttps://doi.org/10.1145/1993498.1993521openalex-snapshot
Partial-coherence abstractions for relaxed memory models
inferred← citeshttps://doi.org/10.1145/2001420.2001436openalex-snapshot
Testing concurrent programs on relaxed memory models
inferred← citeshttps://doi.org/10.1145/2001420.2001438openalex-snapshot
Persuasive prediction of concurrency access anomalies
inferred← citeshttps://doi.org/10.1145/2063384.2063452openalex-snapshot
Efficient data race detection for distributed memory parallel programs
inferred← citeshttps://doi.org/10.1145/2248418.2248438openalex-snapshot
Symbolic consistency checking of OpenMp parallel programs
inferred← citeshttps://doi.org/10.1145/2254064.2254115openalex-snapshot
Dynamic synthesis for relaxed memory models
inferred← citeshttps://doi.org/10.1145/2261417.2261436openalex-snapshot
Distributed computing column 46
inferred← citeshttps://doi.org/10.1145/2261417.2261437openalex-snapshot
Automated model repair for distributed programs
inferred← citeshttps://doi.org/10.1145/2261417.2261438openalex-snapshot
Automatic inference of memory fences
inferred← citeshttps://doi.org/10.1145/2345141.2248438openalex-snapshot
Symbolic consistency checking of OpenMp parallel programs
inferred← citeshttps://doi.org/10.1145/2345156.2254115openalex-snapshot
Dynamic synthesis for relaxed memory models
inferred← citeshttps://doi.org/10.1145/2442516.2442557openalex-snapshot
Scalable data race detection for partitioned global address space programs
inferred← citeshttps://doi.org/10.1145/2464996.2465000openalex-snapshot
Scaling data race detection for partitioned global address space programs
inferred← citeshttps://doi.org/10.1145/2506164.2506174openalex-snapshot
Multi-core systems modeling for formal verification of parallel algorithms
inferred← citeshttps://doi.org/10.1145/2676870.2676878openalex-snapshot
Optimization of a General Model Checking Framework for Various Memory Consistency Models
inferred← citeshttps://doi.org/10.1145/2737924.2737956openalex-snapshot
Dynamic partial order reduction for relaxed memory models
inferred← citeshttps://doi.org/10.1145/2741948.2741960openalex-snapshot
High-performance determinism with total store order consistency
inferred← citeshttps://doi.org/10.1145/2786980openalex-snapshot
Leveraging Transactional Execution for Memory Consistency Model Emulation
inferred← citeshttps://doi.org/10.1145/2813885.2737956openalex-snapshot
Dynamic partial order reduction for relaxed memory models
inferred← citeshttps://doi.org/10.1145/2814270.2814286openalex-snapshot
AutoMO: automatic inference of memory order parameters for C/C++11
inferred← citeshttps://doi.org/10.1145/2814270.2814297openalex-snapshot
SATCheck: SAT-directed stateless model checking for SC and TSO
inferred← citeshttps://doi.org/10.1145/2818302.2818309openalex-snapshot
Making lock-free data structures verifiable with artificial transactions
inferred← citeshttps://doi.org/10.1145/2858965.2814286openalex-snapshot
AutoMO: automatic inference of memory order parameters for C/C++11
inferred← citeshttps://doi.org/10.1145/2858965.2814297openalex-snapshot
SATCheck: SAT-directed stateless model checking for SC and TSO
inferred← citeshttps://doi.org/10.1145/2883591.2883603openalex-snapshot
Making Lock-free Data Structures Verifiable with Artificial Transactions
inferred← citeshttps://doi.org/10.1145/2926697.2926700openalex-snapshot
Prescient memory: exposing weak memory model behavior by looking into the future
inferred← citeshttps://doi.org/10.1145/2983990.2984025openalex-snapshot
Maximal causality reduction for TSO and PSO
inferred← citeshttps://doi.org/10.1145/2983990.2984033openalex-snapshot
Modeling and analysis of remote memory access programming
inferred← citeshttps://doi.org/10.1145/3009837.3009883openalex-snapshot
Ogre and Pythia: an invariance proof method for weak consistency models
inferred← citeshttps://doi.org/10.1145/3018743.3018749openalex-snapshot
Checking Concurrent Data Structures Under the C/C++11 Memory Model
inferred← citeshttps://doi.org/10.1145/3022671.2984025openalex-snapshot
Maximal causality reduction for TSO and PSO
inferred← citeshttps://doi.org/10.1145/3022671.2984033openalex-snapshot
Modeling and analysis of remote memory access programming
inferred← citeshttps://doi.org/10.1145/3093333.3009883openalex-snapshot
Ogre and Pythia: an invariance proof method for weak consistency models
inferred← citeshttps://doi.org/10.1145/3132747.3132767openalex-snapshot
Lazy Diagnosis of In-Production Concurrency Bugs
inferred← citeshttps://doi.org/10.1145/3133877openalex-snapshot
Model checking copy phases of concurrent copying garbage collection with various memory models
inferred← citeshttps://doi.org/10.1145/3155284.3018749openalex-snapshot
Checking Concurrent Data Structures Under the C/C++11 Memory Model
inferred← citeshttps://doi.org/10.1145/3192366.3192415openalex-snapshot
Static serializability analysis for causal consistency
inferred← citeshttps://doi.org/10.1145/3236024.3236048openalex-snapshot
Concurrency verification with maximal path causality
inferred← citeshttps://doi.org/10.1145/3238147.3238223openalex-snapshot
Scheduling constraint based abstraction refinement for weak memory models
inferred← citeshttps://doi.org/10.1145/3241624.2926700openalex-snapshot
Prescient memory: exposing weak memory model behavior by looking into the future
inferred← citeshttps://doi.org/10.1145/3276505openalex-snapshot
Optimal stateless model checking under the release-acquire semantics
inferred← citeshttps://doi.org/10.1145/3296979.3192415openalex-snapshot
Static serializability analysis for causal consistency
inferred← citeshttps://doi.org/10.1145/3314221.3314604openalex-snapshot
Robustness against release/acquire semantics
inferred← citeshttps://doi.org/10.1145/3368826.3377910openalex-snapshot
Interactive debugging of concurrent programs under relaxed memory models
inferred← citeshttps://doi.org/10.1145/3428214openalex-snapshot
Satune: synthesizing efficient SAT encoders
inferred← citeshttps://doi.org/10.1145/3434285openalex-snapshot
Verifying observational robustness against a c11-style memory model
inferred← citeshttps://doi.org/10.1145/3445814.3446711openalex-snapshot
C11Tester: a race detector for C/C++ atomics
inferred← citeshttps://doi.org/10.1145/3445814.3446735openalex-snapshot
Jaaru: efficiently model checking persistent memory programs
inferred← citeshttps://doi.org/10.1145/3593054openalex-snapshot
Turn-based Spatiotemporal Coherence for GPUs
inferred← citeshttps://doi.org/10.1145/3622855openalex-snapshot
Static Analysis of Memory Models for SMT Encodings
inferred← citeshttps://doi.org/10.1145/3650212.3685549openalex-snapshot
Robustness against the C/C++11 Memory Model
inferred← citeshttps://doi.org/10.1145/3689802openalex-snapshot
Automated Robustness Verification of Concurrent Data Structure Libraries against Relaxed Memory Models
inferred← citeshttps://doi.org/10.1145/3704906openalex-snapshot
RELINCHE: Automatically Checking Linearizability under Relaxed Memory Consistency
inferred← citeshttps://doi.org/10.1145/3729277openalex-snapshot
Dynamic Robustness Verification against Weak Memory
inferred← citeshttps://doi.org/10.1561/2500000011openalex-snapshot
Principles of Eventual Consistency
inferred← citeshttps://doi.org/10.1587/transinf.2018edp7099openalex-snapshot
A Verification Framework for Assembly Programs Under Relaxed Memory Model Using SMT Solver
inferred← citeshttps://doi.org/10.23638/lmcs-14(1:9)2018openalex-snapshot
A Load-Buffer Semantics for Total Store Ordering
inferred← citeshttps://doi.org/10.23919/fmcad.2018.8603021openalex-snapshot
BMC with Memory Models as Modules
inferred← citeshttps://doi.org/10.25560/80540openalex-snapshot
Dynamic analysis for concurrent modern C/C++ applications
inferred← citeshttps://doi.org/10.48550/arxiv.1207.7264openalex-snapshot
Software Verification for Weak Memory via Program Transformation
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1629openalex-snapshot
Partial Orders for Efficient BMC of Concurrent Software
inferred← citeshttps://doi.org/10.48550/arxiv.1306.0077openalex-snapshot
Partition Consistency: A Case Study in Modeling Systems with Weak Memory Consistency and Proving Correctness of their Implementations
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6810openalex-snapshot
Herding Cats - Modelling, simulation, testing, and data-mining for weak memory
inferred← citeshttps://doi.org/10.48550/arxiv.1501.02069openalex-snapshot
Stateless Model Checking for TSO and PSO
inferred← citeshttps://doi.org/10.48550/arxiv.1512.01416openalex-snapshot
New Lace and Arsenic: adventures in weak memory with a program logic
inferred← citeshttps://doi.org/10.48550/arxiv.1605.02185openalex-snapshot
Stateless Model Checking for POWER
inferred← citeshttps://doi.org/10.48550/arxiv.1702.01655openalex-snapshot
Context-Bounded Model Checking for POWER
inferred← citeshttps://doi.org/10.48550/arxiv.1702.06704openalex-snapshot
Portability Analysis for Axiomatic Memory Models. PORTHOS: One Tool for all Models
inferred← citeshttps://doi.org/10.48550/arxiv.1703.04603openalex-snapshot
Locality and Singularity for Store-Atomic Memory Models
inferred← citeshttps://doi.org/10.48550/arxiv.1808.00843openalex-snapshot
Optimal Stateless Model Checking under the Release-Acquire Semantics
inferred← citeshttps://doi.org/10.48550/arxiv.2102.07901openalex-snapshot
C11Tester: A Race Detector for C/C++ Atomics Technical Report
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4541openalex-snapshot
Formalizing and verifying transactional memories
inferred← citeshttps://doi.org/10.5555/2682923.2682939openalex-snapshot
Efficient Verification of Periodic Programs using Sequential Consistency and Snapshots
showing the first 200 of 204 · page through all 204
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.