{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:28:38Z","timestamp":1725888518593},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602240"},{"type":"electronic","value":"9783319602257"}],"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-60225-7_17","type":"book-chapter","created":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T22:26:37Z","timestamp":1495837597000},"page":"236-242","source":"Crossref","is-referenced-by-count":1,"title":["EPTL - A Temporal Logic for Weakly Consistent Systems (Short Paper)"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Weber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annette","family":"Bieniusa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnd","family":"Poetzsch-Heffter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s10703-005-4592-0","volume":"26","author":"R Alur","year":"2005","unstructured":"Alur, R., McMillan, K., Peled, D.: Deciding global partial-order properties. Formal Methods Syst. Des. 26(1), 7\u201325 (2005)","journal-title":"Formal Methods Syst. Des."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, pp. 271\u2013284. ACM, New York (2014)","DOI":"10.1145\/2535838.2535848"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982). doi:\n10.1007\/BFb0025774"},{"issue":"11","key":"17_CR4","doi-asserted-by":"crossref","first-page":"1597","DOI":"10.1016\/j.ic.2006.07.002","volume":"204","author":"V Diekert","year":"2006","unstructured":"Diekert, V., Gastin, P.: Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Inf. Comput. 204(11), 1597\u20131619 (2006)","journal-title":"Inf. Comput."},{"key":"17_CR5","unstructured":"Havelund, K., Rosu, G.: Testing linear temporal logic formulae on finite execution traces. Technical report, RIACS (2001)"},{"issue":"7","key":"17_CR6","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":"78","key":"17_CR7","first-page":"1","volume":"6","author":"A Mazurkiewicz","year":"1977","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. Ser. 6(78), 1\u201351 (1977)","journal-title":"DAIMI Rep. Ser."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-24550-3_29","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Shapiro","year":"2011","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: Conflict-free replicated data types. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 386\u2013400. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-24550-3_29"},{"issue":"2","key":"17_CR10","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1006\/inco.2001.2956","volume":"179","author":"PS Thiagarajan","year":"2002","unstructured":"Thiagarajan, P.S., Walukiewicz, I.: An expressively complete linear time temporal logic for Mazurkiewicz traces. Inf. Comput. 179(2), 230\u2013249 (2002)","journal-title":"Inf. Comput."},{"key":"17_CR11","unstructured":"Weber, M., Bieniusa, A., Poetzsch-Heffter, A.: EPTL - a temporal logic for weakly consistent systems abs\/1704.05320 (2017). \nhttps:\/\/arxiv.org\/abs\/1704.05320"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60225-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T22:32:20Z","timestamp":1495837940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60225-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602240","9783319602257"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60225-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}