{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:53:40Z","timestamp":1725828820119},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319235059"},{"type":"electronic","value":"9783319235066"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23506-6_6","type":"book-chapter","created":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T11:50:40Z","timestamp":1441281040000},"page":"44-61","source":"Crossref","is-referenced-by-count":1,"title":["Evaluation Trees for Proposition Algebra"],"prefix":"10.1007","author":[{"given":"Jan A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"Alban","family":"Ponse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,10]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1080\/11663081.1995.10510855","volume":"5","author":"JA Bergstra","year":"1995","unstructured":"Bergstra, J.A., Bethke, I., Rodenburg, P.H.: A propositional logic with 4 values: true, false, divergent and meaningless. Journal of Applied Non-Classical Logics 5(2), 199\u2013218 (1995)","journal-title":"Journal of Applied Non-Classical Logics"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S1567-8326(02)00018-8","volume":"51","author":"JA Bergstra","year":"2002","unstructured":"Bergstra, J.A., Loots, M.E.: Program algebra for sequential code. Journal of Logic and Algebraic Programming 51(2), 125\u2013156 (2002)","journal-title":"Journal of Logic and Algebraic Programming"},{"unstructured":"Bergstra, J.A., Ponse, A.: On Hoare-McCarthy algebras [cs.LO] (2010). \n                      http:\/\/arxiv.org\/abs\/1012.5059","key":"6_CR3"},{"doi-asserted-by":"crossref","unstructured":"Bergstra, J.A., Ponse, A.: Proposition algebra. ACM Transactions on Computational Logic 12(3), Article 21, 36 pages (2011)","key":"6_CR4","DOI":"10.1145\/1929954.1929958"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-29320-7_2","volume-title":"Fundamentals of Software Engineering","author":"JA Bergstra","year":"2012","unstructured":"Bergstra, J.A., Ponse, A.: Proposition algebra and short-circuit logic. In: Arbab, F., Sirjani, M. (eds.) FSEN 2011. LNCS, vol. 7141, pp. 15\u201331. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Bergstra, J.A., Ponse A.: Evaluation trees for proposition algebra. \n                      arXiv:1504.08321v2\n                      \n                     [cs.LO] (2015)","key":"6_CR6","DOI":"10.1007\/978-3-319-23506-6_6"},{"unstructured":"Bergstra, J.A., Ponse, A., Staudt, D.J.C.: Short-circuit logic. \n                      arXiv:1010.3674v4\n                      \n                     [cs.LO, math.LO] (version v1: October 2010) (2013)","key":"6_CR7"},{"doi-asserted-by":"crossref","unstructured":"de Boer, F.S., de Vries, F.-J., Olderog, E.-R., Ponse, A. (guest editors): Selected papers from the Workshop on Assertional Methods. Formal Aspects of Computing, 6(1 Supplement; Special issue) (1994)","key":"6_CR8","DOI":"10.1007\/BF01213600"},{"doi-asserted-by":"crossref","unstructured":"Harel, D.: Dynamic logic. In: Gabbay, D., G\u00fcnthner, F. (eds.) Handbook of Philosophical Logic, vol. II, pp. 497\u2013604. Reidel Publishing Company (1984)","key":"6_CR9","DOI":"10.1007\/978-94-009-6259-0_10"},{"unstructured":"Hayes, I.J., He Jifeng, Hoare, C.A.R., Morgan, C.C., Roscoe, A.W., Sanders, J.W., Sorensen, I.H., Spivey, J.M., Sufrin B.A.: Laws of programming. Communications of the ACM 3(8), 672\u2013686 (1987)","key":"6_CR10"},{"unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International (1985)","key":"6_CR11"},{"doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: A couple of novelties in the propositional calculus. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik 31(2), 173-178 (1985)","key":"#cr-split#-6_CR12.1","DOI":"10.1002\/malq.19850310905"},{"unstructured":"Republished. In: Hoare, C.A.R., Jones, C.B. (eds.) Essays in Computing Science. Series in Computer Science, pp. 325-331. Prentice Hall International (1989)","key":"#cr-split#-6_CR12.2"},{"unstructured":"Staudt, D.J.C.: Completeness for two left-sequential logics. MSc. thesis Logic, University of Amsterdam (May 2012). \n                      arXiv:1206.1936v1\n                      \n                     [cs.LO] (2012)","key":"6_CR13"},{"unstructured":"Wortel, L.: Side effects in steering fragments. MSc. thesis Logic, University of Amsterdam (September 2011). \n                      arXiv:1109.2222v1\n                      \n                     [cs.LO] (2011)","key":"6_CR14"}],"container-title":["Lecture Notes in Computer Science","Correct System Design"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23506-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:16:19Z","timestamp":1559250979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23506-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319235059","9783319235066"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23506-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}