{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:38:38Z","timestamp":1743118718158,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597454"},{"type":"electronic","value":"9783319597461"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59746-1_13","type":"book-chapter","created":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T15:56:23Z","timestamp":1495814183000},"page":"237-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Full-Abstraction for Must Testing Preorders"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Bernardi","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Francalanza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,27]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-319-25150-9_33","volume-title":"Theoretical Aspects of Computing - ICTAC 2015","author":"JR Andersen","year":"2015","unstructured":"Andersen, J.R., Andersen, N., Enevoldsen, S., Hansen, M.M., Larsen, K.G., Olesen, S.R., Srba, J., Wortmann, J.K.: CAAL: concurrency workbench, Aalborg\u00a0edition. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 573\u2013582. Springer, Cham (2015). doi:10.1007\/978-3-319-25150-9_33"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Barbanera, F., de\u2019Liguoro, F.: Two notions of sub-behaviour for session-based client\/server systems. In: PPDP (2010)","DOI":"10.1145\/1836089.1836109"},{"key":"13_CR3","unstructured":"Bernardi, G.: Behavioural equivalences for web services. Ph.D. thesis, TCD (2013)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bernardi,G., Francalanza, A.: Full-abstraction for must testing preorders (extended abstract). https:\/\/www.irif.fr\/gio\/papers\/BFcoordination2017.pdf","DOI":"10.1016\/j.scico.2018.08.004"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bernardi, G., Hennessy, M.: Modelling session types using contracts. In: SAC (2012)","DOI":"10.1145\/2245276.2232097"},{"issue":"2","key":"13_CR6","first-page":"1","volume":"11","author":"G Bernardi","year":"2015","unstructured":"Bernardi, G., Hennessy, M.: Mutually testing processes. LMCS 11(2), 1\u201323 (2015)","journal-title":"LMCS"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bernardi, G., Hennessy, M.: Using higher-order contracts to model session types. LMCS 12(2), 1\u201343 (2016)","DOI":"10.2168\/LMCS-12(2:10)2016"},{"issue":"4","key":"13_CR8","first-page":"451","volume":"89","author":"M Bravetti","year":"2008","unstructured":"Bravetti, M., Zavattaro, G.: A foundational theory of contracts for multi-party service composition. Fundam. Inf. 89(4), 451\u2013478 (2008)","journal-title":"Fundam. Inf."},{"issue":"5","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1538917.1538920","volume":"31","author":"G Castagna","year":"2009","unstructured":"Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. ACM Trans. Program. Lang. Syst. 31(5), 1\u201361 (2009)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Cerone, A., Hennessy, M.: Process behaviour: formulae vs. tests. In: EXPRESS (2010)","DOI":"10.4204\/EPTCS.41.3"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-39910-0_9","volume-title":"Verification: Theory and Practice","author":"E Clarke","year":"2003","unstructured":"Clarke, E., Veith, H.: Counterexamples revisited: principles, algorithms, applications. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 208\u2013224. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-39910-0_9"},{"issue":"1\u20132","key":"13_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R De Nicola","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. TCS 34(1\u20132), 83\u201393 (1984)","journal-title":"TCS"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-49630-5_9","volume-title":"Foundations of Software Science and Computation Structures","author":"A Francalanza","year":"2016","unstructured":"Francalanza, A.: A theory of monitors. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 145\u2013161. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49630-5_9"},{"issue":"2\u20133","key":"13_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00236-005-0177-z","volume":"42","author":"SJ Gay","year":"2005","unstructured":"Gay, S.J., Hole, M.: Subtyping for session types in the pi calculus. Acta Inf. 42(2\u20133), 191\u2013225 (2005)","journal-title":"Acta Inf."},{"key":"13_CR15","volume-title":"Algebraic Theory of Processes","author":"M Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)"},{"key":"13_CR16","volume-title":"The Art of Computer Programming, Volume 1 (3rd Ed.): Fundamental Algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 1 (3rd Ed.): Fundamental Algorithms. Addison Wesley Longman Publishing Co., Inc., Redwood City (1997)"},{"key":"13_CR17","unstructured":"K\u00f6nig, D.: \u00dcber eine schlussweise aus dem endlichen ins unendliche. Acta Litt. ac. sci. Szeged 3, 121\u2013130 (1927)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-74407-8_15","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"C Laneve","year":"2007","unstructured":"Laneve, C., Padovani, L.: The Must preorder revisited. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 212\u2013225. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74407-8_15"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Luo, Q., Hariri, F., Eloussi, L., Marinov, D.: An empirical analysis of flaky tests. In: FSE (2014)","DOI":"10.1145\/2635868.2635920"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Marinescu, P., Hosek, P., Cadar, C.: Covrig: a framework for the analysis of code, test, and coverage evolution in real software. In: ISSTA (2014)","DOI":"10.1145\/2610384.2610419"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-31984-9_3","volume-title":"Fundamental Approaches to Software Engineering","author":"A Martens","year":"2005","unstructured":"Martens, A.: Analyzing web service based business processes. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 19\u201333. Springer, Heidelberg (2005). doi:10.1007\/978-3-540-31984-9_3"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Memon, A.M., Cohen, M.B.: Automated testing of GUI applications: models, tools, and controlling flakiness. In: ICSE (2013)","DOI":"10.1109\/ICSE.2013.6606750"},{"key":"13_CR23","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Upper Saddle River (1989)"},{"issue":"3\u20135","key":"13_CR24","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.jlap.2009.12.001","volume":"79","author":"AJ Mooij","year":"2010","unstructured":"Mooij, A.J., Stahl, C., Voorhoeve, M.: Relating fair testing and accordance for service replaceability. J. Log. Algebr. Program. 79(3\u20135), 233\u2013244 (2010)","journal-title":"J. Log. Algebr. Program."},{"issue":"37","key":"13_CR25","doi-asserted-by":"publisher","first-page":"3328","DOI":"10.1016\/j.tcs.2010.05.002","volume":"411","author":"L Padovani","year":"2010","unstructured":"Padovani, L.: Contract-based discovery of web services modulo simple orchestrators. TCS 411(37), 3328\u20133347 (2010)","journal-title":"TCS"},{"issue":"3","key":"13_CR26","first-page":"238","volume":"26","author":"L Padovani","year":"2016","unstructured":"Padovani, L.: Fair subtyping for multi-party session types. MSCS 26(3), 238\u2013302 (2016)","journal-title":"MSCS"},{"key":"13_CR27","volume-title":"Types and Programming Languages","author":"B Pierce","year":"2002","unstructured":"Pierce, B.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"issue":"2","key":"13_CR28","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ic.2006.06.002","volume":"205","author":"A Rensink","year":"2007","unstructured":"Rensink, A., Vogler, W.: Fair testing. Inf. Comput. 205(2), 125\u2013198 (2007)","journal-title":"Inf. Comput."},{"key":"13_CR29","unstructured":"Spaccasassi, C.: Language support for communicating transactions. Ph.D. thesis, TCD, (2015)"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-01364-5_14","volume-title":"Web Services and Formal Methods","author":"D Weinberg","year":"2009","unstructured":"Weinberg, D.: Efficient controllability analysis of open nets. In: Bruni, R., Wolf, K. (eds.) WS-FM 2008. LNCS, vol. 5387, pp. 224\u2013239. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-01364-5_14"},{"key":"13_CR31","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages: An Introduction","author":"G Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages: An Introduction. MIT Press, Cambridge (1993)"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59746-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T03:02:57Z","timestamp":1618974177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59746-1_13"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597454","9783319597461"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59746-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"27 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COORDINATION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Coordination Languages and Models","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Neuch\u00e2tel","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2017.discotec.org\/calls\/coordination-2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}