{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T02:10:26Z","timestamp":1739412626101,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046384"},{"type":"electronic","value":"9783642046391"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04639-1_5","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T13:37:25Z","timestamp":1257255445000},"page":"59-72","source":"Crossref","is-referenced-by-count":2,"title":["Towards Algebraic Separation Logic"],"prefix":"10.1007","author":[{"given":"Han-Hing","family":"Dang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"H\u00f6fner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"M\u00f6ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Birkhoff, G.: Lattice Theory, 3rd edn., vol.\u00a0XXV. American Mathematical Society, Colloquium Publications (1967)"},{"key":"5_CR2","volume-title":"Residuation Theory","author":"T. Blyth","year":"1972","unstructured":"Blyth, T., Janowitz, M.: Residuation Theory. Pergamon Press, Oxford (1972)"},{"key":"5_CR3","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman & Hall, Boca Raton (1971)"},{"key":"5_CR4","unstructured":"Dang, H.-H.: Algebraic aspects of separation logic. Technical Report 2009-01, Institut f\u00fcr Informatik (2009)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Dang, H.-H., H\u00f6fner, P., M\u00f6ller, B.: Towards algebraic separation logic. Technical Report 2009-12, Institut f\u00fcr Informatik, Universit\u00e4t Augsburg (2009)","DOI":"10.1007\/978-3-642-04639-1_5"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0020-0255(01)00168-2","volume":"139","author":"J. Desharnais","year":"2001","unstructured":"Desharnais, J., M\u00f6ller, B.: Characterizing Determinacy in Kleene Algebras. Information Sciences\u00a0139, 253\u2013273 (2001)","journal-title":"Information Sciences"},{"key":"5_CR7","volume-title":"A discipline of programming","author":"E. Dijkstra","year":"1976","unstructured":"Dijkstra, E.: A discipline of programming. Prentice Hall, Englewood Cliffs (1976)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-540-24771-5_9","volume-title":"Relational and Kleene-Algebraic Methods in Computer Science","author":"T. Ehm","year":"2004","unstructured":"Ehm, T.: Pointer Kleene algebra. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2003. LNCS, vol.\u00a03051, pp. 99\u2013111. Springer, Heidelberg (2004)"},{"issue":"10","key":"5_CR9","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM\u00a012(10), 576\u2013580 (1969)","journal-title":"Communications of the ACM"},{"key":"5_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73595-3_19","volume-title":"Automated Deduction \u2013 CADE-21","author":"P. H\u00f6fner","year":"2007","unstructured":"H\u00f6fner, P., Struth, G.: Automated reasoning in Kleene algebra. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 279\u2013294. Springer, Heidelberg (2007)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.2307\/1989783","volume":"35","author":"E.V. Huntington","year":"1933","unstructured":"Huntington, E.V.: Boolean algebra. A correction. Transaction of AMS\u00a035, 557\u2013558 (1933)","journal-title":"Transaction of AMS"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"274","DOI":"10.2307\/1989325","volume":"35","author":"E.V. Huntington","year":"1933","unstructured":"Huntington, E.V.: New sets of independent postulates for the algebra of logic. Transaction of AMS\u00a035, 274\u2013304 (1933)","journal-title":"Transaction of AMS"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"J\u00f3nsson, B., Tarski, A.: Boolean algebras with operators, Part I. American Journal of Mathematics\u00a073 (1951)","DOI":"10.2307\/2372123"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0167-6423(93)90008-D","volume":"21","author":"B. M\u00f6ller","year":"1993","unstructured":"M\u00f6ller, B.: Towards pointer algebra. Science of Computer Prog.\u00a021(1), 57\u201390 (1993)","journal-title":"Science of Computer Prog."},{"issue":"3-4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0020-0255(99)00011-0","volume":"119","author":"B. M\u00f6ller","year":"1999","unstructured":"M\u00f6ller, B.: Calculating with acyclic and cyclic lists. Information Sciences\u00a0119(3-4), 135\u2013154 (1999)","journal-title":"Information Sciences"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.tcs.2006.12.035","volume":"375","author":"P. O\u2019Hearn","year":"2007","unstructured":"O\u2019Hearn, P.: Resources, concurrency, and local reasoning. Theoretical Computer Science\u00a0375, 271\u2013307 (2007)","journal-title":"Theoretical Computer Science"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44802-0_1","volume-title":"Computer Science Logic","author":"P.W. O\u2019Hearn","year":"2001","unstructured":"O\u2019Hearn, P.W., Reynolds, J.C., Yang, H.: Local reasoning about programs that alter data structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 1\u201319. Springer, Heidelberg (2001)"},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1498926.1498929","volume":"31","author":"P.W. O\u2019Hearn","year":"2009","unstructured":"O\u2019Hearn, P.W., Reynolds, J.C., Yang, H.: Separation and information hiding. ACM Trans. Program. Lang. Syst.\u00a031(3), 1\u201350 (2009)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: An introduction to separation logic. Proceedings Marktoberdorf Summer School (2008) (forthcoming)","DOI":"10.1007\/978-3-540-69149-5_49"},{"key":"5_CR20","unstructured":"Rosenthal, K.: Quantales and their applications. Pitman Research Notes in Mathematics Series\u00a0234 (1990)"}],"container-title":["Lecture Notes in Computer Science","Relations and Kleene Algebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04639-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T01:41:54Z","timestamp":1739410914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04639-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046384","9783642046391"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04639-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}