M. Abadi, C. Flanagan, and S. N. Freund, Types for safe locking, ACM Transactions on Programming Languages and Systems, vol.28, issue.2, 2006.
DOI : 10.1145/1119479.1119480

S. D. Brookes, C. A. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM, vol.31, issue.3, pp.560-599, 1984.
DOI : 10.1145/828.833

D. Caromel, L. Henrio, and B. P. Serpette, Asynchronous and deterministic objects, Proc. POPL'04, pp.123-134, 2004.
DOI : 10.1145/964001.964012
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.9095

S. Chaki, S. K. Rajamani, and J. Rehof, Types as models, ACM SIGPLAN Notices, vol.37, issue.1, pp.45-57, 2002.
DOI : 10.1145/565816.503278

F. De-boer, D. Clarke, and E. Johnsen, A Complete Guide to the Future, Progr. Lang. and Systems, pp.316-330, 2007.
DOI : 10.1007/978-3-540-71316-6_22

P. Felber and R. Guerraoui, Programming with object groups in CORBA, IEEE Concurrency, vol.8, issue.1, pp.48-58, 2000.
DOI : 10.1109/4434.824312
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.8711

Y. Honda and A. Yonezawa, Debugging Concurrent Systems Based on Object Groups, Proc. ECOOP'88, pp.267-282, 1988.
DOI : 10.1007/3-540-45910-3_16

A. Igarashi, B. C. Pierce, and P. Wadler, Featherweight Java: a minimal core calculus for Java and GJ, ACM Transactions on Programming Languages and Systems, vol.23, issue.3, pp.396-450, 2001.
DOI : 10.1145/503502.503505
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.1141

E. B. Johnsen and O. Owe, An asynchronous communication model for distributed concurrent objects. Software and System Modeling, pp.39-58, 2007.
DOI : 10.1109/sefm.2004.1347520
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.6915

N. Kobayashi, A New Type System for Deadlock-Free Processes, Proc. CONCUR 2006, pp.233-247, 2006.
DOI : 10.1007/11817949_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.5002

C. Laneve and L. Padovani, The Must Preorder Revisited, Proc. CONCUR 2007, pp.212-225, 2007.
DOI : 10.1007/978-3-540-74407-8_15

R. Milner, A Calculus of Communicating Systems, 1982.
DOI : 10.1007/3-540-10235-3

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, II, Information and Computation, vol.100, issue.1, pp.41-77, 1992.
DOI : 10.1016/0890-5401(92)90009-5

U. Montanari and M. Pistore, History-dependent automata: An introduction, Formal Methods for the Design of Computer, Communication, and Software Systems, pp.1-28, 2005.
DOI : 10.1007/11419822_1

H. R. Nielson and F. Nielson, Higher-order concurrent programs with finite communication topology, Proc. POPL '94, pp.84-97, 1994.
DOI : 10.1145/174675.174538
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.9162

O. Nierstrasz, Active objects in Hybrid, Proc. OOPSLA'87, pp.243-253, 1987.
DOI : 10.1145/38765.38829

J. Schäfer and A. Poetzsch-heffter, JCoBox: Generalizing Active Objects to Concurrent Components, Proc. ECOOP'10, pp.275-299, 2010.
DOI : 10.1007/978-3-642-14107-2_13

V. T. Vasconcelos, F. Martins, and T. Cogumbreiro, Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language, Proc. PLACES'09, pp.95-109, 2009.
DOI : 10.4204/EPTCS.17.8

A. Yonezawa, J. Briot, and E. Shibayama, Object-oriented concurrent programming in ABCL/1, Proc. OOPSLA'86, pp.258-268, 1986.
DOI : 10.1007/978-3-662-44471-9_2
URL : https://hal.archives-ouvertes.fr/hal-01221585