{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:00:08Z","timestamp":1725494408924},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69738-1_2","type":"book-chapter","created":{"date-parts":[[2007,11,12]],"date-time":"2007-11-12T12:58:07Z","timestamp":1194872287000},"page":"29-43","source":"Crossref","is-referenced-by-count":9,"title":["Verifying Compensating Transactions"],"prefix":"10.1007","author":[{"given":"Michael","family":"Emmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"bpel Specification v 1.1, \n                    \n                      http:\/\/www.ibm.com\/developerworks\/library\/ws-bpel"},{"key":"2_CR2","unstructured":"Business Process Modeling Language bpml, \n                    \n                      http:\/\/www.bpmi.org\/"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/11539452_30","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"R. Bruni","year":"2005","unstructured":"Bruni, R., Butler, M.J., Ferreira, C., Hoare, C.A.R., Melgratti, H.C., Montanari, U.: Comparing two approaches to compensable flow composition. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 383\u2013397. Springer, Heidelberg (2005)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/1040305.1040323","volume-title":"POPL 05","author":"R. Bruni","year":"2005","unstructured":"Bruni, R., Melgratti, H., Montanari, U.: Theoretical foundations for compensations in flow composition languages. In: POPL 05, pp. 209\u2013220. ACM Press, New York (2005)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-47884-1","volume-title":"Peer-to-Peer Systems","author":"M. Butler","year":"2002","unstructured":"Butler, M., Ferreira, C.: An operational semantics for StAC, a language for modeling business transactions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 87\u2013104. Springer, Heidelberg (2002)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/11423348_8","volume-title":"Communicating Sequential Processes","author":"M. Butler","year":"2005","unstructured":"Butler, M., Hoare, C.A.R., Ferreira, C.: A trace semantics for long-running transactions. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. LNCS, vol.\u00a03525, pp. 133\u2013150. Springer, Heidelberg (2005)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_56","volume-title":"Automata, Languages and Programming","author":"H. Comon","year":"2001","unstructured":"Comon, H., Cortier, V., Mitchell, J.: Tree automata with one memory, set constraints, and ping-pong protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, Springer, Heidelberg (2001)"},{"key":"2_CR8","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/1055558.1055571","volume-title":"PODS 04","author":"A. Deutsch","year":"2004","unstructured":"Deutsch, A., Sui, L., Vianu, V.: Specification and verification of data-driven web services. In: PODS 04, pp. 71\u201382. ACM Press, New York (2004)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-45089-0_18","volume-title":"Implementation and Application of Automata","author":"X. Fu","year":"2003","unstructured":"Fu, X., Bultan, T., Su, J.: Conversation protocols: A formalism for specification and verification of reactive electronic services. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 188\u2013200. Springer, Heidelberg (2003)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1145\/988672.988756","volume-title":"WWW 04","author":"X. Fu","year":"2004","unstructured":"Fu, X., Bultan, T., Su, J.: Analysis of interacting bpel web services. In: WWW 04, pp. 621\u2013630. ACM Press, New York (2004)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/38713.38742","volume-title":"SIGMOD 87","author":"H. Garcia-Molina","year":"1987","unstructured":"Garcia-Molina, H., Salem, K.: Sagas. In: SIGMOD 87, pp. 249\u2013259. ACM Press, New York (1987)"},{"key":"2_CR13","volume-title":"Transaction processing: Concepts and techniques","author":"J. Gray","year":"1993","unstructured":"Gray, J., Reuter, A.: Transaction processing: Concepts and techniques. Morgan Kaufmann, San Francisco (1993)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/773153.773154","volume-title":"PODS 03","author":"R. Hull","year":"2003","unstructured":"Hull, R., Benedikt, M., Christophides, V., Su, J.: E-services: a look behind the curtain. In: PODS 03, pp. 1\u201314. ACM Press, New York (2003)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/inco.2001.3122","volume":"173","author":"A. Ku\u010dera","year":"2002","unstructured":"Ku\u010dera, A., Mayr, R.: Simulation preorder over simple process algebras. Info. and Comp.\u00a0173, 184\u2013198 (2002)","journal-title":"Info. and Comp."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(00)00101-8","volume":"256","author":"R. Mayr","year":"2001","unstructured":"Mayr, R.: Decidability of model checking with the temporal logic EF. TCS\u00a0256, 31\u201362 (2001)","journal-title":"TCS"},{"key":"2_CR17","unstructured":"Web Services Conversation Language wscl 1.0, \n                    \n                      http:\/\/www.w3.org\/TR\/wscl10\/"},{"key":"2_CR18","unstructured":"wsfl Specification v 1.0, \n                    \n                      http:\/\/www-306.ibm.com\/software\/solutions\/webservices\/pdf\/WSFL.pdf"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69738-1_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:45:06Z","timestamp":1620017106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69738-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697350"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69738-1_2","relation":{},"subject":[]}}