Correspondence assertions for process synchronization in concurrent communications

Título:

Correspondence assertions for process synchronization in concurrent communications

Autor:

Bonelli, Eduardo

Colaboradores:

; Gunter, Elsa L.; Compagnoni, Adriana

Temas:

PROGRAMACIÓN CONCURRENTECÁLCULO PICOMUNICACIÓN ENTRE PROCESOS

En:

Journal of Functional Programming, Special issue on Language-Based Security, 2005,Vol 15, 2 March 2005.EN: Electronic Notes in Theoretical Computer Science 97 (2004) 175–195.

Resumen:

High-level specification of patterns of communications such as protocols can be modeled elegantly by means of session types [14]. 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 [5,10]. 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. Keywords: Concurrent programming, pi-calculus, type systems, session types, correspondence assertions.

URL/DOI:

Medio:

Soporte electrónico

Tipo de documento:

Artículo

Idioma:

Inglés

Publicación:

, 2005

Puede solicitar más fácilmente el ejemplar con: A0052

Ver estantes