{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:59Z","timestamp":1725663599456},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564966"},{"type":"electronic","value":"9783540475729"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56496-9_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:13:04Z","timestamp":1330254784000},"page":"56-68","source":"Crossref","is-referenced-by-count":8,"title":["Using a theorem prover for reasoning about concurrent algorithms"],"prefix":"10.1007","author":[{"given":"Joakim","family":"Wright","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"L\u00e5ngbacka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01888227","volume":"2","author":"R. J. R. R. Back","year":"1990","unstructured":"R.J.R. Back and J. von Wright. Refinement concepts formalised in higher-order logic. Formal Aspects of Computing, 2:247\u2013272, 1990.","journal-title":"Formal Aspects of Computing"},{"issue":"9","key":"6_CR2","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/32.58786","volume":"16","author":"A. J. Camilleri","year":"1990","unstructured":"A.J. Camilleri. Mechanizing CSP trace theory in higher order logic. IEEE Transactions of Software Engineering, 16(9):993\u20131004, 1990.","journal-title":"IEEE Transactions of Software Engineering"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56\u201368, 1940.","journal-title":"Journal of Symbolic Logic"},{"unstructured":"The HOL System Documentation. Cambridge, 1989.","key":"6_CR4"},{"unstructured":"L. Lamport. A temporal logic of actions. Techn. Rep. 57, DEC Systems Research Center, April 1990.","key":"6_CR5"},{"unstructured":"L. Lamport. The temporal logic of actions. Manuscript, January 1991.","key":"6_CR6"},{"unstructured":"T.F. Melham. A mechanized theory of the \u03c0-calculus in HOL. Techn. Rep. 244, University of Cambridge Computer Laboratory, January 1992.","key":"6_CR7"},{"unstructured":"J. von Wright. Mechanising the temporal logic of actions in HOL. In Proceedings of the 1991 HOL Tutorial and Workshop. ACM, August 1991.","key":"6_CR8"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56496-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:53:04Z","timestamp":1619571184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56496-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564966","9783540475729"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-56496-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}