| The pi-calculus: a Theory of Mobile Processes D Sangiorgi, D Walker Cambridge university press, 2003 | 2235 | 2003 |
| Expressing mobility in process algebras: first-order and higher-order paradigms D Sangiorgi The University of Edinburgh, 1993 | 759 | 1993 |
| Typing and subtyping for mobile processes B Pierce, D Sangiorgi Mathematical Structures in Computer Science 6 (5), 409-453, 1996 | 650 | 1996 |
| Barbed bisimulation R Milner, D Sangiorgi International Colloquium on Automata, Languages, and Programming, 685-695, 1992 | 648 | 1992 |
| An introduction to bisimulation and coinduction D Sangiorgi Cambridge University Press, 2011 | 523 | 2011 |
| A theory of bisimulation for the π-calculus D Sangiorgi Acta informatica 33 (1), 69-97, 1996 | 470 | 1996 |
| On bisimulations for the asynchronous π-calculus RM Amadio, I Castellani, D Sangiorgi Theoretical Computer Science 195 (2), 291-324, 1998 | 414 | 1998 |
| On the origins of bisimulation and coinduction D Sangiorgi ACM Transactions on Programming Languages and Systems (TOPLAS) 31 (4), 1-41, 2009 | 334 | 2009 |
| Controlling interference in ambients F Levi, D Sangiorgi Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of …, 2000 | 328 | 2000 |
| On the bisimulation proof method D Sangiorgi Mathematical Structures in Computer Science 8 (5), 447-479, 1998 | 298 | 1998 |
| The problem of “Weak Bisimulation up to” D Sangiorgi, R Milner International conference on concurrency theory, 32-46, 1992 | 263* | 1992 |
| π-calculus, internal mobility, and agent-passing calculi D Sangiorgi Theoretical computer science 167 (1-2), 235-274, 1996 | 244 | 1996 |
| Bisimulation for higher-order process calculi D Sangiorgi Information and Computation 131 (2), 141-178, 1996 | 223 | 1996 |
| Session types revisited O Dardha, E Giachino, D Sangiorgi Proceedings of the 14th symposium on Principles and practice of declarative …, 2012 | 217 | 2012 |
| SCC: a service centered calculus M Boreale, R Bruni, L Caires, R De Nicola, I Lanese, M Loreti, F Martins, ... International Workshop on Web Services and Formal Methods, 38-57, 2006 | 211 | 2006 |
| The lazy lambda calculus in a concurrency scenario D Sangiorgi Information and computation 111 (1), 120-153, 1994 | 202 | 1994 |
| From π-calculus to Higher-Order π-calculus—and back D Sangiorgi Colloquium on Trees in Algebra and Programming, 151-166, 1993 | 174 | 1993 |
| A fully abstract model for the π-calculus MP Fiore, E Moggi, D Sangiorgi Information and Computation 179 (1), 76-117, 2002 | 167 | 2002 |
| Behavioral equivalence in the polymorphic pi-calculus BC Pierce, D Sangiorgi Journal of the ACM (JACM) 47 (3), 531-584, 2000 | 161 | 2000 |
| On asynchrony in name-passing calculi M Merro, D Sangiorgi International Colloquium on Automata, Languages, and Programming, 856-867, 1998 | 142 | 1998 |
