{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:33:13Z","timestamp":1743096793198,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562211"},{"type":"electronic","value":"9783031562228"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56222-8_1","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T08:02:30Z","timestamp":1710835350000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fairness and\u00a0Liveness Under Weak Consistency"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6832-6611","authenticated-orcid":false,"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8229-3481","authenticated-orcid":false,"given":"Mohamed Faouzi","family":"Atig","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7704-304X","authenticated-orcid":false,"given":"Adwait","family":"Godbole","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0925-398X","authenticated-orcid":false,"given":"Krishna","family":"Shankaranarayanan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5709-899X","authenticated-orcid":false,"given":"Mihir","family":"Vahanwala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10009-011-0216-8","volume":"14","author":"PA Abdulla","year":"2012","unstructured":"Abdulla, P.A.: Regular model checking. Int. J. Softw. Tools Technol. Transf. 14, 109\u2013118 (2012). https:\/\/doi.org\/10.1007\/s10009-011-0216-8","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Aronis, S., Jonsson, B., Sagonas, K.: Source sets: a foundation for optimal dynamic partial order reduction. J. ACM 64(4), 25:1\u201325:49 (2017)","DOI":"10.1145\/3073408"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-99336-8_12","volume-title":"Programming Languages and Systems","author":"PA Abdulla","year":"2022","unstructured":"Abdulla, P.A., Atig, M.F., Agarwal, R.A., Godbole, A., Krishna, S.: Probabilistic total store ordering. In: Sergey, I. (ed.) ESOP 2022. LNCS, vol. 13240, pp. 317\u2013345. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99336-8_12"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Godbole, A., Krishna, S., Vahanwala, M.: Overcoming memory weakness with unified fairness. In: Enea, C., Lal, A. (eds) Computer Aided Verification, CAV 2023, Part I. LNCS, vol. 13964, pp. 184\u2013205. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37706-8_10","DOI":"10.1007\/978-3-031-37706-8_10"},{"issue":"OOPSLA","key":"1_CR5","first-page":"1","volume":"3","author":"PA Abdulla","year":"2019","unstructured":"Abdulla, P.A., Atig, M.F., Jonsson, B., L\u00e5ng, M., Ngo, T.P., Sagonas, K.: Optimal stateless model checking for reads-from equivalence under sequential consistency. PACMPL 3(OOPSLA), 1\u201329 (2019)","journal-title":"PACMPL"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.ic.2005.05.008","volume":"202","author":"PA Abdulla","year":"2005","unstructured":"Abdulla, P.A., Bertrand, N., Rabinovich, A.M., Schnoebelen, P.: Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2), 141\u2013165 (2005)","journal-title":"Inf. Comput."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-23217-6_13","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"PA Abdulla","year":"2011","unstructured":"Abdulla, P.A., et al.: Advanced Ramsey-based B\u00fcchi automata inclusion testing. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 187\u2013202. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_13"},{"issue":"5","key":"1_CR8","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10009-015-0406-x","volume":"18","author":"P Abdulla","year":"2015","unstructured":"Abdulla, P., Haziza, F., Hol\u00edk, L.: Parameterized verification through view abstraction. Int. J. Softw. Tools Technol. Transf. 18(5), 495\u2013516 (2015). https:\/\/doi.org\/10.1007\/s10009-015-0406-x","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-78163-9_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"PA Abdulla","year":"2008","unstructured":"Abdulla, P.A., Ben Henda, N., Delzanno, G., Rezine, A.: Handling parameterized systems with non-atomic global conditions. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 22\u201336. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78163-9_7"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Henda, N.B., Mayr, R.: Verifying infinite Markov chains with a finite attractor or the global coarseness property. In: Proceedings of the 20th IEEE Symposium on Logic in Computer Science, LICS 2005, 26\u201329 June 2005, Chicago, IL, USA, pp. 127\u2013136. IEEE Computer Society (2005)","DOI":"10.1109\/LICS.2005.54"},{"issue":"4","key":"1_CR11","first-page":"1","volume":"3","author":"PA Abdulla","year":"2007","unstructured":"Abdulla, P.A., Ben Henda, N., Mayr, R.: Decisive Markov chains. LMCS 3(4), 1\u201332 (2007)","journal-title":"LMCS"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BFb0028760","volume-title":"Computer Aided Verification","author":"PA Abdulla","year":"1998","unstructured":"Abdulla, P.A., Jonsson, B., Kindahl, M., Peled, D.: A general approach to partial order reductions in symbolic verification. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 379\u2013390. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028760"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01784241","volume":"9","author":"M Ahamad","year":"1995","unstructured":"Ahamad, M., Neiger, G., Burns, J.E., Kohli, P., Hutto, P.W.: Causal memory: Definitions, implementation, and programming. Distrib. Comput. 9(1), 37\u201349 (1995)","journal-title":"Distrib. Comput."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Atig, M.F., Bouajjani, A., Burckhardt, S., Musuvathi, M.: On the verification problem for weak memory models. In: Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, pp. 7\u201318, New York, NY, USA. Association for Computing Machinery (2010)","DOI":"10.1145\/1706299.1706303"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Broy, M., Wirsing, M.: On the algebraic specification of nondeterministic programming languages. In: CAAP (1981)","DOI":"10.1007\/3-540-10828-9_61"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/3-540-55719-9_97","volume-title":"Automata, Languages and Programming","author":"E Chang","year":"1992","unstructured":"Chang, E., Manna, Z., Pnueli, A.: Characterization of temporal property classes. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 474\u2013486. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_97"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3329125","volume":"52","author":"R Glabbeek","year":"2019","unstructured":"Glabbeek, R., H\u00f6fner, P.: Progress, justness, and fairness. ACM Comput. Surv. 52, 1\u201338 (2019)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3505273","volume":"44","author":"O Lahav","year":"2022","unstructured":"Lahav, O., Boker, U.: What\u2019s decidable about causally consistent shared memory? ACM Trans. Program. Lang. Syst. 44(2), 1\u201355 (2022)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C\u201328","author":"L Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor that correctly executes multiprocess programs. IEEE Trans. Comput. C\u201328, 690\u2013691 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems - Specification. Springer, New York (1992). https:\/\/doi.org\/10.1007\/978-1-4612-0931-7","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"1_CR21","unstructured":"Corporate SPARC International, Inc.: The SPARC Architecture Manual (Version 9). Prentice-Hall Inc., USA (1994)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Wolper, P.: Expressing interesting properties of programs in propositional temporal logic. In: POPL, pp. 184\u2013193. ACM Press (1986)","DOI":"10.1145\/512644.512661"}],"container-title":["Lecture Notes in Computer Science","Taming the Infinities of Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56222-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T22:02:40Z","timestamp":1730930560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56222-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562211","9783031562228"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56222-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}}]}}