| Strong Normalisation in the π-Calculus N Yoshida, M Berger, K Honda Information and Computation 191 (2), 145-202, 2004 | 154 | 2004 |
| Strong Normalisation in the pi-Calculus N Yoshida, M Berger, K Honda Information & Computation 191 (2), 145-202, 2004 | 154 | 2004 |
| The two-phase commitment protocol in an extended π-calculus M Berger, K Honda Electronic Notes in Theoretical Computer Science 39 (1), 21-46, 2003 | 110 | 2003 |
| Sequentiality and the π-calculus M Berger, K Honda, N Yoshida International Conference on Typed Lambda Calculi and Applications, 29-45, 2001 | 98 | 2001 |
| Sequentiality and the π-calculus M Berger, K Honda, N Yoshida Typed Lambda Calculi and Applications, 29-45, 2001 | 98 | 2001 |
| An observationally complete program logic for imperative higher-order functions K Honda, N Yoshida, M Berger 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), 270-279, 2005 | 76 | 2005 |
| Basic Theory of Reduction Congruence forTwo Timed Asynchronous π-Calculi M Berger International Conference on Concurrency Theory, 115-130, 2004 | 56 | 2004 |
| Towards abstractions for distributed systems M Berger Diss. Imperial College, Deptartment of Computing, 2002 | 52 | 2002 |
| Genericity and the π-calculus M Berger, K Honda, N Yoshida Acta Informatica 42 (2), 83-141, 2005 | 44 | 2005 |
| Genericity and the π-calculus M Berger, K Honda, N Yoshida Acta Informatica 42 (2-3), 83-141, 2005 | 44 | 2005 |
| Genericity and the π-calculus M Berger, K Honda, N Yoshida International Conference on Foundations of Software Science and Computation …, 2003 | 43* | 2003 |
| Control in the π-calculus K Honda, N Yoshida, M Berger Proc. Fourth ACM-SIGPLAN Continuation Workshop (CW) 4, 2004 | 42 | 2004 |
| A logical analysis of aliasing in imperative higher-order functions M Berger, K Honda, N Yoshida Proceedings of the tenth ACM SIGPLAN international conference on Functional …, 2005 | 41 | 2005 |
| Genericity and the π-calculus M Berger, K Honda, N Yoshida International Conference on Foundations of Software Science and Computation …, 2003 | 40 | 2003 |
| Logical Reasoning for Higher-Order Functions with Local State N Yoshida, K Honda, M Berger Logical Methods in Computer Science 4 (2), 2008 | 38 | 2008 |
| Logical reasoning for higher-order functions with local state N Yoshida, K Honda, M Berger International Conference on Foundations of Software Science and …, 2007 | 38 | 2007 |
| Linearity and bisimulation N Yoshida, K Honda, M Berger International Conference on Foundations of Software Science and Computation …, 2002 | 38 | 2002 |
| Linearity and bisimulation N Yoshida, K Honda, M Berger Foundations of Software Science and Computation Structures, 1-12, 2002 | 38 | 2002 |
| Descriptive and relative completeness of logics for higher-order functions K Honda, M Berger, N Yoshida 33rd International Colloquium on Automata, Languages and Programming (ICALP …, 2006 | 32 | 2006 |
| Completeness and logical full abstraction in modal logics for typed mobile processes M Berger, K Honda, N Yoshida International Conerence on Automata, Languages and Programming (ICALP), 99-111, 2008 | 26 | 2008 |
Nobuko YoshidaDepartment of Computing, Imperial College LondonVerified email at doc.ic.ac.uk
