{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:28:44Z","timestamp":1725542924001},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540373766"},{"type":"electronic","value":"9783540373773"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_11","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T15:59:29Z","timestamp":1154534369000},"page":"158-172","source":"Crossref","is-referenced-by-count":8,"title":["A Complete Axiomatic Semantics for the CSP Stable-Failures Model"],"prefix":"10.1007","author":[{"given":"Yoshinao","family":"Isobe","sequence":"first","affiliation":[]},{"given":"Markus","family":"Roggenbach","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0028390","volume-title":"Theorem Proving in Higher Order Logics","author":"B. Dutertre","year":"1997","unstructured":"Dutertre, B., Schneider, S.: Using a PVS embedding of CSP to verify authentication protocols. In: Gunter, E.L., Felty, A.P. (eds.) TPHOLs 1997. LNCS, vol.\u00a01275, pp. 121\u2013136. Springer, Heidelberg (1997)"},{"key":"11_CR2","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"11_CR3","unstructured":"Isobe, Y., Roggenbach, M.: Webpage on Csp-Prover, \n                    \n                      http:\/\/staff.aist.go.jp\/y-isobe\/CSP-Prover\/CSP-Prover.html"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-31980-1_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y. Isobe","year":"2005","unstructured":"Isobe, Y., Roggenbach, M.: A Generic Theorem Prover of CSP Refinement. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 108\u2013123. Springer, Heidelberg (2005)"},{"key":"11_CR5","unstructured":"Isobe, Y., Roggenbach, M., Gruner, S.: Extending CSP-Prover by deadlock-analysis: Towards the verification of systolic arrays. In: FOSE 2005. Japanese Lecture Notes Series, vol.\u00a031, pp. 257\u2013266. Kindai-kagaku-sha (2005)"},{"key":"11_CR6","unstructured":"F.\u00a0S.\u00a0E. Limited. Failures-divergence refinement: FDR2, \n                    \n                      http:\/\/www.fsel.com\/"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0030541","volume-title":"A Generic Theorem Prover","author":"L.C. Paulson","year":"1994","unstructured":"Paulson, L.C.: A Generic Theorem Prover. LNCS, vol.\u00a0828. Springer, Heidelberg (1994)"},{"key":"11_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), \n                    \n                      http:\/\/web.comlab.ox.ac.uk\/oucl\/work\/bill.roscoe\/pubs.html\n                    \n                    \n                   Or No. 68"},{"key":"11_CR9","series-title":"IFIP Conference Proceedings","first-page":"5","volume-title":"FMOODS 2002","author":"S. Schneider","year":"2002","unstructured":"Schneider, S.: Verifying authentication protocol implementations. In: Jacobs, B., Rensink, A. (eds.) FMOODS 2002. IFIP Conference Proceedings, vol.\u00a0209, pp. 5\u201324. Kluwer, Dordrecht (2002)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-63533-5_17","volume-title":"FME \u201997 Industrial Applications and Strengthened Foundations of Formal Methods","author":"H. Tej","year":"1997","unstructured":"Tej, H., Wolff, B.: A corrected failure-divergence model for CSP in Isabelle\/HOL. In: Fitzgerald, J.S., Jones, C.B., Lucas, P. (eds.) FME 1997. LNCS, vol.\u00a01313, pp. 318\u2013337. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:16:15Z","timestamp":1558271775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11817949_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}