We propose a formal theory of contract-based computing. We model contracts as formulae in an intuitionistic logic extended with a "contractual" form of implication. Decidability holds for our logic: this allows us to mechanically infer the rights and the duties deriving from any set of contracts. We embed our logic in a core calculus of contracting processes, which combines features from concurrent constraints and calculi for multiparty sessions, while subsuming several idioms for concurrency.
Titolo: | A calculus of contracting processes | |
Autori: | ||
Data di pubblicazione: | 2010 | |
Handle: | http://hdl.handle.net/11584/23189 | |
ISBN: | 978-0-7695-4114-3 | |
Tipologia: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
main.pdf | Articolo principale | versione pre-print | Non specificato | Administrator Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.