Please use this identifier to cite or link to this item:
Title: Honesty by Typing
Authors: Bartoletti, Massimo
Scalas, Alceste
Tuosto, Emilio
Zunino, Roberto
First Published: 28-Dec-2016
Presented at: Full version of an Extended Abstract presented at FORTE’13.
Publisher: IfCoLog (International Federation of Computational Logic)
Citation: Logical Methods in Computer Science
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
Version: Publisher Version
Status: Peer-reviewed
Type: Journal Article
Rights: This work is licensed under the Creative Commons Attribution-NoDerivs License. To view a copy of this license, visit or send a letter to Creative Commons, 171 Second St, Suite 300, San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany
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.