The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Detecting causal relationships in distributed computations: In search of the holy grail
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
The Temporal Logic of Reactive and Concurrent Systems
Manna, Z., & Pnueli, A. (1992) · Springer eBooks · doi:10.1007/978-1-4612-0931-7 · Cited by 2,958
Distributed snapshots: determining global states of distributed systems
Chandy, K. M., & Lamport, L. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214451.214456 · Cited by 2,443
Warshall, S. (1962) · Journal of the ACM · doi:10.1145/321105.321107 · Cited by 1,683
Lightweight causal and atomic group multicast
Birman, K., Schiper, A., & Stephenson, P. (1991) · ACM Transactions on Computer Systems · doi:10.1145/128738.128742 · Cited by 956
On the Development of Reactive Systems
Harel, D., & Pnueli, A. (1985) · Logics and Models of Concurrent Systems · doi:10.1007/978-3-642-82453-1_17 · Cited by 859
Debugging Parallel Programs with Instant Replay
Leblanc, & Mellor-Crummey (1987) · IEEE Transactions on Computers · doi:10.1109/tc.1987.1676929 · Cited by 763
The process group approach to reliable distributed computing
Birman, K. P. (1993) · Communications of the ACM · doi:10.1145/163298.163303 · Cited by 729
Optimistic recovery in distributed systems
Strom, R., & Yemini, S. (1985) · ACM Transactions on Computer Systems · doi:10.1145/3959.3962 · Cited by 722
Modeling concurrency with partial orders
Pratt, V. (1986) · International Journal of Parallel Programming · doi:10.1007/bf01379149 · Cited by 643
Exploiting virtual synchrony in distributed systems
Birman, K., & Joseph, T. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/37499.37515 · Cited by 601
Logical time in distributed computing systems
Fidge, C. (1991) · Computer · doi:10.1109/2.84874 · Cited by 478
Petri nets, event structures and domains
Nielsen, M., Plotkin, G. D., & Winskel, G. (2005) · Springer eBooks · doi:10.1007/bfb0022474 · Cited by 386
Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation
Mattern, F. (1993) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1993.1075 · Cited by 352
Self-citationMinkowski, H. (1984) · Teubner-Archiv zur Mathematik · doi:10.1007/978-3-7091-3071-1_5 · Cited by 299
Consistent detection of global predicates
Cooper, R., & Marzullo, K. (1991) · doi:10.1145/122759.122774 · Cited by 284
Algorithms for distributed termination detection
Mattern, F. (1987) · Distributed Computing · doi:10.1007/bf01782776 · Cited by 272
Self-citationRecovery in Distributed Systems Using Optimistic Message Logging and Checkpointing
Willy Zwaenepoel, Y., & Johnson, D. B. (1988) · Cited by 262
An introduction to event structures
Winskel, G. (1989) · Lecture Notes in Computer Science · doi:10.1007/bfb0013026 · Cited by 235
The causal ordering abstraction and a simple way to implement it
Raynal, M., Schiper, A., & Toueg, S. (1991) · Information Processing Letters · doi:10.1016/0020-0190(91)90008-6 · Cited by 222
Modeling concurrency with geometry
Pratt, V. (1991) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/99583.99625 · Cited by 217
Partial orders for parallel debugging
Fidge, C. J. (1988) · Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging · doi:10.1145/68210.69233 · Cited by 206
Concerning the size of logical clocks in distributed systems
Charron-Bost, B. (1991) · Information Processing Letters · doi:10.1016/0020-0190(91)90055-m · Cited by 204
An efficient implementation of vector clocks
Singhal, M., & Kshemkalyani, A. D. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90028-t · Cited by 175
A new algorithm to implement causal ordering
Schiper, A., Eggli, J., & Sandoz, A. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51687-5_45 · Cited by 157
Efficient solutions to the replicated log and dictionary problems
Wuu, G. T. J., & Bernstein, A. J. (1984) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/800222.806750 · Cited by 156
Slow memory: weakening consistency to enhance concurrency in distributed shared memories
Hutto, P. W., & Ahamad, M. (2002) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1990.89297 · Cited by 150
High-level debugging of distributed systems: The behavioral abstraction approach
Bates, P. C., & Wileden, J. C. (1983) · Journal of Systems and Software · doi:10.1016/0164-1212(83)90011-0 · Cited by 143
Optimal tracing and replay for debugging message-passing parallel programs
Netzer, R. H. B., & Miller, B. P. (2003) · ACM/IEEE Conference on Supercomputing (SC) · doi:10.1109/superc.1992.236654 · Cited by 129
Sacrificing serializability to attain high availability of data in an unreliable network
Fischer, M. J., & Michael, A. (1982) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/588111.588124 · Cited by 126
Breakpoints and halting in distributed programs
Miller, B. P., & Choi, J.-M. (2003) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/dcs.1988.12532 · Cited by 121
Optimal tracing and replay for debugging message-passing parallel programs
Netzer, R. H. B., & Miller, B. P. (1992) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/147877.148058 · Cited by 119
Recovery in distributed systems using optimistic message logging and checkpointing
Johnson, D. B., & Willy Zwaenepoel, Y. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90022-7 · Cited by 117
Causal distributed breakpoints
Fowler, J., & Willy Zwaenepoel, Y. (2002) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1990.89277 · Cited by 115
Synchronous, asynchronous, and causally ordered communication
Charron-Bost, B., Mattern, F., & Tel, G. (1996) · Distributed Computing · doi:10.1007/s004460050018 · Cited by 92
Self-citationGlobal events and global breakpoints in distributed systems
Haban, D., & Weigel, W. (2003) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.1988.11802 · Cited by 88
Implementing and programming causal distributed shared memory
Ahamad, M., Hutto, P. W., & John, R. (2002) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1991.148677 · Cited by 82
Detection of global state predicates
Marzullo, K., & Neiger, G. (1992) · Lecture notes in computer science · doi:10.1007/bfb0022452 · Cited by 78
Interleaving set temporal logic
Katz, S. M., & Peled, D. (1990) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90096-z · Cited by 76
Partial orders for parallel debugging
Fidge, C. (1988) · ACM SIGPLAN Notices · doi:10.1145/69215.69233 · Cited by 64
Detection of unstable predicates in distributed programs
Garg, V. K., & Waldecker, B. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56287-7_110 · Cited by 56
Concurrent common knowledge: defining agreement for asynchronous systems
Panangaden, P., & Taylor, K. (1992) · Distributed Computing · doi:10.1007/bf02252679 · Cited by 53
Exploiting locality in maintaining potential causality
Meldal, S., Sankar, S., & Vera, J. (1991) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/112600.112620 · Cited by 52
Cited by
Fundamentals of fault-tolerant distributed computing in asynchronous environments
Gärtner, F. C. (1999) · ACM Computing Surveys · doi:10.1145/311531.311532 · Cited by 346
Challenging implicit and explicit alcohol-related cognitions in young heavy drinkers
Wiers, R. W., Van De Luitgaarden, J., Van Den Wildenberg, E., & Smulders, F. T. Y. (2005) · Addiction · doi:10.1111/j.1360-0443.2005.01064.x · Cited by 238
Metadata
- Authors
- Schwarz, R., & Mattern, F.
- Venue
- Distributed Computing
- Published
- 1994-03
- Volume
- 7
- Issue
- 3
- Pages
- 149-174
- ISSN
- 0178-2770 (ISSN-L)
- 1432-0452
- OpenAlex
- W1981173460
- Cited by
- 430
- References
- 44
- FWCI
- 30.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.