{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:47:26Z","timestamp":1648655246816},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s10817-008-9111-8","type":"journal-article","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T05:10:22Z","timestamp":1229404222000},"page":"365-398","source":"Crossref","is-referenced-by-count":1,"title":["Assumption\u2013Commitment Support for CSP Model Checking"],"prefix":"10.1007","volume":"41","author":[{"given":"Nick","family":"Moffat","sequence":"first","affiliation":[]},{"given":"Michael","family":"Goldsmith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,12,17]]},"reference":[{"key":"9111_CR1","unstructured":"Formal Systems (Europe) Ltd: Failures-Divergence Refinement: FDR 2 User Manual (1992)"},{"issue":"8","key":"9111_CR2","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21(8), 666\u2013677 (1978)","journal-title":"Commun. ACM"},{"issue":"6","key":"9111_CR3","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1109\/32.232027","volume":"19","author":"A. Kay","year":"1993","unstructured":"Kay, A., Reed, J.N.: A rely and guarantee method for timed CSP: a specification and design of a telephone exchange. IEEE Trans. Softw. Eng. 19(6), 625\u2013639 (1993)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"7","key":"9111_CR4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"Misra, J., Chandy, K.M.: Proofs of networks of processes. IEEE Trans. Softw. Eng. 7(7), 417\u2013426 (1981)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9111_CR5","first-page":"622","volume-title":"Stepwise Refinment of Distributed Systems: Models, Formalisms, Correctness. Proceedings of REX Workshop, Mook, The Netherlands. LNCS 430","author":"P.K. Pandya","year":"1989","unstructured":"Pandya, P.K.: Some comments on the assumption\u2013commitment framework for compositional verification of distributed programs. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Stepwise Refinment of Distributed Systems: Models, Formalisms, Correctness. Proceedings of REX Workshop, Mook, The Netherlands. LNCS 430, pp. 622\u2013640. Springer, New York (1989)"},{"key":"9111_CR6","first-page":"168","volume-title":"Theoretical and Practical Aspects of SPIN Model Checking, 5th and 6th International SPIN Workshops, Trento, Italy, July 5, 1999, Toulouse, France, September 21 and 24 1999, Proceedings. LNCS 1680","author":"C. Pasareanu","year":"1999","unstructured":"Pasareanu, C., Dwyer, M.B., Huth, M.: Assume\u2013guarantee model checking of software: a comparative case study. In: Dams, D., Gerth, R., Leue, S., Massink, M. (eds.) Theoretical and Practical Aspects of SPIN Model Checking, 5th and 6th International SPIN Workshops, Trento, Italy, July 5, 1999, Toulouse, France, September 21 and 24 1999, Proceedings. LNCS 1680, pp. 168\u2013183. Springer, New York (1999)"},{"key":"9111_CR7","volume-title":"Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge Tracts in Theoretical Computer Science.","author":"W.-P. Roever de","year":"2001","unstructured":"de Roever, W.-P., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2001)"},{"key":"9111_CR8","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1998","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall, Englewood Cliffs (1998)"},{"key":"9111_CR9","unstructured":"Scattergood, J.B.: Tools for CSP and Timed CSP. DPhil thesis, Oxford University Computing Laboratory (1998)"},{"key":"9111_CR10","first-page":"89","volume-title":"Integrated Formal Methods. LNCS 3771","author":"S. Schneider","year":"2005","unstructured":"Schneider, S., Treharne, T., Evans, N.: Chunks: component verification in CSP||B. In: Romijn, J., Smith, G., van de Pol, J. (eds.) Integrated Formal Methods. LNCS 3771, pp. 89\u2013108. Springer, New York (2005)"},{"key":"9111_CR11","first-page":"541","volume-title":"Compositionality: The Significant Difference, Proceedings of the International Symposium COMPOS \u201897, Malente, Germany, September 7\u201312, 1997. LNCS 1536","author":"N. Shankar","year":"1998","unstructured":"Shankar, N.: Lazy compositional verification. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) Compositionality: The Significant Difference, Proceedings of the International Symposium COMPOS \u201897, Malente, Germany, September 7\u201312, 1997. LNCS 1536, pp. 541\u2013564. Springer, New York (1998)"},{"issue":"2","key":"9111_CR12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01214554","volume":"8","author":"K. St\u00f8len","year":"1996","unstructured":"St\u00f8len, K., Dederichs, F., Weber, R.: Specification and refinement of networks of asynchronously communicating agents using the assumption \/ commitment paradigm. Form. Asp. Comput. 8(2), 127\u2013161 (1996)","journal-title":"Form. Asp. Comput."},{"key":"9111_CR13","unstructured":"Zhou,\u00a0C.: Weakest environment of communicating processes. In: Margaria, T., Yi, W. (eds.) Proceedings of NCC \u201882, Houston. AFIPS, Houston (1982)"},{"key":"9111_CR14","volume-title":"Compositionality, Concurrency and Partial Correctness\u2014Proof Theories for Networks of Processes, and Their Relationship. LNCS 321","author":"J. Zwiers","year":"1989","unstructured":"Zwiers, J.: Compositionality, Concurrency and Partial Correctness\u2014Proof Theories for Networks of Processes, and Their Relationship. LNCS 321. Springer, New York (1989)"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-008-9111-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10817-008-9111-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-008-9111-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:21:48Z","timestamp":1559251308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10817-008-9111-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":14,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["9111"],"URL":"https:\/\/doi.org\/10.1007\/s10817-008-9111-8","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11]]}}}