The pairing of contracts and session types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5065 LNCS, Issue , 2008, Pages 681-700

  Laneve, Cosimo ^a   Padovani, Luca ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF URBINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

(PL) PROPERTIES; COMPLEX SYNCHRONIZATION; CONTROL PROTOCOLS; ENCODINGS; HEIDELBERG (CO); SESSION TYPES; SPRINGER (CO); SUBTYPING;

ENCODING (SYMBOLS); GRAPH THEORY;

CONTRACTS;

EID: 45849122507     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68679-8_42     Document Type: Conference Paper

References (16)

1. Asperti, A., Laneve, C.: Interaction systems I: The theory of optimal reductions. Mathematical Structures in Computer Science 4(4), 457-504 (1994)
2. Boreale, M., De Nicola, R., Pugliese, R.: Basic observables for processes. Information and Computation 149(1), 77-98 (1999)
3. Carpineti, S., Castagna, G., Laneve, C., Padovani, L.: A formal account of contracts for Web Services. In: Bravetti, M., Núñez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol. 4184, pp. 148-162. Springer, Heidelberg (2006)
4. Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. In: POPL 2008: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 261-272. ACM, New York (2008)
5. Cleaveland, R., Hennessy, M.: Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing 5(1), 1-20 (1993)
6. De Nicola, R.: Two complete axiom systems for a theory of communicating sequential processes. Information and Control 64(1-3), 136-172 (1985)
7. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 34, 83-133 (1984)
8. De Nicola, R., Hennessy, M.: CCS without T'S. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT1987. LNCS, vol. 249, pp. 138-152. Springer, Heidelberg (1987)
9. Dezani-Ciancaglini, M., de' Liguoro, U., Yoshida, N.: On Progress for Structured Communications. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol. 4912, pp. 257-275. Springer, Heidelberg (2008)
10. Dezani-Ciancaglini, M., Mostrous, D., Yoshida, N., Drossopoulou, S.: Session Types for Object-Oriented Languages. In: Thomas, D. (ed.) ECOOP 2006. LNCS, vol. 4067, pp. 328-352. Springer, Heidelberg (2006)
11. Gay, S., Hole, M.: Subtyping for session types in the π-calculus. Acta Informatica 42(2-3), 191-225 (2005)
12. Hennessy, M.: Acceptance trees. JACM: Journal of the ACM 32(4), 896-928 (1985)
13. Hennessy, M.: Algebraic Theory of Processes. Foundation of Computing. MIT Press, Cambridge (1988)
14. Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509-523. Springer, Heidelberg (1993)
15. Laneve, C., Padovani, L.: The must preorder revisited - an algebraic theory for web services contracts. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR. LNCS, vol. 4703, pp. 212-225. Springer, Heidelberg (2007)
16. Vasconcelos, V., Gay, S., Ravara, A.: Type checking a multithreaded functional language with session types. Theoretical Computer Science 368 (2006)