Declarative interpretations of session-based concurrency

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

doi:10.1145/2790449.2790513

Declarative interpretations of session-based concurrency

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

Department of Applied Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-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 language	English
Title of host publication	Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming (PPDP '15)
Publisher	Association for Computing Machinery
Publication date	2015
Pages	67-78
ISBN (Print)	978-1-4503-3516-4
DOIs	https://doi.org/10.1145/2790449.2790513
Publication status	Published - 2015
Event	17th International Symposium on Principles and Practice of Declarative Programming - University of Siena, Siena, Italy Duration: 14 Jul 2015 → 16 Jul 2015 Conference number: 17 http://costa.ls.fi.upm.es/ppdp15/

Conference

Conference	17th International Symposium on Principles and Practice of Declarative Programming
Number	17
Location	University of Siena
Country	Italy
City	Siena
Period	14/07/2015 → 16/07/2015
Internet address	http://costa.ls.fi.upm.es/ppdp15/

Keywords

Concurrency
π -calculus
Concurrent constraint programming
Session types
Expressiveness

Access to Document

10.1145/2790449.2790513

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

Cite this

@inproceedings{68d380a230ed4271b5438e678c8b349d,

title = "Declarative interpretations of session-based concurrency",

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.",

keywords = "Concurrency, π -calculus, Concurrent constraint programming, Session types, Expressiveness",

author = "Mauricio Cano and Camilo Rueda and Hugo-Andr{\'e}s L{\'o}pez-Acosta and P{\'e}rez, {Jorge A.}",

year = "2015",

doi = "10.1145/2790449.2790513",

language = "English",

isbn = "978-1-4503-3516-4",

pages = "67--78",

booktitle = "Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming (PPDP '15)",

publisher = "Association for Computing Machinery",

address = "United States",

note = "17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015 ; Conference date: 14-07-2015 Through 16-07-2015",

url = "http://costa.ls.fi.upm.es/ppdp15/",

}

Cano , M, Rueda, C, López-Acosta, H-A & Pérez, JA 2015, Declarative interpretations of session-based concurrency. in Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming (PPDP '15). Association for Computing Machinery, pp. 67-78, 17th International Symposium on Principles and Practice of Declarative Programming, Siena, Italy, 14/07/2015. https://doi.org/10.1145/2790449.2790513

Declarative interpretations of session-based concurrency. / Cano , Mauricio ; Rueda, Camilo ; López-Acosta, Hugo-Andrés; Pérez, Jorge A. .

Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming (PPDP '15). Association for Computing Machinery, 2015. p. 67-78.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Declarative interpretations of session-based concurrency

AU - Cano , Mauricio

AU - Rueda, Camilo

AU - López-Acosta, Hugo-Andrés

AU - Pérez, Jorge A.

N1 - Conference code: 17

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - Concurrency

KW - π -calculus

KW - Concurrent constraint programming

KW - Session types

KW - Expressiveness

U2 - 10.1145/2790449.2790513

DO - 10.1145/2790449.2790513

M3 - Article in proceedings

SN - 978-1-4503-3516-4

SP - 67

EP - 78

BT - Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming (PPDP '15)

PB - Association for Computing Machinery

T2 - 17th International Symposium on Principles and Practice of Declarative Programming

Y2 - 14 July 2015 through 16 July 2015

ER -