{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T08:07:37Z","timestamp":1746086857407,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319076010"},{"type":"electronic","value":"9783319076027"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-07602-7_19","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T11:29:08Z","timestamp":1402572548000},"page":"310-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Compatibility Checking for Asynchronously Communicating Software"],"prefix":"10.1007","author":[{"given":"Meriem","family":"Ouederni","sequence":"first","affiliation":[]},{"given":"Gwen","family":"Sala\u00fcn","sequence":"additional","affiliation":[]},{"given":"Tevfik","family":"Bultan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,13]]},"reference":[{"key":"19_CR1","unstructured":"Singularity Design Note 5: Channel Contracts. Singularity RDK Documentation (v1.1) (2004). http:\/\/www.codeplex.com\/singularity"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BFb0028754","volume-title":"Computer Aided Verification","author":"PA Abdulla","year":"1998","unstructured":"Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy FIFO channels. In: Hu, A.J., Vardi, M.Y. (eds.) CAV1998. LNCS, vol. 1427, pp. 305\u2013318. Springer, Heidelberg (1998)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Basu, S., Bultan, T.: Choreography conformance via synchronizability. In: Proceedings of WWW\u201911, pp. 795\u2013804. ACM Press (2011)","DOI":"10.1145\/1963405.1963516"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Basu, S., Bultan, T., Ouederni, M.: Deciding choreography realizability. In: Proceedings of POPL\u201912, pp. 191\u2013202. ACM (2012)","DOI":"10.1145\/2103621.2103680"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bauer, S.S., Hennicker, R., Janisch, S.: Interface theories for (A)synchronously communicating modal I\/O-transition systems. In: Proceedings of FIT\u201910, EPTCS, vol. 46, pp. 1\u20138 (2010)","DOI":"10.4204\/EPTCS.46.1"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-12002-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"SS Bauer","year":"2010","unstructured":"Bauer, S.S., Mayer, P., Schroeder, A., Hennicker, R.: On weak modal compatibility, refinement, and the MIO workbench. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 175\u2013189. Springer, Heidelberg (2010)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Beyer, D., Chakrabarti, A., Henzinger, T.: Web service interfaces. In: Proceedings of WWW\u201905, pp. 148\u2013159. ACM (2005)","DOI":"10.1145\/1060745.1060770"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Bianculli, D., Giannakopoulou, D., Pasareanu, C.S.: Interface decomposition for service compositions. In: Proceedings of ICSE\u201911, pp. 501\u2013510. ACM (2011)","DOI":"10.1145\/1985793.1985862"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-31811-8_2","volume-title":"Technologies for E-Services","author":"L Bordeaux","year":"2005","unstructured":"Bordeaux, L., Sala\u00fcn, G., Berardi, D., Mecella, M.: When are two web services compatible? In: Shan, M.-C., Dayal, U., Hsu, M. (eds.) TES 2004. LNCS, vol. 3324, pp. 15\u201328. Springer, Heidelberg (2005)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-28756-5_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Bouajjani","year":"2012","unstructured":"Bouajjani, A., Emmi, M.: Bounded phase analysis of message-passing programs. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 451\u2013465. Springer, Heidelberg (2012)"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323\u2013342 (1983)","journal-title":"J. ACM"},{"key":"19_CR12","unstructured":"Bucchiarone, A., Melgratti, H., Severoni, F.: Testing service composition. In: Proceedings of ASSE\u201907 (2007)"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0167-6423(01)00002-8","volume":"41","author":"C Canal","year":"2001","unstructured":"Canal, C., Pimentel, E., Troya, J.M.: Compatibility and inheritance in software architectures. Sci. Comput. Program. 41(2), 105\u2013138 (2001)","journal-title":"Sci. Comput. Program."},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-540-85361-9_26","volume-title":"CONCUR 2008 - Concurrency Theory","author":"P Darondeau","year":"2008","unstructured":"Darondeau, P., Genest, B., Thiagarajan, P.S., Yang, S.: Quasi-static scheduling of communicating tasks. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 310\u2013324. Springer, Heidelberg (2008)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.: Interface automata. In: Proceedings of ESEC\/FSE\u201901, pp. 109\u2013120. ACM Press (2001)","DOI":"10.1145\/503271.503226"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-15375-4_24","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P-M Deni\u00e9lou","year":"2010","unstructured":"Deni\u00e9lou, P.-M., Yoshida, N.: Buffered communication analysis in distributed multiparty sessions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 343\u2013357. Springer, Heidelberg (2010)"},{"issue":"7\u20138","key":"19_CR17","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1016\/j.scico.2011.03.009","volume":"77","author":"F Dur\u00e1n","year":"2012","unstructured":"Dur\u00e1n, F., Ouederni, M., Sala\u00fcn, G.: A generic framework for N-protocol compatibility checking. Sci. Comput. Program. 77(7\u20138), 870\u2013886 (2012)","journal-title":"Sci. Comput. Program."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Foster, H., Uchitel, S., Kramer, J., Magee, J.: Compatibility verification for web service choreography. In: Proceedings of ICWS\u201904. IEEE Computer Society (2004)","DOI":"10.1109\/ICWS.2004.1314806"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-19835-9_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H Garavel","year":"2011","unstructured":"Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2010: a toolbox for the construction and analysis of distributed processes. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 372\u2013387. Springer, Heidelberg (2011)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/BFb0032063","volume-title":"International Colloquium for Automata, Languages and Programming","author":"JF Groote","year":"1990","unstructured":"Groote, J.F., Vaandrager, F.W.: An efficient algorithm for branching bisimulation and stuttering equivalence. In: Michael, S.P. (ed.) ICALP 1990. LNCS, vol. 443, pp. 626\u2013638. Springer, Heidelberg (1990)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-33386-6_20","volume-title":"Automated Technology for Verification and Analysis","author":"M G\u00fcdemann","year":"2012","unstructured":"G\u00fcdemann, M., Sala\u00fcn, G., Ouederni, M.: Counterexample guided synthesis of monitors for realizability enforcement. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 238\u2013253. Springer, Heidelberg (2012)"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-38697-8_20","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"S Haddad","year":"2013","unstructured":"Haddad, S., Hennicker, R., M\u00f8ller, M.H.: Channel properties of asynchronously composed Petri nets. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 369\u2013388. Springer, Heidelberg (2013)"},{"key":"19_CR23","unstructured":"ISO\/IEC. LOTOS \u2013 A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. International Standard 8807, ISO (1989)"},{"issue":"1","key":"19_CR24","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(93)90212-C","volume":"113","author":"T J\u00e9ron","year":"1993","unstructured":"J\u00e9ron, T., Jard, C.: Testing for unboundedness of FIFO channels. Theor. Comput. Sci. 113(1), 93\u2013117 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-03848-8_14","volume-title":"Business Process Management","author":"K Kaschner","year":"2009","unstructured":"Kaschner, K., Wolf, K.: Set algebra for service behavior: applications and constructions. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 193\u2013210. Springer, Heidelberg (2009)"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-24732-6_16","volume-title":"Model Checking Software","author":"S Leue","year":"2004","unstructured":"Leue, S., Mayr, R., Wei, W.: A scalable incomplete test for message buffer overflow in Promela models. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol. 2989, pp. 216\u2013233. Springer, Heidelberg (2004)"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-01364-5_12","volume-title":"Web Services and Formal Methods","author":"N Lohmann","year":"2009","unstructured":"Lohmann, N.: Why does my service have no partners? In: Bruni, R., Wolf, K. (eds.) WS-FM 2008. LNCS, vol. 5387, pp. 191\u2013206. Springer, Heidelberg (2009)"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Martens, A., Moser, S. Gerhardt, A., Funk, K.: Analyzing compatibility of BPEL processes. In: Proceedings of AICT\/ICIW\u201906, pp. 147\u2013156. IEEE Computer Society (2006)","DOI":"10.1109\/AICT-ICIW.2006.48"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-68237-0_12","volume-title":"FM 2008: Formal Methods","author":"R Mateescu","year":"2008","unstructured":"Mateescu, R., Thivolle, D.: A model checking language for concurrent value-passing systems. In: Cuellar, J., Sere, K. (eds.) FM 2008. LNCS, vol. 5014, pp. 148\u2013164. Springer, Heidelberg (2008)"},{"issue":"2","key":"19_CR30","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1504\/IJBPIM.2006.010025","volume":"1","author":"G Sala\u00fcn","year":"2006","unstructured":"Sala\u00fcn, G., Bordeaux, L., Schaerf, M.: Describing and reasoning on web services using process algebra. Int. J. Bus. Process. Integr. Manage. 1(2), 116\u2013128 (2006)","journal-title":"Int. J. Bus. Process. Integr. Manage."},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-01918-0_2","volume-title":"Formal Methods for Web Services","author":"WMP van der Aalst","year":"2009","unstructured":"van der Aalst, W.M.P., Mooij, A.J., Stahl, C., Wolf, K.: Service interaction: patterns, formalization, and analysis. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol. 5569, pp. 42\u201388. Springer, Heidelberg (2009)"},{"issue":"3","key":"19_CR32","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ van Glabbeek","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43(3), 555\u2013600 (1996)","journal-title":"J. ACM"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Wong, P., Gibbons, J.: Verifying business process compatibility. In: Proceedings of QSIC\u201908, pp. 126\u2013131. IEEE Computer Society (2008)","DOI":"10.1109\/QSIC.2008.6"},{"issue":"2","key":"19_CR34","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/244795.244801","volume":"19","author":"DM Yellin","year":"1997","unstructured":"Yellin, D.M., Strom, R.E.: Protocol specifications and component adaptors. ACM Trans. Program. Lang. Syst. 19(2), 292\u2013333 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Component Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07602-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T08:46:36Z","timestamp":1675241196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07602-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319076010","9783319076027"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07602-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 June 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}