M. Boreale & R. De Nicola (1996):
A symbolic semantics for the Pi-calculus.
Inform. and Comput. 126(1),
pp. 34–52.
M. Bravetti & G. Zavattaro (2007):
Towards a Unifying Theory for Choreography Conformance and Contract Compliance.
In: Software Composition,
Lect. Notes in Comput. Sci. 4829.
Springer Verlag,
pp. 34–50.
M.G. Buscemi & H. Melgratti (2009):
Abstract Processes in Orchestration Languages.
In: ESOP,
Lect. Notes in Comput. Sci. 5502.
Springer Verlag,
pp. 301–315.
Giuseppe Castagna, Nils Gesbert & Luca Padovani (2008):
A theory of contracts for web services.
In: POPL,
pp. 261–272.
Giuseppe Castagna, Nils Gesbert & Luca Padovani (2009):
A theory of contracts for Web services.
ACM Trans. Program. Lang. Syst. 31(5).
Available at http://doi.acm.org/10.1145/1538917.1538920.
R. De Nicola & M. Hennessy (1984):
Testing Equivalences for Processes.
Theoret. Comput. Sci. 34,
pp. 83–133.
Mariangiola Dezani-Ciancaglini, Dimitris Mostrous, Nobuko Yoshida & Sophia Drossopoulou (2006):
Session Types for Object-Oriented Languages.
In: Proc. ECOOP,
Lecture Notes in Computer Science 4067.
Springer,
pp. 328–352.
Simon J. Gay & Malcolm Hole (2005):
Subtyping for session types in the pi calculus.
Acta Informaticae 42(2–3),
pp. 191–225.
M. Hennessy & H. Lin (1995):
Symbolic bisimulations.
Theoret. Comput. Sci. 138,
pp. 353–389.
Kohei Honda (1993):
Types for Dynamic Interaction.
In: Proc. CONCUR,
Lecture Notes in Computer Science 715.
Springer,
pp. 509–523.
Cosimo Laneve & Luca Padovani (2007):
The Must Preorder Revisited.
In: CONCUR,
Lect. Notes in Comput. Sci. 4703,
pp. 212–225.
R. Milner (1989):
Communication and Concurrency.
Prentice Hall International.
eptcs@eptcs.org