{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:30:48Z","timestamp":1736400648426,"version":"3.32.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T00:00:00Z","timestamp":1146700800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2006,11,23]]},"DOI":"10.1007\/s00446-006-0004-y","type":"journal-article","created":{"date-parts":[[2006,5,3]],"date-time":"2006-05-03T14:57:35Z","timestamp":1146668255000},"page":"163-183","source":"Crossref","is-referenced-by-count":6,"title":["Efficient dependency tracking for relevant events in concurrent systems"],"prefix":"10.1007","volume":"19","author":[{"given":"Anurag","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"Vijay K.","family":"Garg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,4]]},"reference":[{"issue":"8","key":"4_CR1","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1109\/32.940566","volume":"27","author":"S. Alagar","year":"2001","unstructured":"Alagar, S., Venkatesan, S.: Techniques to tackle state explosion in global predicate detection. IEEE Trans. Softw. Eng. 27(8), 704 \u2013714 (2001)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Arora, A., Kulkarni, S.S., Demirbas, M.: Resettable vector clocks. In: Proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC), pp. 269\u2013278 (2000)","DOI":"10.1145\/343477.343628"},{"issue":"10","key":"4_CR3","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/32.637147","volume":"23","author":"K. Audenaert","year":"1997","unstructured":"Audenaert, K.: Clock trees: Logical clocks for programs with nested parallelism. IEEE Trans. Softw. Eng. 23(10), 646\u2013658 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"4_CR4","unstructured":"Babaoglu, O., Marzullo, K.: Consistent global states of distributed systems: Fundamental concepts and mechanisms. In: Mullender, S. (ed.) Distributed Systems, pp. 55\u201396. Addison-Wesley (1993)"},{"key":"4_CR5","unstructured":"Baldoni, R., Melideo, G.: Tradeoffs in message overhead versus detection time in causality tracking. Tech. Rep. 06-01, Dipartimento di Informatica e Sistemistica, Univ. of Rome (2000)"},{"issue":"12","key":"4_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/163298.163303","volume":"36","author":"K.P. Birman","year":"1993","unstructured":"Birman, K.P.: The process group approach to reliable distributed computing. Commun. ACM 36(12), 37\u201353 (1993)","journal-title":"Commun. ACM"},{"issue":"1","key":"4_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/7351.7478","volume":"5","author":"K.P. Birman","year":"1987","unstructured":"Birman, K.P., Joseph, T.A.: Reliable communication in the presence of failures. ACM Trans. Comput. Syst. 5(1), 47\u201376 (1987)","journal-title":"ACM Trans. Comput. Syst."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Cain, H.W., Lipasti, M.H.: Verifying sequential consistency using vector clocks. In: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, pp. 153\u2013154. ACM Press (2002)","DOI":"10.1145\/564870.564897"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(91)90055-M","volume":"39","author":"B. Charron-Bost","year":"1991","unstructured":"Charron-Bost, B.: Concerning the size of logical clocks in distributed systems. Inf. Process. Lett. 39, 11\u201316 (1991)","journal-title":"Inf. Process. Lett."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Cooper, R., Marzullo, K.: Consistent detection of global predicates. In: Proc. of the Workshop on Parallel and Distributed Debugging, pp. 163\u2013173. ACM\/ONR, Santa Cruz, CA (1991)","DOI":"10.1145\/122759.122774"},{"key":"4_CR11","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press (1990)"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51, 161\u2013166 (1950)","journal-title":"Ann. Math."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Dinning, A., Schonberg, E.: An empirical comparison of monitoring algorithms for access anomaly detection. In: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming, pp. 1\u201310. ACM Press (1990)","DOI":"10.1145\/99164.99165"},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0304-3975(96)00204-6","volume":"175","author":"S. Felsner","year":"1997","unstructured":"Felsner, S.: On-line chain partitions of orders. Theor. Comput. Sci. 175, 283\u2013292 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR15","unstructured":"Fidge, C.: Timestamps in message-passing systems that preserve the partial ordering. In: Proceedings of the 11th Australian Computer Science Conference, 10(1), 56\u201366 (1988)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Fowler, J., Zwaenepoel, W.: Causal distributed breakpoints. In: Proceedings of the 10th International Conference on Distributed Computing Systems, pp. 134\u2013141. IEEE, Paris, France (1990)","DOI":"10.1109\/ICDCS.1990.89277"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Garg, V.K., Skawratananond, C.: String realizers of posets with applications to distributed computing. In: 20th Annual ACM Symposium on Principles of Distributed Computing (PODC-00), pp. 72\u201380. ACM (2001)","DOI":"10.1145\/383962.383988"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Garg, V.K., Skawratananond, C.: On timestamping synchronous communications. In: 22nd International Conference on Distributed Computing Systems (ICDCS\u2019 02), pp. 552\u2013560. IEEE (2002)","DOI":"10.1109\/ICDCS.2002.1022305"},{"key":"4_CR19","unstructured":"Garg, V.K., Waldecker, B.: Detection of unstable predicates. In: Proceedings of the Workshop on Parallel and Distributed Debugging. ACM\/ONR, Santa Cruz, CA (1991)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Gidenstam, A., Papatriantafilou, M.: Adaptive plausible clocks. In: 24th International Conference on Distributed Computing Systems (ICDCS\u2019 04), pp. 86\u201393. IEEE (2004)","DOI":"10.1109\/ICDCS.2004.1281571"},{"issue":"3","key":"4_CR21","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/0196-6774(90)90022-7","volume":"11","author":"D.B. Johnson","year":"1990","unstructured":"Johnson, D.B., Zwaenepoel, W.: Recovery in distributed systems using optimistic message logging and checkpointing. J. Algorithms 11(3), 462\u2013491 (1990)","journal-title":"J. Algorithms"},{"issue":"6","key":"4_CR22","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.4153\/CJM-1981-097-8","volume":"33","author":"H.A. Kierstead","year":"1981","unstructured":"Kierstead, H.A.: Recursive colorings of highly recursive graphs. Can. J. Math 33(6), 1279\u20131290 (1981)","journal-title":"Can. J. Math"},{"issue":"7","key":"4_CR23","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"4_CR24","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02280830","volume":"8","author":"K. Marzullo","year":"1994","unstructured":"Marzullo, K., Sabel, L.: Efficient detection of a class of stable properties. Distributed Comput. 8(2), 81\u201391 (1994)","journal-title":"Distributed Comput."},{"issue":"3","key":"4_CR25","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01782776","volume":"2","author":"F. Mattern","year":"1987","unstructured":"Mattern, F.: Algorithms for distributed termination detection. Distributed Comput. 2(3), 161\u2013175 (1987)","journal-title":"Distributed Comput."},{"key":"4_CR26","unstructured":"Mattern, F.: Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms: Proceedings of the Int\u2019l Workshop on Parallel and Distributed Algorithms, pp. 215\u2013226 (1989)"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Mellor-Crummey, J.: On-the-fly detection of data races for programs with nested fork-join parallelism. In: Proceedings of the 1991 ACM\/IEEE Conference on Supercomputing, pp. 24\u201333. ACM Press (1991)","DOI":"10.1145\/125826.125861"},{"key":"4_CR28","unstructured":"Mostefaoui, A., Theel, O.: Reduction of timestamp sizes for causal event ordering. Tech. rep., Irisa (1996)"},{"key":"4_CR29","unstructured":"Netzer, R., Miller, B.: Detecting data races in parallel program executions. In: Advances in Languages and Compilers for Parallel Processing, pp. 109\u2013130. MIT Press (1990)"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Netzer, R.H.B., Miller, B.P.: Optimal tracing and replay for debugging message-passing parallel programs. In: Proceedings of the 1992 ACM\/IEEE conference on Supercomputing, pp. 502\u2013511. IEEE Computer Society Press (1992)","DOI":"10.1109\/SUPERC.1992.236654"},{"issue":"6","key":"4_CR31","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0020-0190(91)90008-6","volume":"39","author":"M. Raynal","year":"1991","unstructured":"Raynal, M., Schiper, A., Toueg, S.: The causal ordering abstraction and a simple way to implement it. Inf. Process. Lett. 39(6), 343\u2013350 (1991)","journal-title":"Inf. Process. Lett."},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Sen, K., Rosu, G., Agha, G.: Runtime safety analysis of multithreaded programs. In: Proc. of the 11th ACM Symposium on the Foundations of Software Engineering 2003 (2003)","DOI":"10.1145\/940071.940116"},{"issue":"10","key":"4_CR33","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0020-0190(92)90028-T","volume":"43","author":"M. Singhal","year":"1992","unstructured":"Singhal, M., Kshemkalyani, A.: An efficient implementation of vector clocks. Inf. Process. Lett. 43(10), 47\u201352 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"4_CR34","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1145\/3959.3962","volume":"3","author":"R.E. Strom","year":"1985","unstructured":"Strom, R.E., Yemeni, S.: Optimistic recovery in distributed systems. ACM Trans. Comput. Syst. 3(3), 204\u2013226 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Torres-Rojas, F., Ahamad, M.: Plausible clocks: Constant size logical clocks for distributed systems. In: Proceedings of 10th Int\u2019l Workshop Distributed Algorithms, pp. 71\u201388 (1996)","DOI":"10.1007\/3-540-61769-8_6"},{"key":"4_CR36","unstructured":"Ward, P.A.S.: A framework algorithm for dynamic, centralized dimension-bounded timestamps. In: Proceedings of the 2000 conference of the Centre for Advanced Studies on Collaborative research, p. 14 (2000)"},{"key":"4_CR37","unstructured":"West, D.B.: The Art of Combinatorics Volume III: Order and Optimization. Preprint edition"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0004-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-006-0004-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-006-0004-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T20:11:18Z","timestamp":1736367078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-006-0004-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,4]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,11,23]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s00446-006-0004-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2006,5,4]]}}}