We propose a calculus which combines concurrent constraints, name passing and sessions. In this way we get enough expressivity to represent both quality of services and safety of interaction between clients and servers. Central for the soundness of our calculus is a type assignment system whose main novelty is the assurance of channel bilinearity in presence of channel constraints, channel delegations and processes recursions.
Structured Communications with Concurrent Constraints
COPPO, Mario;DEZANI, Mariangiola
2009-01-01
Abstract
We propose a calculus which combines concurrent constraints, name passing and sessions. In this way we get enough expressivity to represent both quality of services and safety of interaction between clients and servers. Central for the soundness of our calculus is a type assignment system whose main novelty is the assurance of channel bilinearity in presence of channel constraints, channel delegations and processes recursions.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
StructuredCommunicati WithCC.pdf
Accesso riservato
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
364.35 kB
Formato
Adobe PDF
|
364.35 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
