Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/39781
Title: Honesty by Typing
Authors: Bartoletti, Massimo
Scalas, Alceste
Tuosto, Emilio
Zunino, Roberto
First Published: 28-Dec-2016
Publisher: IfCoLog (International Federation of Computational Logic)
Citation: Logical Methods in Computer Science, 2016, 12 (4:7), pp. 1-58
Abstract: We propose a type system for a calculus of contracting processes. Processes can establish sessions by stipulating contracts, and then can interact either by keeping the promises made, or not. Type safety guarantees that a typeable process is honest — that is, it abides by the contracts it has stipulated in all possible contexts, even in presence of dishonest adversaries. Type inference is decidable, and it allows to safely approximate the honesty of processes using either synchronous or asynchronous communication.
DOI Link: 10.2168/LMCS-12(4:7)2016
ISSN: 1860-5974
Links: http://www.lmcs-online.org/ojs/viewarticle.php?id=2054&layout=abstract
http://hdl.handle.net/2381/39781
Version: Publisher Version
Status: Peer-reviewed
Type: Journal Article
Rights: Copyright © the authors, 2016. This is an open-access article distributed under the terms of the Creative Commons Attribution-No Derivatives License (http://creativecommons.org/licenses/by-nd/2.0/), which permits use and distribution in any medium, provided the original work is properly cited, the use is non-commercial and no modifications or adaptations are made.
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
1211.2609.pdfPublished (publisher PDF)706.73 kBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.