| What is a “good” encoding of guarded choice? U Nestmann Information and computation 156 (1-2), 287-319, 2000 | 153 | 2000 |
| Decoding choice encodings U Nestmann, BC Pierce CONCUR'96: Concurrency Theory: 7th International Conference Pisa, Italy …, 1996 | 136 | 1996 |
| Decoding choice encodings U Nestmann, BC Pierce Information and Computation 163 (1), 1-59, 2000 | 114 | 2000 |
| Symbolic bisimulation in the spi calculus J Borgström, S Briais, U Nestmann CONCUR 2004-Concurrency Theory: 15th International Conference, London, UK …, 2004 | 68 | 2004 |
| On Bisimulations for the Spi Calculus* J Borgström, U Nestmann Algebraic Methodology and Software Technology: 9th International Conference …, 2002 | 68 | 2002 |
| Modeling consensus in a process calculus U Nestmann, R Fuzzati, M Merro CONCUR 2003-Concurrency Theory: 14th International Conference, Marseille …, 2003 | 59 | 2003 |
| Full abstraction for expressiveness: history, myths and facts D Gorla, U Nestmann Mathematical Structures in Computer Science 26 (4), 639-654, 2016 | 49 | 2016 |
| On distributability in process calculi K Peters, U Nestmann, U Goltz Programming Languages and Systems: 22nd European Symposium on Programming …, 2013 | 42 | 2013 |
| Formal verification of distributed algorithms: From pseudo code to checked proofs P Küfner, U Nestmann, C Rickmann Theoretical Computer Science: 7th IFIP TC 1/WG 2.2 International Conference …, 2012 | 38 | 2012 |
| A formal semantics for protocol narrations S Briais, U Nestmann Theoretical Computer Science 389 (3), 484-511, 2007 | 35 | 2007 |
| Welcome to the jungle: A subjective guide to mobile process calculi U Nestmann CONCUR 2006–Concurrency Theory: 17th International Conference, CONCUR 2006 …, 2006 | 32 | 2006 |
| On determinacy and nondeterminacy in concurrent programming U Nestmann Inst. für Math. Maschinen und Datenverarbeitung (Informatik), 1996 | 32 | 1996 |
| Is it a “good” encoding of mixed choice? K Peters, U Nestmann Foundations of Software Science and Computational Structures: 15th …, 2012 | 31 | 2012 |
| Verifying a structured peer-to-peer overlay network: The static case J Borgström, U Nestmann, L Onana, D Gurov Global Computing: IST/FET International Workshop, GC 2004 Rovereto, Italy …, 2005 | 31 | 2005 |
| Dynamic causality in event structures Y Arbach, D Karcher, K Peters, U Nestmann Formal Techniques for Distributed Objects, Components, and Systems: 35th …, 2015 | 29 | 2015 |
| On the expressive power of joint input U Nestmann Electronic Notes in Theoretical Computer Science 16 (2), 145-152, 1998 | 26 | 1998 |
| Typing confluence U Nestmann, M Steffen In Second International ERCIM Workshop on Formal Methods in Industrial …, 1997 | 24 | 1997 |
| Unreliable failure detectors via operational semantics U Nestmann, R Fuzzati ASIAN 3, 54-71, 2003 | 23 | 2003 |
| Mobile objects as mobile processes M Merro, J Kleist, U Nestmann Information and Computation 177 (2), 195-241, 2002 | 23 | 2002 |
| Session types for link failures M Adameit, K Peters, U Nestmann Formal Techniques for Distributed Objects, Components, and Systems: 37th …, 2017 | 22 | 2017 |
Massimo MerroProfessor of Computer Science, Verona University - ItalyVerified email at univr.it
