{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T16:55:41Z","timestamp":1673542541539},"reference-count":25,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2017,1,17]],"date-time":"2017-01-17T00:00:00Z","timestamp":1484611200000},"content-version":"vor","delay-in-days":578,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100003074","name":"Agencia Nacional de Promoci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","doi-asserted-by":"publisher","award":["PICT2012-2747"],"id":[{"id":"10.13039\/501100003074","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7,20]]},"DOI":"10.1093\/logcom\/exv037","type":"journal-article","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T22:15:39Z","timestamp":1434752139000},"page":"909-934","source":"Crossref","is-referenced-by-count":7,"title":["Justification logic and audited computation"],"prefix":"10.1093","volume":"28","author":[{"given":"Francisco","family":"Bavera","sequence":"first","affiliation":[{"name":"UNRC and CONICET, Argentina"}]},{"given":"Eduardo","family":"Bonelli","sequence":"additional","affiliation":[{"name":"UNQ, CONICET and ITBA, Argentina"}]}],"member":"286","published-online":{"date-parts":[[2015,6,19]]},"reference":[{"key":"key\n\t\t\t\t20180719090104_B1","article-title":"Access control based on execution history","volume-title":"NDSS","author":"Abadi","year":"2003"},{"key":"key\n\t\t\t\t20180719090104_B2","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45504-3_2","article-title":"Reflective \u03bb-calculus","volume-title":"Proceedings of the Dagstuhl-Seminar on Proof Theory in CS","author":"Alt","year":"2001"},{"key":"key\n\t\t\t\t20180719090104_B3","first-page":"12","article-title":"The intensional lambda calculus","volume-title":"LFCS","author":"Artemov","year":"2007"},{"key":"key\n\t\t\t\t20180719090104_B4","article-title":"Operational modal logic","volume-title":"Technical Report MSI 95-29","author":"Artemov","year":"1995"},{"key":"key\n\t\t\t\t20180719090104_B5","first-page":"1","article-title":"Explicit provability and constructive semantics","volume-title":"Bulletin of Symbolic Logic","author":"Artemov","year":"2001"},{"key":"key\n\t\t\t\t20180719090104_B6","first-page":"1","article-title":"Justification logic","volume-title":"JELIA","author":"Artemov","year":"2008"},{"key":"key\n\t\t\t\t20180719090104_B7","first-page":"27","article-title":"History-based access control and secure information flow","volume-title":"CASSIS","author":"Banerjee","year":"2004"},{"key":"key\n\t\t\t\t20180719090104_B8","volume-title":"Handbook of Logic in Computer Science","author":"Barendregt","year":"1992"},{"key":"key\n\t\t\t\t20180719090104_B9","first-page":"337","article-title":"Justification logic and history based computation","volume-title":"ICTAC","author":"Bavera","year":"2010"},{"key":"key\n\t\t\t\t20180719090104_B10","first-page":"76","article-title":"The logic of proofs as a foundation for certifying mobile computation","volume-title":"LFCS","author":"Bonelli","year":"2009"},{"key":"key\n\t\t\t\t20180719090104_B11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s11787-014-0098-0","article-title":"Hypothetical logic of proofs","volume":"8","author":"Bonelli","year":"2014","journal-title":"Logica Universalis"},{"key":"key\n\t\t\t\t20180719090104_B12"},{"key":"key\n\t\t\t\t20180719090104_B13"},{"key":"key\n\t\t\t\t20180719090104_B14","first-page":"511","article-title":"A judgmental reconstruction of modal logic","volume":"11","author":"Davies","year":"2001","journal-title":"Journal of MSCS"},{"key":"key\n\t\t\t\t20180719090104_B15","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/382780.382785","article-title":"A modal analysis of staged computation","volume":"48","author":"Davies","year":"2001","journal-title":"Journal of the ACM"},{"key":"key\n\t\t\t\t20180719090104_B16","first-page":"210","article-title":"Automated termination proofs with aprove","volume-title":"RTA","author":"Giesl","year":"2004"},{"key":"key\n\t\t\t\t20180719090104_B17","first-page":"219","article-title":"Modal proofs as distributed programs (extended abstract)","volume-title":"ESOP","author":"Jia","year":"2004"},{"key":"key\n\t\t\t\t20180719090104_B18","first-page":"11","article-title":"On the meaning of the logical constants and the justifications of the logical laws","volume":"1","author":"Martin-L\u00f6f","year":"1996","journal-title":"Nordic Journal of Philosophical Logic 1"},{"key":"key\n\t\t\t\t20180719090104_B19","first-page":"69","article-title":"Logical mobility and locality types","volume-title":"LOPSTR","author":"Moody","year":"2004"},{"key":"key\n\t\t\t\t20180719090104_B20","first-page":"286","article-title":"A symmetric modal lambda calculus for distributed computing","volume-title":"LICS","author":"Murphy","year":"2004"},{"key":"key\n\t\t\t\t20180719090104_B21","first-page":"51","article-title":"Distributed control flow with classical modal logic","volume-title":"CSL","author":"Murphy","year":"2005"},{"key":"key\n\t\t\t\t20180719090104_B22","first-page":"108","article-title":"Type-safe distributed programming with ml5","volume-title":"TGC","author":"Murphy","year":"2007"},{"key":"key\n\t\t\t\t20180719090104_B23","doi-asserted-by":"crossref","DOI":"10.1145\/1352582.1352591","article-title":"Contextual modal type theory","volume":"9","author":"Nanevski","year":"2008","journal-title":"ACM Transactions on Computational Logic"},{"key":"key\n\t\t\t\t20180719090104_B24"},{"key":"key\n\t\t\t\t20180719090104_B25","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/28\/5\/909\/25181218\/exv037.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T08:05:21Z","timestamp":1566893121000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/28\/5\/909\/2917815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,19]]},"references-count":25,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2015,6,19]]},"published-print":{"date-parts":[[2018,7,20]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exv037","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,7]]},"published":{"date-parts":[[2015,6,19]]}}}
