Skip to main content
SpringerLink
Log in

Structured Communications with Concurrent Constraints

  • Conference paper
Trustworthy Global Computing (TGC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5474))

Included in the following conference series:

Abstract

We propose a calculus which combines concurrent constraints, name passing and sessions. In this way we get enough expressivity to represent both quality of services and safety of interaction between clients and servers. Central for the soundness of our calculus is a type assignment system whose main novelty is the assurance of channel bilinearity in presence of channel constraints, channel delegations and processes recursions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bistarelli, S., Montanari, U., Rossi, F.: Soft Concurrent Constraint Programming. ACM Transactions on Computational Logic 7(3), 1–27 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bonelli, E., Compagnoni, A., Gunter, E.: Correspondence Assertions for Process Synchronization in Concurrent Communications. Journal of Functional Programming 15(2), 219–248 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Buscemi, M., 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)

    Chapter  Google Scholar 

  4. Buscemi, M., Montanari, U.: Open Bisimulation for the Concurrent Constraint Pi-Calculus. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol. 4960, pp. 254–268. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Dezani-Ciancaglini, M., de’ Liguoro, U., Yoshida, N.: On Progress for Structured Communications. In: Barthe, G., Fournet, C. (eds.) TGC 2007 and FODO 2008. LNCS, vol. 4912, pp. 257–275. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Honda, K., Vasconcelos, V.T., Kubo, M.: Language Primitives and Type Discipline for Structured Communication-Based Programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122–138. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Parts I and II. Information and Computation 100(1) (1992)

    Google Scholar 

  8. Saraswat, V., Rinard, M.: Concurrent Constraint Programming. In: Allen, F.E. (ed.) POPL 1990, pp. 232–245. ACM Press, New York (1990)

    Google Scholar 

  9. Takeuchi, K., Honda, K., Kubo, M.: An Interaction-based Language and its Typing System. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 398–413. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  10. Wischik, L., Gardner, P.: Explicit Fusion. Theoretical Computer Science 340(3), 606–630 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Yoshida, N., Vasconcelos, V.T.: Language Primitives and Type Disciplines for Structured Communication-based Programming Revisited. In: Fernández, M., Kirchner, C. (eds.) SecRet 2006. ENTCS, vol. 171, pp. 73–93. Elsevier, Amsterdam (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, corso Svizzera 185, 10131, Torino, Italy

    Mario Coppo & Mariangiola Dezani-Ciancaglini

Authors
  1. Mario Coppo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mariangiola Dezani-Ciancaglini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Engineering and Informatics, University of Patras and RA CTI, 26500, Rion, Greece

    Christos Kaklamanis

  2. Department of Informatics and Mathematical Modelling, Richard Pedersens Plads, Technical University of Denmark, 2800, Kongens Lyngby, Denmark

    Flemming Nielson

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coppo, M., Dezani-Ciancaglini, M. (2009). Structured Communications with Concurrent Constraints. In: Kaklamanis, C., Nielson, F. (eds) Trustworthy Global Computing. TGC 2008. Lecture Notes in Computer Science, vol 5474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00945-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00945-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00944-0

  • Online ISBN: 978-3-642-00945-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation