{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T23:32:57Z","timestamp":1725406377277},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.29007\/t6zs","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T21:38:50Z","timestamp":1516743530000},"page":"12-6","source":"Crossref","is-referenced-by-count":0,"title":["Towards a Cut-free Sequent Calculus for Boolean BI"],"prefix":"10.29007","volume":"12","author":[{"given":"Sungwoo","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonghyun","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"PSPL 2010. International Workshop on Proof Systems for Program Logics"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T21:38:53Z","timestamp":1516743533000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/KP"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/t6zs","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}