Declarative interpretations of session-based concurrency

Mauricio Cano , Camilo Rueda, Hugo-Andrés López-Acosta, Jorge A. Pérez

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

Session-based concurrency is a type-based approach to the analysis of communication-intensive systems. Correct behavior in these systems may be specified in an operational or declarative style: the former defines how interactions are structured; the latter defines governing conditions. In this paper, we investigate the relationship between operational and declarative models of session-based concurrency. We propose two interpretations of session π-calculus processes as declarative processes in linear concurrent constraint programming (lcc). They offer a basis on which both operational and declarative requirements can be specified and reasoned about. By coupling our interpretations with a type system for lcc, we obtain robust declarative encodings of π-calculus mobility.
Original languageEnglish
Title of host publicationProceedings of the 17th International Symposium on Principles and Practice of Declarative Programming (PPDP '15)
PublisherAssociation for Computing Machinery
Publication date2015
Pages67-78
ISBN (Print)978-1-4503-3516-4
DOIs
Publication statusPublished - 2015
Event17th International Symposium on Principles and Practice of Declarative Programming - University of Siena, Siena, Italy
Duration: 14 Jul 201516 Jul 2015
Conference number: 17
http://costa.ls.fi.upm.es/ppdp15/

Conference

Conference17th International Symposium on Principles and Practice of Declarative Programming
Number17
LocationUniversity of Siena
CountryItaly
CitySiena
Period14/07/201516/07/2015
Internet address

Keywords

  • Concurrency
  • π -calculus
  • Concurrent constraint programming
  • Session types
  • Expressiveness

Fingerprint Dive into the research topics of 'Declarative interpretations of session-based concurrency'. Together they form a unique fingerprint.

Cite this