Correspondence assertions for process synchronization in concurrent communications

Autores
Bonelli, Eduardo; Compagnoni, Adriana; Gunter, Elsa
Año de publicación
2004
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
High-level specification of patterns of communications such as protocols can be modeled elegantly by means of session types. However, a number of examples suggest that session types fall short when finer precision on protocol specification is required. In order to increase the expressiveness of session types we appeal to the theory of correspondence assertions. The resulting type discipline augments the types of long term channels with effects and thus yields types which may depend on messages read or written earlier within the same session. We prove that evaluation preserves typability and that well-typed processes are safe. Also, we illustrate how the resulting theory allows us to address the shortcomings present in the pure theory of session types.
Laboratorio de Investigación y Formación en Informática Avanzada
Materia
Ciencias Informáticas
Concurrent programming
Correspondence assertions
Pi-calculus
Session types
Type systems
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-nd/3.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/84912
Acceder
id SEDICI_72539b0ccbffc23727d183bb021572dd
oai_identifier_str oai:sedici.unlp.edu.ar:10915/84912
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Correspondence assertions for process synchronization in concurrent communicationsBonelli, EduardoCompagnoni, AdrianaGunter, ElsaCiencias InformáticasConcurrent programmingCorrespondence assertionsPi-calculusSession typesType systemsHigh-level specification of patterns of communications such as protocols can be modeled elegantly by means of session types. However, a number of examples suggest that session types fall short when finer precision on protocol specification is required. In order to increase the expressiveness of session types we appeal to the theory of correspondence assertions. The resulting type discipline augments the types of long term channels with effects and thus yields types which may depend on messages read or written earlier within the same session. We prove that evaluation preserves typability and that well-typed processes are safe. Also, we illustrate how the resulting theory allows us to address the shortcomings present in the pure theory of session types.Laboratorio de Investigación y Formación en Informática Avanzada2004-07-22info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf175-195http://sedici.unlp.edu.ar/handle/10915/84912enginfo:eu-repo/semantics/altIdentifier/issn/1571-0661info:eu-repo/semantics/altIdentifier/doi/10.1016/j.entcs.2004.04.036info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-nd/3.0/Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:16:15Zoai:sedici.unlp.edu.ar:10915/84912Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:16:15.371SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Correspondence assertions for process synchronization in concurrent communications
title Correspondence assertions for process synchronization in concurrent communications
spellingShingle Correspondence assertions for process synchronization in concurrent communications
Bonelli, Eduardo
Ciencias Informáticas
Concurrent programming
Correspondence assertions
Pi-calculus
Session types
Type systems
title_short Correspondence assertions for process synchronization in concurrent communications
title_full Correspondence assertions for process synchronization in concurrent communications
title_fullStr Correspondence assertions for process synchronization in concurrent communications
title_full_unstemmed Correspondence assertions for process synchronization in concurrent communications
title_sort Correspondence assertions for process synchronization in concurrent communications
dc.creator.none.fl_str_mv Bonelli, Eduardo
Compagnoni, Adriana
Gunter, Elsa
author Bonelli, Eduardo
author_facet Bonelli, Eduardo
Compagnoni, Adriana
Gunter, Elsa
author_role author
author2 Compagnoni, Adriana
Gunter, Elsa
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Concurrent programming
Correspondence assertions
Pi-calculus
Session types
Type systems
topic Ciencias Informáticas
Concurrent programming
Correspondence assertions
Pi-calculus
Session types
Type systems
dc.description.none.fl_txt_mv High-level specification of patterns of communications such as protocols can be modeled elegantly by means of session types. However, a number of examples suggest that session types fall short when finer precision on protocol specification is required. In order to increase the expressiveness of session types we appeal to the theory of correspondence assertions. The resulting type discipline augments the types of long term channels with effects and thus yields types which may depend on messages read or written earlier within the same session. We prove that evaluation preserves typability and that well-typed processes are safe. Also, we illustrate how the resulting theory allows us to address the shortcomings present in the pure theory of session types.
Laboratorio de Investigación y Formación en Informática Avanzada
description High-level specification of patterns of communications such as protocols can be modeled elegantly by means of session types. However, a number of examples suggest that session types fall short when finer precision on protocol specification is required. In order to increase the expressiveness of session types we appeal to the theory of correspondence assertions. The resulting type discipline augments the types of long term channels with effects and thus yields types which may depend on messages read or written earlier within the same session. We prove that evaluation preserves typability and that well-typed processes are safe. Also, we illustrate how the resulting theory allows us to address the shortcomings present in the pure theory of session types.
publishDate 2004
dc.date.none.fl_str_mv 2004-07-22
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/84912
url http://sedici.unlp.edu.ar/handle/10915/84912
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1571-0661
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.entcs.2004.04.036
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/3.0/
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-nd/3.0/
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)
dc.format.none.fl_str_mv application/pdf
175-195
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616034897625088
score 13.070432

Publicaciones similares