Declarative interpretations of session-based concurrency
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Standard
Declarative interpretations of session-based concurrency. / Cano, Mauricio; Rueda, Camilo; López, Hugo A.; Pérez, Jorge A.
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015. Association for Computing Machinery, Inc., 2015. s. 67-78.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - Declarative interpretations of session-based concurrency
AU - Cano, Mauricio
AU - Rueda, Camilo
AU - López, Hugo A.
AU - Pérez, Jorge A.
PY - 2015/7/14
Y1 - 2015/7/14
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 - Concurrent constraint programming
KW - Expressiveness
KW - Session types
KW - π-calculus
UR - http://www.scopus.com/inward/record.url?scp=84959860332&partnerID=8YFLogxK
U2 - 10.1145/2790449.2790513
DO - 10.1145/2790449.2790513
M3 - Article in proceedings
AN - SCOPUS:84959860332
SP - 67
EP - 78
BT - Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015
PB - Association for Computing Machinery, Inc.
T2 - 17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015
Y2 - 14 July 2015 through 16 July 2015
ER -
ID: 235144308