{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:34:53Z","timestamp":1753889693040,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2012,9,21]],"date-time":"2012-09-21T00:00:00Z","timestamp":1348185600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Recently, data abstraction has been studied in the context of separation\nlogic, with noticeable practical successes: the developed logics have enabled\nclean proofs of tricky challenging programs, such as subject-observer patterns,\nand they have become the basis of efficient verification tools for Java\n(jStar), C (VeriFast) and Hoare Type Theory (Ynot). In this paper, we give a\nnew semantic analysis of such logic-based approaches using Reynolds's\nrelational parametricity. The core of the analysis is our lifting theorems,\nwhich give a sound and complete condition for when a true implication between\nassertions in the standard interpretation entails that the same implication\nholds in a relational interpretation. Using these theorems, we provide an\nalgorithm for identifying abstraction-respecting client-side proofs; the proofs\nensure that clients cannot distinguish two appropriately-related module\nimplementations.<\/jats:p>","DOI":"10.2168\/lmcs-8(3:22)2012","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T08:17:46Z","timestamp":1385713066000},"source":"Crossref","is-referenced-by-count":4,"title":["Two for the Price of One: Lifting Separation Logic Assertions"],"prefix":"10.46298","volume":"Volume 8, Issue 3","author":[{"given":"Jacob","family":"Thamsborg","sequence":"first","affiliation":[]},{"given":"Lars","family":"Birkedal","sequence":"additional","affiliation":[]},{"given":"Hongseok","family":"Yang","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2012,9,21]]},"reference":[{"key":"660:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/997\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/997\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:00:52Z","timestamp":1681243252000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/997"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,21]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-8(3:22)2012","relation":{"is-same-as":[{"id-type":"arxiv","id":"1208.5895","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1208.5895","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1145\/2491522.2491523","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2012,9,21]]},"article-number":"997"}}