Eric Badouel & Philippe Darondeau (1991):
On Guarded Recursion..
Theor. Comput. Sci. 82(2),
pp. 403–408,
doi:10.1016/0304-3975(91)90231-P.
Franco Barbanera & Ugo de'Liguoro (2010):
Two notions of sub-behaviour for session-based client/server systems.
In: Proceedings of PPDP'10.
ACM,
pp. 155–164,
doi:10.1145/1836089.1836109.
Franco Barbanera, Mariangiola Dezani & Ugo de' Liguoro (2014):
Compliance for reversible client/server interactions.
In: Proceedings of BEAT 2014,
EPTCS.
To appear.
Franco Barbanera & Ugo de' Liguoro (2013):
Sub-behaviour relations for session-based client/server systems.
MSCS.
To appear.
Giovanni Bernardi & Matthew Hennessy (2013):
Modelling session types using contracts.
To appear in Mathematical Structures in Computer Science.
S. Carpineti, G. Castagna, C. Laneve & L. Padovani (2006):
A formal account of contracts for Web Services.
In: WS-FM, 3rd Int. Workshop on Web Services and Formal Methods,
LNCS 4184.
Springer,
pp. 148–162,
doi:10.1007/11841197_10.
G. Castagna, N. Gesbert & L. Padovani (2008):
A Theory of Contracts for Web Services.
In: POPL '08, 35th ACM Symposium on Principles of Programming Languages,
doi:10.1145/1328438.1328471.
G. Castagna, N. Gesbert & L. Padovani (2009):
Contracts for mobile processes.
In: Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09),
LNCS 5710.
Springer,
pp. 211–228,
doi:10.1145/1538917.1538920.
Giuseppe Castagna, Nils Gesbert & Luca Padovani (2009):
A theory of contracts for Web services.
ACM Trans. Program. Lang. Syst. 31(5),
pp. 19:1–19:61,
doi:10.1145/1538917.1538920.
Simon Gay & Malcolm Hole (2005):
Subtyping for Session Types in the Pi-Calculus.
Acta Informatica 42(2/3),
pp. 191–225,
doi:10.1007/s00236-005-0177-z.
Kohei Honda, Vasco T. Vasconcelos & Makoto Kubo (1998):
Language Primitives and Type Disciplines for Structured Communication-based Programming.
In: ESOP'98,
LNCS 1381.
Springer-Verlag,
pp. 22–138,
doi:10.1007/BFb0053567.
Cosimo Laneve & Luca Padovani (2007):
The Must Preorder Revisited: An Algebraic Theory for Web Services Contracts.
In: CONCUR'07,
LNCS 4703.
Springer-Verlag,
pp. 212–225,
doi:10.1007/978-3-540-74407-8_15.
Rocco De Nicola & Matthew Hennessy (1983):
Testing Equivalence for Processes.
In: ICALP,
LNCS 154.
Springer,
pp. 548–560,
doi:10.1007/BFb0036936.
Luca Padovani (2010):
Contract-Based Discovery of Web Services Modulo Simple Orchestrators.
Theoretical Computer Science 411,
pp. 3328–3347,
doi:10.1016/j.tcs.2010.05.002.
Benjamin C. Pierce & Davide Sangiorgi (1996):
Typing and Subtyping for Mobile Processes.
Mathematical Structures in Computer Science 6, No. 5.
Davide Sangiorgi (2009):
On the origins of bisimulation and coinduction.
ACM Trans. Program. Lang. Syst. 31(4),
doi:10.1145/1516507.1516510.
Alfred Tarski (1955):
A lattice-theoretical fixpoint theorem and its applications.
Pac. J. Math. 5,
pp. 285–309,
doi:10.2140/pjm.1955.5.285.
eptcs@eptcs.org