FMOODS 2013, FORTE 2013: Formal Techniques for Distributed Systems pp 305-320 | Cite as

Honesty by Typing

  • Massimo Bartoletti
  • Alceste Scalas
  • Emilio Tuosto
  • Roberto Zunino
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7892)

Abstract

We propose a type system for a calculus of contracting processes. Processes may stipulate contracts, and then either behave honestly, by keeping the promises made, or not. Type safety guarantees that a typeable process is honest — that is, the process abides by the contract it has stipulated in all possible contexts, even those containing dishonest adversaries.

Keywords

Type System Parallel Composition Channel Type Latent Contract Abstract Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full conference paper text

References

  1. 1.
    Bartoletti, M., Scalas, A., Tuosto, E., Zunino, R.: Honesty by typing. Technical report (2013), http://tcs.unica.it/publications
  2. 2.
    Bartoletti, M., Tuosto, E., Zunino, R.: Contract-oriented computing in CO2. Scientific Annals in Computer Science 22(1), 5–60 (2012)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bartoletti, M., Tuosto, E., Zunino, R.: On the realizability of contracts in dishonest systems. In: Sirjani, M. (ed.) COORDINATION 2012. LNCS, vol. 7274, pp. 245–260. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  4. 4.
    Bartoletti, M., Zunino, R.: A calculus of contracting processes. In: LICS (2010)Google Scholar
  5. 5.
    Bocchi, L., Honda, K., Tuosto, E., Yoshida, N.: A theory of design-by-contract for distributed multiparty interactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 162–176. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Bravetti, M., Zavattaro, G.: Towards a unifying theory for choreography conformance and contract compliance. In: Lumpe, M., Vanderperren, W. (eds.) SC 2007. LNCS, vol. 4829, pp. 34–50. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Bravetti, M., Zavattaro, G.: Contract-based discovery and composition of web services. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol. 5569, pp. 261–295. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  8. 8.
    Buscemi, M.G., Coppo, M., Dezani-Ciancaglini, M., Montanari, U.: Constraints for service contracts. In: Bruni, R., Sassone, V. (eds.) TGC 2011. LNCS, vol. 7173, pp. 104–120. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  9. 9.
    Buscemi, M.G., Montanari, U.: CC-pi: A constraint-based language for specifying service level agreements. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 18–32. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
    Carpineti, S., Castagna, G., Laneve, C., Padovani, L.: A formal account of contracts for web services. In: Bravetti, M., Núñez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol. 4184, pp. 148–162. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. ACM TOPLAS 31(5) (2009)Google Scholar
  12. 12.
    Chen, T.-C., Bocchi, L., Deniélou, P.-M., Honda, K., Yoshida, N.: Asynchronous distributed monitoring for multiparty session enforcement. In: Bruni, R., Sassone, V. (eds.) TGC 2011. LNCS, vol. 7173, pp. 25–45. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  13. 13.
    Chen, T.-C., Honda, K.: Specifying Stateful Asynchronous Properties for Distributed Programs. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 209–224. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  14. 14.
    Christensen, S.: Decidability and Decomposition in Process Algebras. PhD thesis, Edinburgh University (1993)Google Scholar
  15. 15.
    Coppo, M., Dezani-Ciancaglini, M., Yoshida, N., Padovani, L.: Global Progress for Dynamically Interleaved Multiparty Sessions (2013), http://www.di.unito.it/~padovani/Papers/CoppoDezaniYoshidaPadovani13.pdf
  16. 16.
    Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: POPL (2008)Google Scholar
  17. 17.
    Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. PhD thesis, Technische Universität München (1998)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2013

Authors and Affiliations

  • Massimo Bartoletti
    • 1
  • Alceste Scalas
    • 1
  • Emilio Tuosto
    • 2
  • Roberto Zunino
    • 3
  1. 1.Università degli Studi di CagliariItaly
  2. 2.University of LeicesterUK
  3. 3.Università degli Studi di Trento and COSBIItaly

Personalised recommendations