Correspondence assertions for process synchronization in concurrent communications

  • Authors:

  • Eduardo Bonelli;Adriana Compagnoni;Elsa Gunter

  • Affiliations:

  • Stevens Institute of Technology, Castle Point on Hudson, Hoboken, NJ 07030, USA and LIFIA, Faculty of Informatics, University of La Plata, La Plata (CP 1900), Argentina http://guinness.cs.stevens. ...;Stevens Institute of Technology, Castle Point on Hudson, Hoboken, NJ 07030, USA http://www.cs.stevens.edu/~abc (email: abc@cs.stevens.edu);Department of Computer Science, University of Illinois at Urbana - Champaign, Thomas M. Siebel Center for Computer Science, 201 N. Goodwin, Urbana, IL 61801-2302 http://www.cs.uiuc.edu/~egunter (e ...

  • Venue:
  • Journal of Functional Programming
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

High-level specification of patterns of communications such as protocols can be modeled elegantly by means of session types (Honda et al., 1998). 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 (Clarke & Marrero, 1998; Gordon & Jeffrey, 2003b). 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. This new type system can be used to check: source of information, whether data is propagated as specified across multiple parties, if there are unspecified communications between parties, and if the data being exchanged has been modified by the code in an unspecified way. We prove that evaluation preserves typability and that well-typed processes are safe. Also, we illustrate how the resulting theory allows us to address shortcomings present in the pure theory of session types.