Publications:

1. Mano, K. and Ogawa, M. (NTT Basic Research Labs.):
   A new proof of Chew's theorem, Proc. of RIMS workshop on theory of rewriting systems and its applications, research report 918, RIMS, Kyoyo Univ., pp. 160-177 (1996).
2. Horita, E. and Mano, K.:
   Nepi: a network prgramming language based on the pi-calculus, in Proc. of the 1st International Conference on Coodination Models, Languages and Application (Coodination'96), LNCS 1061, pp. 424--427 (1996).
3. Horita, E. and Mano, K.:
   A metric semantics for the pi-calculus extended with external events, Proc. of RIMS Workshop in Computing: Concurrency Theory and Appllcations, research report 996, RIMS, Kyoto Univ. (1996).
4. Horita, E. and Mano, K.:
   Self-interpretation in an extension of CCS with parametric channels, Proc. of Joint Sympisium on Parallel Processing 1996 (JSPP'96), pp. 203--210 (1996).
5. Horita, E. and Mano, K.:
   Self-interpretation in an extension of CCS with parametric channels, Proc. of the 12th Conference on the Mathematical Foundations of Programming Semantics (MFPS XII) (1996).
6. Mano, K. and Ogawa, M. (NTT Basic Research Labs.):
   Unique normal form property of higher-order rewriting systems, Proc. of the 5th International Conference on Algebraic and Logic Programming (ALP'96), LNCS 1139, pp. 269--283 (1996).
7. Mano, K. and Ogawa, M. (NTT Basic Research Labs.):
   Unique normal form property of higher-order rewriting systems, IEICE Trans. D-I, Vol. J80-D-I, pp. 258--268 (1997), (in Japanese).
8. Horita, E. (NTT Software Labs.) and Mano, K.:
   Nepi^2: a two-level calculus for network programming based on the pi-calculus, Proc. of the 3rd Asian Computing Science Conference (ASIAN'97), LNCS 1345, pp. 377--378 (1997).
9. Horita, E. (NTT Software Labs.) and Mano, K.:
   The Nepi2 programming System: A pi-Calculus Based Approach to Agent-Based Programming, the first Goddard Workshop on Formal Approaches to Agent Based Programming (FAABS '00), pp. 90-102, LNAI 1871 (2000).
10. T. Araragi, P. Attie, I. Keidar, K. Kogure, V. Luchangco, N. Lynch, and K. Mano:
    On Formal Modeling of Agent Computations, the first Goddard Workshop on Formal Approaches to Agent Based Programming (FAABS '00), pp. 48-62, LNAI 1871 (2000).
11. K. Mano and Y. Kawabe:
    Nepi: Syntax, Semantics and Implementation, World Multiconference on Systemics, Cybernetics and Informatics 2001 (SCI 2001), Volume XIV, (2001).
12. Y. Kawabe and K. Mano:
    Executing Coded pi-Calculus Processes, the second International Conference on Software Engineering, Networking & Parallel/Distributed Computing (SNPD '01) (2001).
13. Mano, K. and Ogawa, M. (NTT Basic Research Labs.):
    Unique normal form property of compatible term rewriting systems - A new proof of Chew's theorem -, Theoretical Computer Science, Vol.258 (2001).
14. Y. Kawabe, K. Mano, E. Horita, K. Kogure
    Name creation implements restriction in the pi-calculus, IEICE Volume J85-DI, No. 3 (2002). In Japanese.
15. Y. Kawabe, K. Mano:
    Formal verification of Nepi network programming system, Computer Software Vol. 20, pp. 46-57 (2003). In Japanese.
16. K. Mano and Y. Kawabe:
    The Nepi network programming system: a programming environment for distributed systems, 3rd IEEE international symposium on network computing and application (IEEE NCA04), pp. 287 - 292 (2004).
17. Y. Kawabe, K. Mano:
    Verifying trace equevalence of a shared-memory-style communication system, Trans. IEICE, Vol. 36, No. 2, pp. 78-91 (2005).
18. Y. Kawamoto, K. Mano, H. Sakurada, M. Hagiya:
    Partial Knowledge of Functions and Verification of Anonymity, Transaction of JSIAM Vol. 17, No.4, pp. 559 - 576 (2007).
19. Y. Kawabe, K. Mano, H. Sakurada and Y. Tsukada:
    Theorem-proving anonymity of infinite state systems", Information Processing Letters, Vol. 101, No. 1, pp. 46 - 51 (2007).