{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:02:20Z","timestamp":1746331340347,"version":"3.40.4"},"reference-count":35,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1093\/logcom\/exu032","type":"journal-article","created":{"date-parts":[[2014,5,29]],"date-time":"2014-05-29T07:22:36Z","timestamp":1401348156000},"page":"641-675","source":"Crossref","is-referenced-by-count":4,"title":["Proof automation for functional correctness in separation logic"],"prefix":"10.1093","volume":"26","author":[{"given":"Ewen","family":"Maclean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Ireland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gudmund","family":"Grov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2014,5,28]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Atkey R. 19th European Symposium on Programming. 2010. Amortised resource analysis with separation logic; p. 85-103.","key":"2016032907475278000_26.2.641.1","DOI":"10.1007\/978-3-642-11957-6_6"},{"key":"2016032907475278000_26.2.641.2","first-page":"115","article-title":"Smallfoot: modular automatic assertion checking with separation logic","volume-title":"FMCO","volume":"4111","author":"Berdine","year":"2005"},{"doi-asserted-by":"publisher","key":"2016032907475278000_26.2.641.3","DOI":"10.1016\/j.entcs.2009.09.057"},{"doi-asserted-by":"crossref","unstructured":"Buchberger B. Talk B. B . Johannes Kepler University. Springer; 2004. Algorithm-supported mathematical theory exploration: A personal view and strategy; p. 236-250. Mathematical Theory, and Exploration Theorem Proving.","key":"2016032907475278000_26.2.641.4","DOI":"10.1007\/978-3-540-30210-0_20"},{"doi-asserted-by":"crossref","unstructured":"Bundy A. The use of explicit plans to guide inductive proofs. In: Lusk R. Overbeek R. , editors. 9th International Conference on Automated Deduction. Springer-Verlag; 1988. p. 111-120. Longer version available from Edinburgh as DAI Research Paper No. 349.","key":"2016032907475278000_26.2.641.5","DOI":"10.1007\/BFb0012826"},{"unstructured":"Bundy A. Smaill A. Hesketh J. Turning eureka steps into calculations in automatic program synthesis. In: Clarke S. L. H. , editor. Proceedings of UK IT 90. p. 221-6. IEE, 1990. Also available from Edinburgh as DAI Research Paper 448.","key":"2016032907475278000_26.2.641.6"},{"unstructured":"Burstall R. M. Machine Intelligence 7. Edinburgh, Scotland: Edinburgh University Press; 1972. Some techniques for proving correctness of programs; p. 23-50.","key":"2016032907475278000_26.2.641.7"},{"doi-asserted-by":"crossref","unstructured":"Calcagno C. Distefano D. O'Hearn P. W. Yang H. Compositional shape analysis by means of bi-abduction. In: Shao Z. Pierce B. C. , editors. Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009. ACM; 2009. p. 289-300.","key":"2016032907475278000_26.2.641.8","DOI":"10.1145\/1480881.1480917"},{"doi-asserted-by":"crossref","unstructured":"Chargu\u00e9raud A. Proceedings of the 16th ACM SIGPLAN conference on Functional Programming (ICFP). ACM; 2011. Characteristic formulae for the verification of imperative programs; p. 418-430.","key":"2016032907475278000_26.2.641.9","DOI":"10.1145\/2034773.2034828"},{"key":"2016032907475278000_26.2.641.10","first-page":"287","article-title":"A local shape analysis based on separation logic","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems, 12th International Conference, TACAS 2006 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS","volume":"3920","author":"Distefano","year":"2006"},{"doi-asserted-by":"crossref","unstructured":"Distefano D. Parkinson M. J. Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications. New York, NY, USA: ACM; 2008. jstar: towards practical verification for java; p. 213-226. 2008.","key":"2016032907475278000_26.2.641.11","DOI":"10.1145\/1449955.1449782"},{"key":"2016032907475278000_26.2.641.12","first-page":"279","article-title":"IsaPlanner: A prototype proof planner in Isabelle","volume-title":"Proceedings of CADE'03","volume":"2741","author":"Dixon","year":"2003"},{"key":"2016032907475278000_26.2.641.13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Gordon M. Collavizza H. Forward with hoare. Reflections on the Work of CAR Hoare 2010:101-121.","key":"2016032907475278000_26.2.641.14","DOI":"10.1007\/978-1-84882-912-1_5"},{"doi-asserted-by":"crossref","unstructured":"Gordon M. J. HOL: A proof generating system for higher-order logic. In: Birtwistle G. Subrahmanyam P. A. , editors. VLSI Specification, Verification and Synthesis. Kluwer; 1988.","key":"2016032907475278000_26.2.641.15","DOI":"10.1007\/978-1-4613-2007-4_3"},{"doi-asserted-by":"publisher","key":"2016032907475278000_26.2.641.16","DOI":"10.1007\/s10817-010-9193-y"},{"doi-asserted-by":"crossref","unstructured":"Lincoln P. D. Shankar N. LICS. IEEE Computer Society Press; 1994. Proof search in first-order linear logic and other cut-free sequent calculi; p. 282-291.","key":"2016032907475278000_26.2.641.17","DOI":"10.1109\/LICS.1994.316061"},{"key":"2016032907475278000_26.2.641.18","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1016\/j.jsc.2010.06.003","article-title":"Verifying pointer safety for programs with unknown calls","volume":"45","author":"Luo","year":"2010","journal-title":"Journal of Symbolic Computation: Special Issue on Invariant Generation and Advanced techniques for Reasoning about Loops"},{"key":"2016032907475278000_26.2.641.19","first-page":"275","article-title":"Mutation in linked data structures","volume-title":"Proceedings of the 13th International Conference on Formal Engineering Methods (ICFEM-11)","volume":"6991","author":"Maclean","year":"2011"},{"doi-asserted-by":"crossref","unstructured":"Maclean E. Ireland A. Grov G. Proceedings of the 16th IEEE Conference on Automated Software Engineering (ASE 2011). Lawrence, Kansas.: IEEE; 2011. The CORE system: Animation and functional correctness of pointer programs; p. 588-591.","key":"2016032907475278000_26.2.641.20","DOI":"10.1109\/ASE.2011.6100132"},{"unstructured":"Maclean E. Ireland A. Dixon L. Atkey R. Refinement and Term Synthesis in Loop Invariant Generation. In: Ireland A. Kovacs L. , editors. 2nd International Workshop on Invariant Generation (WING'09). 2009. p. 72-86.","key":"2016032907475278000_26.2.641.21"},{"unstructured":"Maclean E. Ireland A. Grov G. Synthesising Functional Invariants in Separation Logic. In: Bjorner N. Kovacs L. , editors. 3rd International Workshop on Invariant Generation (WING'09). 2009. p. 72-86.","key":"2016032907475278000_26.2.641.22"},{"unstructured":"Maclean E. Ireland A. Grov G. 3rd International Conference on Verified Software, Theories, Tools and Experiment: Tools and Experiments Workshop. 2010. Functional correctness for pointer programs.","key":"2016032907475278000_26.2.641.23"},{"key":"2016032907475278000_26.2.641.24","first-page":"343","article-title":"Practical tactics for separation logic","volume-title":"TPHOLs","volume":"5674","author":"Mccreight","year":"2009"},{"doi-asserted-by":"publisher","key":"2016032907475278000_26.2.641.25","DOI":"10.1016\/j.eswa.2011.06.055"},{"doi-asserted-by":"publisher","key":"2016032907475278000_26.2.641.26","DOI":"10.1007\/978-3-642-14052-5_34"},{"doi-asserted-by":"crossref","unstructured":"Nanevski A. Vafeiadis V. Berdine J. Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010. Madrid, Spain; 2010. Structuring the verification of heap-manipulating programs; p. 261-274.","key":"2016032907475278000_26.2.641.27","DOI":"10.1145\/1706299.1706331"},{"unstructured":"Nguyen H. H. David C. Qin S. Chin W. N. VMCAI'07. Vol. 4349. Springer; 2007. Automated verification of shape and size properties via separation logic. of Lecture Notes in Computer Science .","key":"2016032907475278000_26.2.641.28"},{"doi-asserted-by":"crossref","unstructured":"O'Hearn P. Reynolds J. Hongseok Y. Proceedings of CSL'01. Vol. 2142. Paris; 2001. Local reasoning about programs that alter data structures. of Lecture Notes in Computer Science .","key":"2016032907475278000_26.2.641.29","DOI":"10.1007\/3-540-44802-0_1"},{"key":"2016032907475278000_26.2.641.30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S1571-0661(05)01183-7","article-title":"Logic programming with bunched implications","volume":"17","author":"Pym","year":"1998","journal-title":"Electronic Notes in Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Reynolds J. C. Logic in Computer Science. IEEE Computer Society; 2002. Separation logic: a logic for shared mutable data structures; p. 55-74.","key":"2016032907475278000_26.2.641.31","DOI":"10.1109\/LICS.2002.1029817"},{"doi-asserted-by":"publisher","key":"2016032907475278000_26.2.641.32","DOI":"10.1007\/BF00885763"},{"doi-asserted-by":"publisher","key":"2016032907475278000_26.2.641.33","DOI":"10.1007\/978-3-642-03359-9_32"},{"doi-asserted-by":"crossref","unstructured":"Vafeiadis V. VMCAI 2009. Springer Berlin\/Heidelberg; 2009. Shape-value abstraction for verifying linearizability; p. 335-348.","key":"2016032907475278000_26.2.641.34","DOI":"10.1007\/978-3-540-93900-9_27"},{"key":"2016032907475278000_26.2.641.35","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/978-3-540-74407-8_18","article-title":"A marriage of rely\/guarantee and separation logic","volume-title":"CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings","volume":"4703","author":"Vafeiadis","year":"2007"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/26\/2\/641\/7950574\/exu032.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:49:41Z","timestamp":1746247781000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exu032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,28]]},"references-count":35,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2016,3,29]]},"published-print":{"date-parts":[[2016,4]]}},"alternative-id":["10.1093\/logcom\/exu032"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/exu032","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"type":"print","value":"0955-792X"},{"type":"electronic","value":"1465-363X"}],"subject":[],"published":{"date-parts":[[2014,5,28]]}}}