{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:55:47Z","timestamp":1770753347814,"version":"3.50.0"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["295261"],"award-info":[{"award-number":["295261"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We propose a type system for a calculus of contracting processes. Processes\ncan establish sessions by stipulating contracts, and then can interact either\nby keeping the promises made, or not. Type safety guarantees that a typeable\nprocess is honest - that is, it abides by the contracts it has stipulated in\nall possible contexts, even in presence of dishonest adversaries. Type\ninference is decidable, and it allows to safely approximate the honesty of\nprocesses using either synchronous or asynchronous communication.<\/jats:p>","DOI":"10.2168\/lmcs-12(4:7)2016","type":"journal-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T10:07:20Z","timestamp":1502359640000},"source":"Crossref","is-referenced-by-count":7,"title":["Honesty by Typing"],"prefix":"10.46298","volume":"Volume 12, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3796-9774","authenticated-orcid":false,"given":"Massimo","family":"Bartoletti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1153-6164","authenticated-orcid":false,"given":"Alceste","family":"Scalas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Tuosto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Zunino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"key":"1296:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/2619\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/2619\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:12:14Z","timestamp":1681243934000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/2619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-12(4:7)2016","relation":{"is-same-as":[{"id-type":"arxiv","id":"1211.2609","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1211.2609","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/978-3-030-21759-4_8","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,27]]},"article-number":"2619"}}