On the public citation graph
Randomized testing of distributed systems with probabilistic guarantees
0 signed · 62 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-0-8176-4842-8_10openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1007/978-3-319-96142-2_20openalex-snapshot
Partial Order Aware Concurrency Sampling
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_7openalex-snapshot
Context-Bounded Model Checking of Concurrent Software
inferredcites →https://doi.org/10.1007/978-3-642-28756-5_31openalex-snapshot
Bounded Phase Analysis of Message-Passing Programs
inferredcites →https://doi.org/10.1007/s00446-006-0004-yopenalex-snapshot
Efficient dependency tracking for relevant events in concurrent systems
inferredcites →https://doi.org/10.1007/s11083-011-9197-1openalex-snapshot
On-Line Chain Partitions of Orders: A Survey
inferredcites →https://doi.org/10.1016/s0304-3975(96)00204-6openalex-snapshot
On-line chain partitions of orders
inferredcites →https://doi.org/10.1090/s0002-9947-1981-0628446-xopenalex-snapshot
An Effective Version of Dilworth's Theorem
inferredcites →https://doi.org/10.1109/ase.2013.6693072openalex-snapshot
Bita: Coverage-guided, automatic testing of actor programs
inferredcites →https://doi.org/10.1109/dsn.2011.5958223openalex-snapshot
Zab: High-performance broadcast for primary-backup systems
inferredcites →https://doi.org/10.1109/focs.2010.40openalex-snapshot
The Sub-exponential Upper Bound for On-Line Chain Partitioning
inferredcites →https://doi.org/10.1145/1040305.1040315openalex-snapshot
Dynamic partial-order reduction for model checking software
inferredcites →https://doi.org/10.1145/1250734.1250785openalex-snapshot
Iterative context bounding for systematic testing of multithreaded programs
inferredcites →https://doi.org/10.1145/1735970.1736040openalex-snapshot
A randomized scheduler with probabilistic guarantees of finding bugs
inferredcites →https://doi.org/10.1145/1736020.1736040openalex-snapshot
A randomized scheduler with probabilistic guarantees of finding bugs
inferredcites →https://doi.org/10.1145/2509136.2509538openalex-snapshot
Effective race detection for event-driven programs
inferredcites →https://doi.org/10.1145/2535838.2535845openalex-snapshot
Optimal dynamic partial order reduction
inferredcites →https://doi.org/10.1145/2737924.2737996openalex-snapshot
Asynchronous programming, analysis and testing with state machines
inferredcites →https://doi.org/10.1145/2755573.2755601openalex-snapshot
Race Detection in Two Dimensions
inferredcites →https://doi.org/10.1145/2786805.2786861openalex-snapshot
Systematic testing of asynchronous reactive systems
inferredcites →https://doi.org/10.1145/2813885.2737996openalex-snapshot
Asynchronous programming, analysis and testing with state machines
inferredcites →https://doi.org/10.1145/3158134openalex-snapshot
Why is random testing effective for partition tolerance bugs?
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.23919/fmcad.2017.8102245openalex-snapshot
Lasso detection using partial-state caching
inferredcites →https://doi.org/10.37236/7231openalex-snapshot
An Easy Subexponential Bound for Online Chain Partitioning
inferredcites →https://doi.org/10.48550/arxiv.1602.03755openalex-snapshot
Hitting Families of Schedules for Asynchronous Programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/smr.2555openalex-snapshot
Model‐checking‐driven explorative testing of CRDT designs and implementations
inferred← citeshttps://doi.org/10.1007/978-3-030-39322-9_18openalex-snapshot
Formalizing and Checking Multilevel Consistency
inferred← citeshttps://doi.org/10.1007/978-3-031-30820-8_26openalex-snapshot
Industrial-Strength Controlled Concurrency Testing for $$\textsc {C}{} \texttt {\#} $$ Programs with $$\textsc {Coyote} $$
inferred← citeshttps://doi.org/10.1007/978-3-031-67321-4_6openalex-snapshot
A Domain Specific Language for Testing Distributed Protocol Implementations
inferred← citeshttps://doi.org/10.1007/978-981-99-8664-4_11openalex-snapshot
Leveraging TLA$$^+$$ Specifications to Improve the Reliability of the ZooKeeperCoordination Service
inferred← citeshttps://doi.org/10.1109/ase51524.2021.9678838openalex-snapshot
Nekara: Generalized Concurrency Testing
inferred← citeshttps://doi.org/10.1109/icse-seip58684.2023.00009openalex-snapshot
Evolutionary Approach for Concurrency Testing of Ripple Blockchain Consensus Algorithm
inferred← citeshttps://doi.org/10.1109/isia55826.2022.9993590openalex-snapshot
Methodology for fast prototyping of distributed real-time systems
inferred← citeshttps://doi.org/10.1109/tr.2022.3218602openalex-snapshot
VPP-ART: An Efficient Implementation of Fixed-Size-Candidate-Set Adaptive Random Testing Using Vantage Point Partitioning
inferred← citeshttps://doi.org/10.1145/3293883.3295726openalex-snapshot
Checking linearizability using hitting families
inferred← citeshttps://doi.org/10.1145/3360591openalex-snapshot
On the complexity of checking transactional consistency
inferred← citeshttps://doi.org/10.1145/3360606openalex-snapshot
Trace aware random testing for distributed systems
inferred← citeshttps://doi.org/10.1145/3373376.3378484openalex-snapshot
Effective Concurrency Testing for Distributed Systems
inferred← citeshttps://doi.org/10.1145/3428221openalex-snapshot
DiffStream: differential output testing for stream processing programs
inferred← citeshttps://doi.org/10.1145/3428278openalex-snapshot
Testing consensus implementations using communication closure
inferred← citeshttps://doi.org/10.1145/3458336.3465276openalex-snapshot
Reasoning about modern datacenter infrastructures using partial histories
inferred← citeshttps://doi.org/10.1145/3552326.3587442openalex-snapshot
Model Checking Guided Testing for Distributed Systems
inferred← citeshttps://doi.org/10.1145/3575693.3575729openalex-snapshot
Probabilistic Concurrency Testing for Weak Memory Programs
inferred← citeshttps://doi.org/10.1145/3576915.3623097openalex-snapshot
Greybox Fuzzing of Distributed Systems
inferred← citeshttps://doi.org/10.1145/3586053openalex-snapshot
Randomized Testing of Byzantine Fault Tolerant Algorithms
inferred← citeshttps://doi.org/10.1145/3591247openalex-snapshot
Psym: Efficient Symbolic Exploration of Distributed Systems
inferred← citeshttps://doi.org/10.1145/3620665.3640389openalex-snapshot
Greybox Fuzzing for Concurrency Testing
inferred← citeshttps://doi.org/10.1145/3650212.3685309openalex-snapshot
Generalized Concurrency Testing Tool for Distributed Systems
inferred← citeshttps://doi.org/10.1145/3669940.3707214openalex-snapshot
Selectively Uniform Concurrency Testing
inferred← citeshttps://doi.org/10.1145/3689031.3696069openalex-snapshot
Multi-Grained Specifications for Distributed System Model Checking and Verification
inferred← citeshttps://doi.org/10.1145/3689779openalex-snapshot
Reward Augmentation in Reinforcement Learning for Testing Distributed Systems
inferred← citeshttps://doi.org/10.1145/3763060openalex-snapshot
Model-Guided Fuzzing of Distributed Systems
inferred← citeshttps://doi.org/10.1145/3830418.3843891openalex-snapshot
T amias : Feedback-Guided Systematic Concurrency Exploration for Transparent Distributed System Fuzzing
inferred← citeshttps://doi.org/10.21203/rs.3.rs-8223756/v1openalex-snapshot
COPRAS-Based Leader Election for Distributed Computing: A Multi-Criteria Decision Making Approach
inferred← citeshttps://doi.org/10.23919/fmcad.2018.8603016openalex-snapshot
Learning Linear Temporal Properties
inferred← citeshttps://doi.org/10.26599/tst.2024.9010023openalex-snapshot
Output Type Guided Random Test Case Generation for String Validation Routines
inferred← citeshttps://doi.org/10.48550/arxiv.1806.03953openalex-snapshot
Learning Linear Temporal Properties
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.