University of Leicester
Browse

Honesty by Typing

Download (706.73 kB)
journal contribution
posted on 2017-07-28, 08:41 authored by Massimo Bartoletti, Alceste Scalas, Emilio Tuosto, Roberto Zunino
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.

History

Citation

Logical Methods in Computer Science

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Source

Full version of an Extended Abstract presented at FORTE’13.

Version

  • VoR (Version of Record)

Published in

Logical Methods in Computer Science

Publisher

IfCoLog (International Federation of Computational Logic)

issn

1860-5974

Acceptance date

2016-10-10

Copyright date

9410

Available date

2017-07-28

Publisher version

https://lmcs.episciences.org/2619

Language

en

Usage metrics

    University of Leicester Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC