{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:26:19Z","timestamp":1725909979907},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319675305"},{"type":"electronic","value":"9783319675312"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67531-2_9","type":"book-chapter","created":{"date-parts":[[2017,9,5]],"date-time":"2017-09-05T05:33:37Z","timestamp":1504589617000},"page":"138-154","source":"Crossref","is-referenced-by-count":0,"title":["Space Efficient Breadth-First and Level Traversals of Consistent Global States of Parallel Programs"],"prefix":"10.1007","author":[{"given":"Himanshu","family":"Chauhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay K.","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,6]]},"reference":[{"key":"9_CR1","unstructured":"Alagappan, R., Ganesan, A., Patel, Y., Pillai, T.S., Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H.: Correlated crash vulnerabilities. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16), GA, pp. 151\u2013167. USENIX Association (2016)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BFb0019404","volume-title":"Automated and Algorithmic Debugging","author":"S Alagar","year":"1993","unstructured":"Alagar, S., Venkatesan, S.: Hierarchy in testing distributed programs. In: Fritzson, P.A. (ed.) AADEBUG 1993. LNCS, vol. 749, pp. 101\u2013116. Springer, Heidelberg (1993). doi:\n10.1007\/BFb0019404"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"412","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, 412\u2013417 (2001)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-12002-2_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Ball","year":"2010","unstructured":"Ball, T., Burckhardt, S., Coons, K.E., Musuvathi, M., Qadeer, S.: Preemption sealing for efficient concurrency testing. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 420\u2013434. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-12002-2_35"},{"issue":"2","key":"9_CR5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1008625405476","volume":"8","author":"L Bianco","year":"1997","unstructured":"Bianco, L., Dell Olmo, P., Giordani, S.: An optimal algorithm to find the jump number of partially ordered sets. Comput. Optim. Appl. 8(2), 197\u2013210 (1997)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"KM Chandy","year":"1985","unstructured":"Chandy, K.M., Lamport, L.: Distributed snapshots: determining global states of distributed systems. ACM Trans. Comput. Syst. 3(1), 63\u201375 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9_CR7","unstructured":"Chang, Y., Garg, V.K.: Quicklex: a fast algorithm for consistent global states enumeration of distributed computations. In: 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14\u201317, 2015, Rennes, France, pp. 25:1\u201325:17 (2015)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chang, Y.-J., Garg, V.K.: A parallel algorithm for global states enumeration in concurrent systems. In: ACM SIGPLAN Notices, vol. 50, pp. 140\u2013149. ACM (2015)","DOI":"10.1145\/2688500.2688520"},{"key":"9_CR9","unstructured":"Chauhan, H., Garg, V.K.: Space efficient breadth-first and level traversals of consistent global states of parallel programs (extended version). \nhttps:\/\/arxiv.org\/abs\/1707.07788"},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0167-5060(08)70060-8","volume":"9","author":"M Chein","year":"1980","unstructured":"Chein, M., Habib, M.: The jump number of dags and posets: an introduction. Ann. Discrete Math. 9, 189\u2013194 (1980)","journal-title":"Ann. Discrete Math."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Chen, F., Serbanuta, T.F., Ro\u015fu, G.: jPredictor: a predictive runtime analysis tool for java. In: Proceedings of the International Conference on Software Engineering, pp. 221\u2013230 (2008)","DOI":"10.1145\/1368088.1368119"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Cooper, R., Marzullo, K.: Consistent detection of global predicates. In: Proceedings of the Workshop on Parallel and Distributed Debugging, Santa Cruz, CA, pp. 163\u2013173, May 1991","DOI":"10.1145\/122759.122774"},{"key":"9_CR13","unstructured":"Fidge, C.J.: Timestamps in message-passing systems that preserve the partial-ordering. In: Raymond, K. (ed.) Proceedings of the 11th Australian Computer Science Conference (ACSC), pp. 56\u201366, February 1988"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Freund, S.N.: FastTrack: efficient and precise dynamic race detection. In: Proceedings of the Conference on Programming Language Design and Implementation, pp. 121\u2013133 (2009)","DOI":"10.1145\/1542476.1542490"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-11928-6_22","volume-title":"Formal Concept Analysis","author":"B Ganter","year":"2010","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol. 5986, pp. 312\u2013340. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-11928-6_22"},{"key":"9_CR16","unstructured":"Garg, V.K.: Enumerating global states of a distributed computation. In: Proceedings of the International Conference on Parallel and Distributed Computing Systems, pp. 134\u2013139 (2003)"},{"issue":"3","key":"9_CR17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1109\/71.277788","volume":"5","author":"VK Garg","year":"1994","unstructured":"Garg, V.K., Waldecker, B.: Detection of weak unstable predicates in distributed programs. IEEE Trans. Parallel Distrib. Syst. 5(3), 299\u2013307 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2\u20133","key":"9_CR18","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0166-218X(00)00258-4","volume":"110","author":"M Habib","year":"2001","unstructured":"Habib, M., Medina, R., Nourine, L., Steiner, G.: Efficient algorithms on distributive lattices. Discrete Appl. Math. 110(2\u20133), 169\u2013187 (2001)","journal-title":"Discrete Appl. Math."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Huang, J., Zhang, C.: Persuasive prediction of concurrency access anomalies. In: Proceedings of the International Symposium on Software Testing and Analysis, pp. 144\u2013154 (2011)","DOI":"10.1145\/2001420.2001438"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Jegou, R., Medina, R., Nourine, L.: Linear space algorithm for on-line detection of global predicates. In: Proceedings of the International Workshop on Structures in Concurrency Theory, pp. 175\u2013189 (1995)","DOI":"10.1007\/978-1-4471-3078-9_12"},{"issue":"7","key":"9_CR21","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 (CACM) 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM (CACM)"},{"issue":"4","key":"9_CR22","first-page":"18","volume":"32","author":"L Lamport","year":"2001","unstructured":"Lamport, L., et al.: Paxos made simple. ACM Sigact News 32(4), 18\u201325 (2001)","journal-title":"ACM Sigact News"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Lu, S., Tucek, J., Qin, F., Zhou, Y.: AVIO: detecting atomicity violations via access interleaving invariants. In: Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 37\u201348 (2006)","DOI":"10.1145\/1168857.1168864"},{"key":"9_CR24","unstructured":"Mattern, F.: Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms: Proceedings of the Workshop on Distributed Algorithms (WDAG), pp. 215\u2013226 (1989)"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In Proceedings of Conference on Programming Language Design and Implementation, pp. 446\u2013455 (2007)","DOI":"10.1145\/1250734.1250785"},{"key":"9_CR26","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01110545","volume":"10","author":"G Pruesse","year":"1993","unstructured":"Pruesse, G., Ruskey, F.: Gray codes from antimatroids. Order 10, 239\u2013252 (1993)","journal-title":"Order"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Song, W., Gkountouvas, T., Birman, K., Chen, Q., Xiao, Z.: The freeze-frame file system. In: ACM Symposium on Cloud Computing (SOCC) (2016)","DOI":"10.1145\/2987550.2987578"},{"key":"9_CR28","unstructured":"Squire, M.B.: Enumerating the ideals of a poset. In: Ph.D. Dissertation, Department of Computer Science, North Carolina State University (1995)"},{"issue":"6","key":"9_CR29","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0167-6377(86)90071-4","volume":"5","author":"G Steiner","year":"1986","unstructured":"Steiner, G.: An algorithm to generate the ideals of a partial order. Oper. Res. Lett. 5(6), 317\u2013320 (1986)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9_CR30","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00396269","volume":"1","author":"MM Sys\u0142o","year":"1984","unstructured":"Sys\u0142o, M.M.: Minimizing the jump number for partially ordered sets: a graph-theoretic approach. Order 1(1), 7\u201319 (1984)","journal-title":"Order"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"von Praun, C., Gross, T.R.: Object race detection. In: Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp. 70\u201382 (2001)","DOI":"10.1145\/504282.504288"}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67531-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,5]],"date-time":"2017-09-05T05:36:03Z","timestamp":1504589763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67531-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319675305","9783319675312"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67531-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}