Masami Hagiya

Masami Hagiya is a professor at
Department of Computer Science,
Graduate School of Information
Science and Technology,
University of Tokyo.

He is in Rooms 203 and 211,
Science Building No.7,
Department of Computer Science,
Graduate School of Information
Science and Technology,
University of Tokyo,
7-3-1 Hongo, Bunkyo-ku,
Tokyo 113-8656, JAPAN.

TEL: +81-3-5841-4113 (PHS)
TEL: +81-3-5841-4093 (laboratory)
FAX: +81-3-3818-1073
E-mail: hagiya at is.s.u-tokyo.ac.jp
Twitter: at hagiya (mostly in Japanese)

[pics]
by Yohei Hagiya

Links

Introduction

Masami Hagiya is a professor at Department of Computer Science, University of Tokyo. After receiving M.Sc. from University of Tokyo, he worked for Research Institute for Mathematical Sciences, Kyoto University, and received Dr.Sc. He has been working on modeling, formalization, simulation, verification, and automatic synthesis of computer systems, mainly using deductive approaches. He is not only dealing with systems composed of electronic computers, but also with biological and molecular systems, and has been working on DNA and molecular computing. Finally, he is also interested in how those systems are evolved, either by human intelligence or by artificial intelligence.

Introduction to Hagiya Laboratory

See also the Japanese pamphlet.

With background in formal logic, our laboratory is seeking for new computational models, developing new methods for analyzing and verifying such models, and implementing new tools for analysis, verification and synthesis. While our main target is software systems and programming languages, we also deal with molecular and biological systems, and we are currently doing research on molecular computing.

The relationship between computation and logic is diverse. Some logical systems describe properties of computation, while proofs are regarded as computational processes in others. However, in all approaches to logic and computation, we are first faced with the question of what is computation, and try to define a formal model of computation. After defining a formal model, we then try to establish methods for verification and synthesis under the model.

In recent years, our laboratory has been focusing on software model checking, formal verification concerning software security, etc., on the practical side, while working on formal models of computation, such as lambda-calculus, pi-calculus, their semantics, foundations for formal verification and automatic synthesis, including modal logic, model checking, hybrid systems, etc.

Our laboratory is not only dealing with the computational processes in electronic computers, but also with those hidden in natural systems, including molecular and biological ones, and trying to establish computational models of those systems with the goal of finally constructing artificial systems based on the models. We are currently working on DNA and molecular computing, which is a research field for realizing information processing at the molecular level.

In addition to computational models that are common in software systems and natural systems, we are also interested in how those systems are developed. Research on synthetic biology has recently launched new activities called Open Science or Science 2.0, which promote science as open source software development. When applied to biological systems, these activities will replace biological processes such as evolution and self-organization with corresponding processes on the web. They can be combined with automatic construction of biological systems using artificial intelligence methods such as evolutionary computation.

Publications

Publish and perish!

Refereed Papers (including Conference Papers)

  1. Yoshinori Tanabe and Masami Hagiya: Fixed-point Computations over Functions on Integers with Operations Min, Max and Plus, 6th Workshop on Fixed Points in Computer Science (FICS 2009), Coimbra, Portugal, 12-13 September 2009, pp.108-115.

  2. Cyrille Artho, Watcharin Leungwattanakit, Masami Hagiya, Yoshinori Tanabe and Mitsuharu Yamamoto: Cache-based Model Checking of Networked Applications: From Linear to Branching Time, 24th IEEE/ACM International Conference on Automated Software Engineering, 2009, to appear.

  3. * Ibuki Kawamata, Fumiaki Tanaka, and Masami Hagiya: Automatic Design of DNA Logic Gates Based on Kinetic Simulation, The 15th International Meeting on DNA Computing and Molecular Programming, DNA15, Preliminary Proceedings, 2009, pp.8-17.

  4. Watcharin Leungwattanakit, Cyrille Artho, Masami Hagiya, Yoshinori Tanabe, and Mitsuharu Yamamoto: Verifying networked programs using a model checker extension, ICSE Companion Proceedings, 2009, to appear.

  5. Watcharin Leungwattanakit, Cyrille Artho, Masami Hagiya, Yoshinori Tanabe, and Mitsuharu Yamamoto: Introduction of virtualization technology to multi-process model checking, First NASA Formal Methods Symposium, NASA Conference Publication, 2009, pp.106-110.

  6. Yusuke Kawamoto, Hideki Sakurada, and Masami Hagiya: Computationally sound formalization of rerandomizable RCCA secure encryption, Third Franco-Japanese Computer Security Workshop, Nancy, France, March 2008. In Formal to Practical Security, Papers Issued from the 2005-2008 French-Japanese Collaboration, Lecture Notes in Computer Science, Vol.5458, 2009, pp.158-180.

  7. Yoshinori Tanabe, Koichi Takahashi, and Masami Hagiya: A decision procedure for alternation-free modal $\mu$-calculi, Advances in Modal Logic, Vol.7, (C. Areces, R. Goldblatt, Eds.), College Publications, London, 2008, pp.341-362.

  8. * Yusuke Kawamoto, Hideki Sakurada and Masami Hagiya: Computationally Sound Symbolic Anonymity of a Ring Signature, FCS-ARSPA-WITS'08, Joint Workshop on Foundations of Computer Security, Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, 2008.

  9. Fumiaki Tanaka, Takashi Tsuda, and Masami Hagiya: Towards DNA Comparator: the Machine That Compares DNA Concentrations, The 14th International Meeting on DNA Computing, DNA14, Preliminary Proceedings, 2008, pp.100-111.

  10. * Cyrille Artho, Watcharin Leungwattanakit, Masami Hagiya and Yoshinori Tanabe: Efficient Model Checking of Networked Applications, TOOLS-EUROPE 2008, Lecture Notes in Business Information Processing, Vol.11, 2008, pp.22-40.

  11. Dai Ikarashi, Yoshinori Tanabe, Koki Nishizawa, and Masami Hagiya: Modal $\mu$-calculus on min-plus algebra N$_\infty$, The Tenth Workshop on Programming and Programming Languages (PPL2008), Japanese Society on Software Science and Technology, 2008, pp.216-230. (Awarded Rombun-Shourei-Sho) The full version will appear in the journal of Computer Software from Japanese Society on Software Science and Technology.

  12. S. Ayukawa, A. Kobayashi, Y. Nakashima, H. Takagi, S. Hamada, M. Uchiyama, K. Yugi, S. Murata, Y. Sakakibara, M. Hagiya, M. Yamamura and D. Kiga: SYANAC: SYnthetic biological Automaton for Noughts And Crosses, IET Synthetic Biology, Vol.1, No.1-2, 2007, pp.64-67.

  13. Akio Nishikawa, Satsuki Yaegashi, Kazumasa Ohtake, and Masami Hagiya: Multi-fueled Approach to DNA Nano-robotics, The Thirteen International Meeting on DNA Computing, DNA13, Preliminary Proceedings, 2007, pp.162-171. Also in DNA Computing: 13th International Workshop on DNA Computing, DNA13, Lecture Notes in Computer Science, Vol.4848, 2008, pp.79-88. Also in Natural Computing, to appear (online version).

  14. Atsushi Kameda, Satoshi Kashiwamura, Masahito Yamamoto, Azuma Ohuchi, and Masami Hagiya: Combining randomness and a high-capacity DNA memory, The Thirteen International Meeting on DNA Computing, DNA13, Preliminary Proceedings, 2007, pp.261-269. Also in DNA Computing: 13th International Workshop on DNA Computing, DNA13, Lecture Notes in Computer Science, Vol.4848, 2008, pp.109-118.

  15. Carl Christian Frederiksen and Masami Hagiya: Sub-Computation Based Transition Predicate Abstraction, IPSJ Transactions on Programming, Vol.48, No.SIG10(PRO33), 2007, pp.114-137. Also in IPSJ Digital Courier, Vol.3, 2007, pp.380-403.

  16. John A. Rose, Russell J. Deaton, Masami Hagiya, and Akira Suyama: Coupled Equilibrium Model of Hybridization Error for the DNA Microarray and Tag-Antitag Systems, IEEE Transactions on Nanobioscience, Vol.6, No.1, 2007, pp.18-27.

  17. Atsushi Kemada, Masahito Yamamoto, Azuma Ohuchi, Satsuki Yaegashi, and Masami Hagiya: Unravel Four Hairpins!, The Twelfth International Meeting on DNA Computing, DNA12, Preliminary Proceedings, 2006, pp.65-74. Also in DNA Computing: 12th International Workshop on DNA Computing, DNA12, Lecture Notes in Computer Science, Vol.4287, 2007, pp.381-392. Also in Natural Computing, to appear (online version).

  18. Ken Komiya, Satsuki Yaegashi, Masami Hagiya, Akira Suyama, and John A. Rose: Experimental Validation of the Statistical Thermodynamic Model for Prediction of the Behavior of Autonomous Molecular Computers Based on Hairpin Formation, The Twelfth International Meeting on DNA Computing, DNA12, Preliminary Proceedings, 2006, pp.382-392. Also in DNA Computing: 12th International Workshop on DNA Computing, DNA12, Lecture Notes in Computer Science, Vol.4287, 2007, pp.428-438.

  19. John A. Rose, Ken Komiya, Satsuki Yaegashi, and Masami Hagiya: Displacement Whiplash PCR: Optimized architecture and experimental validation, The Twelfth International Meeting on DNA Computing, DNA12, Preliminary Proceedings, 2006, pp.393-403. Also in DNA Computing: 12th International Workshop on DNA Computing, DNA12, Lecture Notes in Computer Science, Vol.4287, 2007, pp.393-403.

  20. Ken Komiya, Kensaku Sakamoto, Atsushi Kameda, Masahito Yamamoto, Azuma Ohuchi, Daisuke Kiga, Shigeyuki Yokoyama and Masami Hagiya: DNA polymerase programmed with a hairpin DNA incorporates a multiple-instruction architecture into molecular computing, BioSystems, Vol.83, No.1, 2006, pp.18-25.

  21. Seika Abe, Masami Hagiya and Ikuo Nakata: A Retargetable Code Generator for the Generic Intermediate Language in COINS, IPSJ Transactions on Programming, Vol.46, No.SIG14(PRO27), 2005, pp.12-29.

  22. Yoshinori Tanabe, Koichi Takahashi, Mitsuharu Yamamoto, Akihiko Tozawa, and Masami Hagiya: A Decision Procedure for the Alternation-free Two-way Modal mu-calculus, TABLEAUX 2005, Lecture Notes in Artificial Intelligence, Vol.3702, 2005, pp.277-291.

  23. Masami Hagiya: Discrete State Transition Systems on Continuous Space-Time: A Theoretical Model for Amorphous Computing, UC 2005, Unconventional Computation, Lecture Notes in Computer Science, Vol.3699, 2005, pp.117-129.

  24. Atsushi Kameda, Masahito Yamamoto, Hiroki Uejima, Masami Hagiya, Kensaku Sakamoto and Azuma Ohuchi: Hairpin-based state machine and conformational addressing: Design and experiment, Natural Computing, Vol.4, No.2, 2005, pp.103-126.

  25. Keiichiro Takahashi, Satsuki Yaegashi, Hiroyuki Asanuma and Masami Hagiya: Photo- and Thermoregulation of DNA Nanomachines, DNA11, Eleventh International Meeting on DNA Based Computers, Preliminary Proceedings, 2005, pp.147-156. Also in DNA Computing: 11th International Workshop on DNA Computing, DNA11, Lecture Notes in Computer Science, Vol.3892, 2006, pp.336-346.

  26. Keiichiro Takahashi, Satsuki Yaegashi, Atsushi Kameda and Masami Hagiya: Chain Reaction Systems Based on Loop Dissociation of DNA, DNA11, Eleventh International Meeting on DNA Based Computers, Preliminary Proceedings, 2005, pp.343-353. Also in DNA Computing: 11th International Workshop on DNA Computing, DNA11, Lecture Notes in Computer Science, Vol.3892, 2006, pp.347-358.

  27. * Yoshihito Nakagawa, Richard Potter, Mitsuharu Yamamoto, Masami Hagiya, and Kazuhiko Kato: Model Checking of Multi-Process Applications Using SBUML and GDB, Workshop on Dependable Software -- Tools and Methods --, Supplemented Volume of the 2005 International Conference on Dependable Systems and Networks, 2005, pp.215-220.

  28. * Osamu Sato, Richard Potter, Mitsuharu Yamamoto and Masami Hagiya: UML Scrapbook and Realization of Snapshot Programming Environment, Software Security -- Theories and Systems, Second Mext-NSF-JSPS International Symposium, ISSS 2003, Tokyo Japan, November 2003, Revised papers, Lecture Notes in Computer Science, Vol.3233, 2004, pp.281-295.

  29. Mitsuhiro Kubota and Masami Hagiya: Minimum Basin Algorithm: An Effective Analysis Technique for DNA Energy Landscapes, DNA10, Tenth International Meeting on DNA Based Computers, Preliminary Proceedings, 2004, pp.202-213. Also in DNA Computing: 10th International Workshop on DNA Computing, DNA10, Lecture Notes in Computer Science, Vol.3384, 2005, pp.202-214.

  30. Mitsuhiro Kubota, Kazumasa Ohtake, Ken Komiya, Kensaku Sakamoto and Masami Hagiya: Branching DNA Machines Based on Transitions of Hairpin Structures, Proceedings of the 2003 Congress on Evolutionary Computation (CEC'03), 2003, pp.2542-2548.

  31. John A. Rose, Masami Hagiya and Akira Suyama: The Fidelity of the Tag-Antitag System 2: Reconciliation with the Stringency Picture, Proceedings of the 2003 Congress on Evolutionary Computation (CEC'03), 2003, pp.2740-2747.

  32. Akihiko Tozawa and Masami Hagiya: XML Schema Containment Checking based on Semi-implicit Techniques, Implementation and Application of Automata, 8th International Conference, CIAA 2003, Lecture Notes in Computer Science, Vol.2759, 2003, pp.213-225.

  33. Hiroki Uejima and Masami Hagiya: Secondary Structure Design of Multi-state DNA Machines Based on Sequential Structure Transitions, DNA9, Ninth International Meeting on DNA Based Computers, Preliminary Proceedings, 2003, pp.80-91. Also in DNA Computing, 9th International Workshop on DNA-Based Computers, DNA9, Madison, WI, USA, June 2003, Revised Papers, Lecture Notes in Computer Science, Springer, Vol.2943, 2004, pp.74-85.

  34. * Masami Haigya, Ryo Takemura, Koichi Takahashi, and Takamichi Saito: Verification of Authentication Protocols Based on the Binding Relation, Software Security -- Theories and Systems, Mext-NSF-JSPS Internationa Symposium, ISSS 2002, Tokyo, Japan, November 2002, Revised papers, Lecture Notes in Computer Science, Springer, Vol.2609, 2003, pp.299-316.

  35. * Mitsuharu Yamamoto, Jean-Marie Cottin, and Masami Hagiya: Decidability of Safety Properties of Timed Multiset Rewriting, FTRTFT'02, Formal Techniques in Real-Time and Fault Tolerant Systems, 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 2002, Proceedings, Lecture Notes in Computer Science, Springer, Vol.2469, 2002, pp.165-183.

  36. Richard Potter and Masami Hagiya: Computation Scrapbooks for Software Evolution, Fifth International Workshop on Principles of Software Evolution, IWPSE 2002, Orlando, Florida, USA, May 19-20, 2002, pp.143-147.

  37. * Koichi Takahashi and Masami Hagiya: Formal Proof of Abstract Model Checking of Concurrent Garbage Collection, Workshop on Thirty Five years of Automath, Informal Proceedings (Fairouz Kamareddine Ed.), Heriot-Watt University, Edinburgh, April, 2002, pp.115-126.

  38. * Koichi Takahashi and Masami Hagiya: Searching for Mutual Exclusion Algorithms Using BDDs, Progress in Discovery Science, (Setsuo Arikawa and Ayumi Shinohara Eds.), Lecture Notes in Artificial Intelligence, Vol.2281, 2002, pp.1-18.

  39. * Akihiko Tozawa and Masami Hagiya: Formalization and Analysis of Class Loading in Java, Higher-Order and Symbolic Computation, Vol.15, 2002, pp.7-55.

  40. J. A. Rose, R.J. Deaton, M. Hagiya, A. Suyama: An Equilibrium Analysis of the Efficiency of an Autonomous Molecular Computer, Physical Review E, Vol.65, No.2-1, 2002, 021910, pp.1-13.

  41. Hiroki Uejima, Masami Hagiya and Satoshi Kobayashi: Horn Clause Computation by Self-Assembly of DNA Molecules, DNA7, 7th International Meeting on DNA Based Computers, Preliminary Proceedings, 2001, pp.63-74. Also in DNA Computing, 7th International Workshop on DNA-Based Computers, DNA7, Tampa, FL, USA, June 2001, Revised Papers, Lecture Notes in Computer Science, Springer, Vol.2340, 2002, pp.308-320.

  42. John A. Rose, Russell J. Deaton, Masami Hagiya, and Akira Suyama: The Fidelity of the Tag-Antitag System, DNA7, 7th International Meeting on DNA Based Computers, Preliminary Proceedings, 2001, pp.302-310. Also in DNA Computing, 7th International Workshop on DNA-Based Computers, DNA7, Tampa, FL, USA, June 2001, Revised Papers, Lecture Notes in Computer Science, Springer, Vol.2340, 2002, pp.138-149.

  43. John. A. Rose, Russell J. Deaton, Masami Hagiya, and Akira Suyama: PNA-mediated Whiplash PCR, DNA7, 7th International Meeting on DNA Based Computers, Preliminary Proceedings, 2001, pp.311-320. Also in DNA Computing, 7th International Workshop on DNA-Based Computers, DNA7, Tampa, FL, USA, June 2001, Revised Papers, Lecture Notes in Computer Science, Springer, Vol.2340, 2002, pp.104-116.

  44. Akio Nishikawa, Masayuki Yamamura and Masami Hagiya: DNA Computation Simulator Based on Abstract Bases, Soft Computing, Vol.5, No.1, 2001, pp.25-38.

  45. Jianguo Lu, John Mylopoulos, Masateru Harao and Masami Hagiya: Higher-order generalization and its application in program verification, Annals of Mathematics and Artificial Intelligence, Vol.28, 2000, pp.107-126.

  46. Kensaku Sakamoto, Hidetaka Gouzu, Ken komiya, Daisuke Kiga, Shigeyuki Yokoyama, Takashi Yokomori and Masami Hagiya: Molecular Computation by DNA Hairpin Formation, Science, Vol.288, 2000, pp.1223-1226.

  47. Masanori Arita, Akio Nishikawa, Masami Hagiya, Ken Komiya, Hidetaka Gouzu and Kensaku Sakamoto: Improving Sequence Design for DNA Computing, Proceedings of the Gnenetic and Evolutionary Computation Conference (GECCO 2000), 2000, pp.875-882.

  48. Ken Komiya, Kensaku Sakamoto, Hidetaka Gouzu, Shigeyuki Yokoyama, Masanori Arita, Akio Nishikawa and Masami Hagiya: Successive State Transitions with I/O Interface by Molecules, DNA6, Sixth International Meeting on DNA Based Computers, Preliminary Proceedings, 2000, pp.21-30. Also in DNA Computing, 6th International Workshop on DNA-Based Computers, DNA 2000, (Anne Condon and Grzegorz Rozenberg Eds.), Lecture Notes in Computer Science, Vol.2054, 2001, pp.17-26.

  49. Akio Nishikawa and Masami Hagiya: Towards a System for Simulationg DNA Computing with Whiplash PCR, CEC'99, Congress on Evolutionary Computation, 1999, pp.960-966.

  50. Akio Nishikawa, Masami Hagiya and Masayuki Yamamura: Virtual DNA Simulator and Protocol Design by GA, Proceedings of the Genetic and Evolutionary Computation Conference, GECCO'99, Vol.2, 1999, pp.1810-1816.

  51. * Mitsuharu Yamamoto and Masami Hagiya: Evolution of Inductive Definitions, IWPSE99, International Workshop on Principles of Software Evolution, Fukuoka Software Research Park, 1999, pp.17-21.

  52. * Akihiko Tozawa and Masami Hagiya: Careful Analysis of Type Spoofing, JIT'99 Java-Informations-Tage 1999 (Clemens H. Cap, Hrsg.), Informatik aktuell, Springer, 1999, pp.290-296.

  53. Jianguo Lu, Masateru Harao and Masami Hagiya: Higher Order Generalizaion, Logics in Artificial Intelligence JELIA'98 (Jurgen Dix, Luis Farinas del Cerro and Ulrich Furback, eds.), Lecture Notes in Artificial Intelligence, Springer-Verlag, Vol.1489, 1998, pp.368-381.

  54. * Masami Hagiya and Akihiko Tozawa: On a New Method for Dataflow Analysis of Java Virtual Machine Subroutines, Static Analysis, 5th International Symposium, SAS'98, Pisa, Italy, September 1998, Proceedings (Giorgio Levi, ed.), Lecture Notes in Computer Science, Springer-Verlag, Vol.1503, 1998, pp.17-32.

  55. * Koichi Takahashi and Masami Hagiya: Proving as Editing HOL Tactics, Informal proceedings of the Workshop on User Interfaces for Theorem Provers, UITP'98 (Roland Backhouse, ed.), Eindhoven University of Technology, 1998, pp.157-164. Also in Formal Aspects of Computing, Vol.11, No.3, 1999, pp.343-357.

  56. * Mitsuharu Yamamoto, Koichi Takahashi, Masami Hagiya, Shin-ya Nishizaki and Tetsuo Tamai: Formalization of Graph Search Algorithms and Its Applications, Theorem Proving in Higher Order Logics, 11th International Conference, TPHOLs'98, Canberra, Australia, September/October 1998, Proceedings (Jim Grundy, Malcolm Newey, eds.) Lecture Notes in Computer Science, Springer-Verlag, Vol.1479, 1998, pp.479-496.

  57. Kensaku Sakamoto, Daisuke Kiga, Ken Komiya, Hidetaka Gouzu, Shigeyuki Yokoyama, Shuji Ikeda, Hiroshi Sugiyama, and Masami Hagiya: State Transitions by Molecules, Preliminary Proceedings, Fourth International Meeting on DNA Based Computers, June 15 - June 19, 1998, University of Pennsylvania, pp.87-99. Also in BioSystems, Vol.52, No.1-3, 1999, pp.81-91.

  58. * Wei-Ngun Chin and Masami Hagiya: A Bounds Inference Method for Vector-Based Memoization, International Conference on Functional Programming '97, 1997, pp.176-187.

  59. * Yasuaki Takebe and Masami Hagiya: A User Interface for Controlling Term Rewriting Based on Computing-as-Editing Paradigm, User Interfaces for Theorem Provers UITP'97, INRIA Sophia-Antipolis, 1997, pp.93-100.

  60. Akira Suyama, Masanori Arita and Masami Hagiya: A Heuristic Approach for Hamiltonian Path Problem with Molecules, Genetic Programming 1997: Proceedings of the Second Annual Conference (John R. Koza, et al. eds.), Morgan Kaufmann, 1997, pp.457-462

  61. Masami Hagiya, Masanori Arita, Daisuke Kiga, Kensaku Sakamoto and Shigeyuki Yokoyama: Towards Parallel Evaluation and Learning of Boolean $\mu$-Formulas with Molecules, Preliminary Proceedings, 3rd DIMACS Workshop on DNA Based Computers, June 23 - June 25, 1997, University of Pennsylvania, pp.105-114. Also in DNA Based Computers III, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol.48, 1999, pp.57-72.

  62. Masanori Arita, Masami Hagiya and Akira Suyama: Joining and Rotating Data with Molecules, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC'97), 1997, pp.243-248.

  63. * Masami Hagiya and Hiroshi Kakuno: Proving as Editing, User-Interfaces for Theorem Provers UITP'96, Department of Computer Science, University of York, 1996, pp.35-42.

  64. * Mituharu Yamamoto, Shin-ya Nishizaki, Masami Hagiya and Yozo Toda: Formalization of Planar Graphs, Higher-Order Logic Theorem Proving and Its Applications, Lecture Notes in Computer Science, Springer-Verlag, Vol.971, 1995, pp.369-384.

  65. * Masami Hagiya and Kouhei Iino: Binding Time Analysis for Data Type Specialization, Fuji International Workshop on Functional and Logic Programming, World Scientific, 1995, pp.254-269.

  66. Masami Hagiya and Tomoki Shiratori: Programming by Example in Computing-as-Editing Paradigm, Proceedings of the 11th International IEEE Symposium on Visual Languages, 1995, pp.275-283.

  67. Tomoaki Shimada, Masami Hagiya, Masanori Arita, Shin-ya Nishizaki and Chew Lim Tan: Knowledge-Based Simulation of Regulatory Action in Lambda Phage, First International IEEE Symposium on Intelligence in Neural and Biological Systems (INBS 95), 1995, pp.92-99. Also in International Journal of Artificial Intelligence Tools, Vol.4, No.4, December 1995, pp.511-524.

  68. Masanori Arita, Masami Hagiya and Tomoki Shiratori: GEISHA System: An Environment for Simulating Protein Interaction, Genome Informatics Workshop V, 1994, pp.80-89.

  69. * Wei-Ngan Chin and Masami Hagiya: Tupling and Lambda Abstraction yield Dynamic-Sized Tabulation, Acta Informatica, Vol.32, 1995, pp.93-115.

  70. Masami Hagiya and Yozo Toda: On Implicit Arguments, Logic, Language and Computation --- Festschrift in Honor of Satoru Takasu, Lecture Notes in Computer Science Vol.792, 1994, pp.10-30. The revised version is in TR-95-1 from Department Information Science, University of Tokyo.

  71. Akira Suyama, Masami Hagiya, Takashi Ito, Asao Fujiyama, Akira Ohyama, Toshihisa Takagi: ContigMaker: Software Tool for Contig Map Construction, Genome Informatics Workshop IV, 1993, pp.376-384.

  72. Masami Hagiya: A Deductive Method for Construction and Visualization of Contigs in the STS Strategy, Genome Informatics Workshop IV, 1993, pp.65-72.

  73. Masami Hagiya: A Typed lambda-Calculus for Priving-by-Example and Bottom-Up Generalization Procedure, Algorithmic Learning Theory (K. P. Jantke, S. Kobayashi, E. Tomita and T. Yokomori eds.), Lecture Notes in Artificial Intelligence, Vol.744, 1993, pp.73-86. Also in Theoretical Computer Science, Vol.137, 1995, pp.3-23.

  74. Masami Hagiya: An iterative and bottom-up procedure for proving-by-example, Machine Learning: ECML-93 (Pavel B. Brazdil ed.), Lecture Notes in Artificial Intelligence, Vol.667, 1993, pp.336-341.

  75. Masami Hagiya: A formal approach to visual proving based on logic programming, Proceedings of the 1992 IEEE Workshop on Visual Languages, Seattle, Washington, 1992, pp.234-236.

  76. Masami Hagiya: Higher-order unification as a theorem proving procedure, Eighth International Conference on Logic Programming, MIT Press, 1991, pp.270-284.

  77. S. Liu and M. Hagiya: Model inference of constrained recursive figures, Proceedings of the First International Workshop on Algorithmic Learning Theory, OHMSHA Ltd., 1990, pp.355-367.

  78. Masami Hagiya: Synthesis of rewrite programs by higher-order and semantic unification, Proceedings of the First International Workshop on Algorithmic Learning Theory, 1990, pp.396-410. Also in New Generation Computing, Vol.8, No.4, 1991, pp.403-420.

  79. Masami Hagiya: Programming by example and proving by example using higher-order unification, 10th Conference on Automated Deduction (M. E. Stickel ed.), Lecture Notes in Aritifical Intelligence, Vol.448, 1990, pp.588-602.

  80. M. Hagiya and K. Ohtani: Parallel object-oriented UIMS with macro and micro stubs, Proceedings of the Winter 1990 USENIX Conference, 1990, pp.259-273.

  81. M. Hagiya, T. Hattori, A. Morishima, R. Nakajima, N. Niide, R. Okazaki, T. Sakuragawa, T. Suzuki, H. Tsuiki and T. Yuasa: Overview of GMW+Wnn system, Advances in Software Science and Technology, Vol.1, 1989, pp.133-156.

  82. Masami Hagiya: Meta-circular interpreter for a strongly typed language, Journal of Symbolic Computation, Vol.8, No.12, 1989, pp.651-680. This is the main Ph.D work.

  83. Masami Hagiya: Generalization by parametrization in higher order type theory, Theoretical Computer Science, Vol.63, 1989, pp.113-139.

  84. M. Hagiya, T. Hattori, A. Morishima, R. Nakajima, N. Niide, R. Okazaki, T. Sakuragawa, T. Suzuki, H. Tsuiki and T. Yuasa: Overview of GMW+Wnn system, Proceedings of 2nd IEEE International Conference on Computer Workstations, 1988, pp.170-177.

  85. Masami Hagiya and Takafumi Sakurai: Foundation of logic programming based on inductive definition, New Generation Computing, Vol.2, 1984, pp.59-77.

  86. Masami Hagiya: A proof description language and its reduction system, Publications of the Research Institute for Mathematical Sciences, Kyoto University, Vol.19, No.1, 1983, pp.237-261. This is the M.Sc. work.

  87. Masahiko Sato and Masami Hagiya: Hyperlisp, Algorithmic Languages (J.W. de Bakker and J.C. van Vliet eds.), North-Holland, 1981, pp.251-269.

Invited Papers

  1. Kazufumi Mizunuma and Masami Hagiya: Hybrid Method for Simulating Small-Number Molecular Systems, Algorithmic Bioprocesses (A. Condon, D. Harel, J. N. Kok, A. Salomaa, E. Winfree, Eds.), Natural Computing Series, Springer, 2009, pp.607-622.

  2. Miki Hirabayashi, Kazuhiro Oiwa, Akio Nishikawa, Fumiaki Tanaka, and Masami Hagiya: Toward Self-Assembly of Phage-Like Nanorobot, IEEE NANO 2009, 2009, pp.645-650.

  3. Masami Hagiya, Satsuki Yaegashi, and Keiichiro Takahashi: Computing with Hairpins and Secondary Structures of DNA, Nanotechnology: Science and Computation (Junghuei Chen, Natasha Jonoska, Grzegorz Rozenberg, Eds.) Natural Computing Series, Springer, 2005, pp.293-308.

  4. * Masami Hagiya, Koichi Takahashi, Mitsuharu Yamamoto and Takahiro Sato: Analysis of Synchronous and Asynchronous Cellular Automata using Abstraction by Temporal Logic, FLOPS2004: The Seventh Functional and Logic Programming Symposium, Lecture Notes in Computer Science, Vol.2998, 2004, pp.7-21.

  5. J. A. Rose, M. Takano, M. Hagiya and A. Suyama: A DNA Computing-based Genetic Program for in vitro Protein Evolution via Constrained Pseudomodule Shuffling, Journal of Genetic Programming and Evolvable Machines, Vol.4, 2003, pp.139-152.

  6. * Masami Hagiya: Towards Molecular Programming - a Personal Report on DNA8 and Molecular Computing, Modelling in Molecular Biology (G. Ciobanu, G. Rozenberg, Eds.), Natural Computing Series, Springer, 2004, pp.125-140.

  7. J. A. Rose, R. J. Deaton, M. Hagiya, and A. Suyama: A DNA-based in vitro Genetic Program, Journal of Biological Physics, Vol.28, 2002, pp.493-498.

  8. Masami Hagiya, John A. Rose, Ken Komiya, and Kensaku Sakamoto: Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms, Theoretical Computer Science, Vol.287, 2002, pp.59-71.

  9. * Masami Hagiya: From Molecular Computing to Molecular Programming, DNA Computing, 6th International Workshop on DNA-Based Computers, DNA 2000, (Anne Condon and Grzegorz Rozenberg Eds.), Lecture Notes in Computer Science, Vol.2054, 2001, pp.89-102.

  10. * Masami Hagiya and Koichi Takahashi: Discovery and Deduction, Discovery Science, Third International Conference, DS 2000, (Setsuo Arikawa and Shinichi Morishita Eds.), Lecture Notes in Artificial Intelligence, Vol.1967, 2000, pp.17-37.

  11. Masami Hagiya: Perspectives on Molecular Computing, New Generation Computing, Vol.17, No.2, 1999, pp.131-140.

  12. * Masami Hagiya: Towards Autonomous Molecular Computers, Genetic Programming 1998: Proceedings of the Third Annual Conference (John R. Koza, et al. eds.), Morgan Kaufmann, 1998, pp.691-699.

  13. Masami Hagiya: From programming-by-example to proving-by-example, Theoretical Aspects of Computer Software (T. Ito and A. R. Meyer eds.), Lecture Notes in Computer Science, Vol.526, 1991, pp.387-419.

Unrefereed Papers (including Unpublished Papers)

  1. Vinh Cuong Tran, Yoshinori Tanabe and Masami Hagiya: Abstract Model Checking of Web Applications Using Java PathFinder, JSSST 2009, Japan Society for Software Science and Technology, 2009.

  2. Yoshinori Tanabe and Masami Hagiya: Games and Natural Number-valued Semantics of the Modal $\mu$-calculus, JSSST 2009, Japan Society for Software Science and Technology, 2009.

  3. Yusuke Kawamoto, Hideki Sakurada and Masami Hagiya: Generic Result for Mapping Soundness of Symbolic Signature Primitives, JSSST 2008, Japan Society for Software Science and Technology, 2008.

  4. Vinh Cuong Tran, Hideki Hashimoto, Tanabe Yoshinori and Masami Hagiya: Verification of Java programs under fairness assumption, JSSST 2008, Japan Society for Software Science and Technology, 2008.

  5. Mitsuharu Yamamoto, Yoshinori Tanabe, Koichi Takahashi, and Masami Hagiya: Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification, IFIP TC2, Verified Software: Theories, Tools, Experiments, 2005.

  6. * Seika Abe, Masami Hagiya and Takao Nakajima: Code Generation for a DNA Computer by Integer Linear Programming, Proceedings of the 2004 IEEE Conference on Cybernetics and Intelligent Systems, Singapore, 1-3 December, 2004, pp.268-273.

  7. Keiichiro Takahashi and Masami Hagiya: Preliminary Experiments on Hairpin Structure Dissociation for Constructing Robust DNA Machines, Proceedings of the 2004 IEEE Conference on Cybernetics and Intelligent Systems, Singapore, 1-3 December, 2004, pp.285-290.

  8. Masami Hagiya: DNA Nanorobotics and Sequence Design, Proc. SICE Annual Conference, Sapporo, 2004, pp.2774-2778.

  9. Keiichiro Takahashi and Masami Hagiya: On Computation of Minimum Free Energy and Partition Function of Multiple Nucleic Acid Sequences, FIT2004, Forum on Information Science and Technology, 2004, Vol.1, pp.91-92.

  10. Hiroki Uejima and Masami Hagiya: Analyzing Secondary Structure Transition Paths of DNA/RNA Molecules, DNA9, Ninth International Meeting on DNA Based Computers, Preliminary Proceedings, 2003, pp.92-96. Also in DNA Computing, 9th International Workshop on DNA-Based Computers, DNA9, Madison, WI, USA, June 2003, Revised Papers, Lecture Notes in Computer Science, Springer, Vol.2943, 2004, pp.86-90.

  11. Atsushi Kameda, Masahito Yamamoto, Hiroki Uejima, Masami Hagiya, Kensaku Sakamoto and Azuma Ohuchi, Conformational Addressing using the hairpin structure of single-strand DNA, DNA9, Ninth International Meeting on DNA Based Computers, Preliminary Proceedings, 2003, pp.197-201. Also in DNA Computing, 9th International Workshop on DNA-Based Computers, DNA9, Madison, WI, USA, June 2003, Revised Papers, Lecture Notes in Computer Science, Springer, Vol.2943, 2004, pp.219-224.

  12. Mitsuharu Yamamoto and Masami Hagiya: Abstract A* Algorithm and Its Application to Linearly Priced Timed Automata, Proceedings of The Second Asian Workshop on Programming Languages and Systems (APLAS 2001), ROPAS Technical Memorandum 2001-16, KAIST (Korea Advanced Institute of Science and Technology), December 17-18, 2001, pp.193-205.

  13. Masami Hagiya, Mitsuharu Yamamoto and Jean-Marie Cottin: Symbolic Analysis of Timed Multiset Rewriting and Its Application to Protocol Analysis (Extended Abstract), Rewriting in Proof and Computation, International Workshop, RPC'01, The Research Institute of Electrical Communication (RIEC), Tohoku University, October 25-27, 2001, pp.34-41.

  14. * Masami Hagiya and Koichi Takahashi: Searching for Synchronization Algorithms using BDDs, IPSJ PRO, Information Processing Society of Japan, January 2001.

  15. John A. Rose, Akira Suyama, Masami Hagiya and Russel J. Deaton: An Antisense Antidote for Whiplash PCR, IPSJ Symposium Series, Vol.2000, No.16, Information Processing Society of Japan, 2000, pp.101-108.

  16. * Koichi Takahashi and Masami Hagiya: Abstraction of Link Structures by Regular Expressions and Abstract Model Checking of Concurrent Garbage Collection, First Asian Workshop on Programming Languages and Systems, National University of Singapore, 2000, pp.1-8.

  17. * Koichi Takahashi, Yozo Toda and Masami Hagiya: Nonce Analysis and Strand Space Model, JSSST 2000, Japan Society for Software Science and Technology, 2000.

  18. Akihiko Tozawa and Masami Hagiya: New Formalization of the JVM, 2000.

  19. * Masami Hagiya, Yozo Toda and Yoshiki Fukuba: Implementation and Verification of Authentication Protocols, Using Proof Procedures in HOL, Workshop on Enterprise Security (SSR99), Science University of Tokyo, November 11, 1999.

  20. Koichi Takahashi and Masami Hagiya: Verification of Parallel Garbage Collection by Abstract Model Checking, 1999.

  21. * Masami Hagiya: On a New Method for Dataflow Analysis of Java Virtual Machine Subroutines, IPSJ PRO, Information Processing Society of Japan, PRO-17-3, 1998, pp.13-18. The longer and newer version is here.

  22. Masami Hagiya: Unification and Inductive Theorem Proving by Transformation of Equations with Recursors, JSSST'96, Japan Society for Software Science and Technology, 1996, pp.97-100.

  23. Masami Hagiya, Hiroshi Watanabe and Toshiko Kitamura: On Merging Resolution and Induction, IPSJ PRO, Information Processing Society of Japan, PRO-6-12, 1996, pp.67-72.

  24. Masanori Arita, Masami Hagiya and Tomoki Shiratori: SIMFLY: The Simulation of a Fly Embryo, Genome Informatics Workshop V, 1994, pp.230-231.

  25. Akira Suyama, Akira Ohyama, Masami Hagiya, Yoshiaki Furuhata, Takashi Ito, Asao Fujiyama, Masahira Hattori, Yoshiyuki Sakaki, Toshihisa Takagi: ContigMaker and SAND: Software Tools for Genome Mapping and Sequencing, Genome Informatics Workshop V, 1994, pp.198-199.

  26. Masami Hagiya: On Reduction and Projection in Type Theory with Inductive Definitions, 12th International Conference on Automated Deduction, Workshop 1B: Proof Search in Type-Theoretic Languages, 1994, pp.31-38.

  27. Masami Hagiya: Running Higher-Order Unification in PaiLisp, Parallel Symbolic Computing: Languages, Systems, and Applications (Robert H. Halstead, Jr., Takayasu Ito, eds.), Lecture Notes in Computer Science, Vol.748, 1993, pp.155-160.

  28. Masami Hagiya: Boomborg-PC: A Proof-Checker of Calculus of Constructions Running on a Buffer of GNU Emacs, Department of Information Science, University of Tokyo, 1992, 1995.

  29. Masami Hagiya: An Operational Approach to Type Safety, 1992.

  30. Masami Hagiya: Explanation-based Generalization in Logical Framework, 1989.

  31. Masami Hagiya: Theory of Modal Logic Programming, 1985.

Tutorials

  1. * Masami Hagiya: Information Technology for Synthetic Biology, The 20th International Conference on Genome Informatics (GIW 2009), 2009.

  2. Masami Hagiya: Molecular Computation Using Hairpins and Secondary Structures of DNA, Handbook of Theoretical and Computational Nanotechnology, Vol.6, Chapter 18, American Scientific Publishers, 2007, pp.817-840

  3. Masami Hagiya: Program Synthesis --- Past, Present and Future, InfoJapan 90, Information Processing Society of Japan, 1990.

Books (including Books Edited)

  1. Y. Suzuki, M. Hagiya, H. Umeo and A. Adamatzky: Natural Computing, 2nd International Workshop on Natural Computing, Nagoya, Japan, December 2007, Proceedings, Proceedings in Information and Communication Technology, PICT1, Springer, 2008.

  2. Masami Hagiya and Philip Wadler: Functional and Logic Programming, 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 2006, Proceedings, Lecture Notes in Computer Science, Vol.3945, Springer, 2006.

  3. Masami Hagiya and Azuma Ohuchi: DNA Computing, 8th International Workshop on DNA-Based Computers, DNA8, Sapporo, Japan, June 2002, Revised Papers, Lecture Notes in Computer Science, Vol.2568, Springer, 2003.

  4. J. van Leeuwen, O. Watanabe, M. Hagiya, P.D. Mosses, and T. Ito: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, Lecture Notes in Computer Science, Vol.1872, Springer-Verlag, 2000.

  5. Neil D. Jones, Masami Hagiya and Masahiko Sato: Logic, Language and Computation --- Festschrift in Honor of Satoru Takasu, Lecture Notes in Computer Science, Vol.792, Springer-Verlag, 1994.

  6. Masami Hagiya and John C. Mitchell: Theoretical Aspects of Computer Software --- International Symposium TACS'94, Sendai, Japan, April 1994, Proceedings, Lecture Notes in Computer Science, Vol.789, Springer-Verlag, 1994.

  7. Ikuo Nakata and Masami Hagiya: Software Science and Engineering --- Selected Papers from the Kyoto Symposia, World Scientific, 1991.

  8. Taiichi Yuasa and Masami Hagiya: Introduction to Common Lisp, Academic Press, Inc., 1987.

Software

Hack and perish!

Original Software

  1. net-iocache with Watcharin Leungwattanakit, Cyrille Artho, etc.
  2. Supporting SBUML by Richard Potter.
  3. VNA: Simulator for Virtual DNA Experiments with Akio Nishikawa.
  4. Boomborg-HOL with Koichi Takahashi.
  5. Boomborg-KEISAN with Tomoki Shiratori.
  6. SIMFLY with Masanori Arita and Tomoki Shiratori.
  7. ContigMaker with Akira Suyama et al.
  8. Boomborg-PC helped by Yozo Toda and Mitsuharu Yamamoto.
  9. G Strikes Back with Koji Otani and many people.
  10. Gimme More Windows with Koji Otani and many people.
  11. Kyoto Common Lisp with Taiichi Yuasa.
  12. Prolog11P.
  13. Hyperlisp with Masahiko Sato.

International Activities

Program Committee (not exhaustive)

Editorial Board

Short Personal History

Publications in Japanese

Papers (Refereed)

  1. $B@nK\M5Je(B, $B??Ln7r(B, $B]/ED1Q;8J(B: $B4X?tItJ,CN<1$HF?L>@-8!>Z(B, $BF|K\1~MQ?tM}3X2qO@J8;o(B, Vol.17, No.4, 2007, pp.559-576. ($BF|K\1~MQ?tM}3X2qO@J8>^(B($BM}O@ItLg(B)$B^(B)

  2. $BGkC+>;8J(B: $B?tM}E*5;K!$K$h$k>pJs%;%-%e%j%F%#$N8!>Z(B, $B1~MQ?tM}(B, Vol.17, No.4, 2007, pp.8-15.

  3. $Bc7F#9'F;(B, $B54F,MxG7(B, $BGkC+>;8J(B, $B9B8}J8M:(B: SSH$B%Q%9%o!<%I%f!<%6G'>Z$N@H$B>pJs=hM}3X2qO@J8;o(B, Vol.47, No.4, 2006, pp.1118-1126.

  4. $BEDJUNIB'(B, $B9b669'0l(B, $B;3K\8w@2(B, $B:4F#5.MN(B, $BGkC+>;8J(B: BDD$B$rMQ$$$?(B2$BJ}8~(BCTL$BO@M}<0=$B%3%s%T%e!<%?%=%U%H%&%'%"(B, Vol.22, No.3, 2005, pp.154-166.

  5. $B0$It@52B(B, $BGkC+>;8J(B: $B@0?t@~7A7W2hK!$rMQ$$$?(BDNA$B%3%s%T%e!<%?@)8f%3!<%I$N@8@.(B, $B>pJs=hM}3X2qO@J8;o%W%m%0%i%_%s%0(B, Vol.45, No.SIG9(PRO22), 2004, pp.1-13.

  6. $BGkC+>;8J(B, $BC]BZ%W%m%H%3%k$N8!>Z(B, $B%3%s%T%e!<%?%=%U%H%&%'%"(B, Vol.20, No.3, 2003, pp.17-29.

  7. $B8MBt>=I'(B, $BGkC+>;8J(B: JAVA2$B$N(BPermission$B5!9=$N%b%G%k2=$H$B%3%s%T%e!<%?%=%U%H%&%'%"(B, Vol.18, No.6, 2001, pp.43-53.

  8. $BGkC+>;8J(B, $B9b669'0l(B: $B%b%G%k8!::7O$rMQ$$$?%W%m%0%i%`H/8+(B, $B?M9)CNG=3X2q;o(B, Vol.16, No.5, 2001, pp.648-654.

  9. $Bc7F#9'F;(B, $BGkC+>;8J(B, $B9B8}J8M:(B: $B8x3+80$rMQ$$$?G'>Z%W%m%H%3%k$K$D$$$F(B, $B>pJs=hM}3X2qO@J8;o(B, Vol.42, No.8, 2001, pp.2040-2048.

  10. $B9b669'0l(B, $BGkC+>;8J(B: $B@5B'I=8=$rMQ$$$?JBNs$4$_=8$a$NCj>]%b%G%k8!::(B, $B>pJs=hM}3X2qO@J8;o%W%m%0%i%_%s%0(B, Vol.42, No.SIG2(PRO9), 2001, pp.61-70.

  11. $B;3K\8w@2(B, $B9b669'0l(B, $BGkC+>;8J(B, $B@>:j??Li(B, $B6L0fE/M:(B: $B%0%i%UC5:w%"%k%4%j%:%`$NH/E8$H$=$N1~MQ(B, $B%3%s%T%e!<%?%=%U%H%&%'%"JL:}(B, $B%=%U%H%&%'%"H/E8(B, Vol.19, No.0, 2001, pp.92-108.

  12. $BGkC+>;8J(B, $B8MBt>=I'(B, $B9b669'0l(B, $B@>:j??Li(B: Java$B$N%/%i%9%m!<%@@)Ls$NDj<02=(B, $B>pJs=hM}3X2qO@J8;o%W%m%0%i%_%s%0(B, Vol.41, No.SIG4(PRO7), 2000, pp.79-87.

  13. $B;32;8J(B: $B!V8-$$;f!W!&;f$KKd$a9~$^$l$?%W%m%0%i%`$K$h$k;f%$%s%?%U%'!<%9$NDs0F(B, $B%$%s%?%i%/%F%#%V%7%9%F%`$H%=%U%H%&%'%"(BVII, $B%l%/%A%c!<%N!<%H(B/$B%=%U%H%&%'%"3X(B, $B6aBe2J3X
  14. $B8MEDMN;0(B, $BGkC+>;8J(B: $B%?%/%F%#%/$+$i$N%W%m%0%i%`Cj=P$H$=$N1~MQ(B, $B>pJs=hM}3X2qO@J8;o%W%m%0%i%_%s%0(B, Vol.40, SIG4(PRO3), 1999, pp.21-32.

  15. $BGkC+>;8J(B, $B9b669'0l(B: $B!V7W;;!aJT=8!W%Q%i%@%$%`$K=>$&(BHOL$B%?%/%F%#%/$N$?$a$N(BEmacs$B%$%s%?%U%'!<%9(B, $B%$%s%?%i%/%F%#%V%7%9%F%`$H%=%U%H%&%'%"(BV, $B%l%/%A%c!<%N!<%H(B/$B%=%U%H%&%'%"3X(B, $B6aBe2J3X
  16. $BC]JULw><(B, $BGkC+>;8J(B: CAEP$B$K4p$E$$$?9`=q$-49$(@)8f$N%f!<%6%$%s%?%U%'!<%9(B, $B%$%s%?%i%/%F%#%V%7%9%F%`$H%=%U%H%&%'%"(BIV, $B%l%/%A%c!<%N!<%H(B/$B%=%U%H%&%'%"3X(B, $B6aBe2J3X
  17. $BGkC+>;8J(B, $BGr $B!V7W;;!aJT=8!W%Q%i%@%$%`$K4p$E$/Nc$K$h$k%W%m%0%i%_%s%0(B, $B%3%s%T%e!<%?%=%U%H%&%'%"(B, Vol.13, No.3, 1996, pp.64-78. ($BF|K\%=%U%H%&%'%"2J3X2qO@J8>^^(B)

  18. $B;3K\8w@2(B, $BGkC+>;8J(B, $BGr:j??Li(B: $B?^E*BP>]$r07$&>ZL@%A%'%C%+$N$?$a$N;k3P2=%D!<%k(B $B%$%s%?%i%/%F%#%V%7%9%F%`$H%=%U%H%&%'%"(BIII, $B%l%/%A%c!<%N!<%H(B/$B%=%U%H%&%'%"3X(B, $B6aBe2J3X
  19. $B3QLn9(;J(B, $BM-ED@55,(B, $BGkC+>;8J(B, $BGr Computing-as-Editing(CAEP)$B$K4p$E$$$?(B $B?t<0=hM}%7%9%F%`$N%f!<%6!&%$%s%?%U%'!<%9(B, $B%$%s%?%i%/%F%#%V%7%9%F%`$H%=%U%H%&%'%"(BIII, $B%l%/%A%c!<%N!<%H(B/$B%=%U%H%&%'%"3X(B, $B6aBe2J3X
  20. $B2CF#OBI'(B, $BGkC+>;8J(B, $B@iMU<"(B, $B0=DMM5Fs(B, $B1WEDN4;J(B: $B%*%V%8%'%/%H;X8~%G!<%?%Y!<%9$rMQ$$$?(B $B%0%i%U%#%+%k%f!<%6%$%s%?!<%U%'!<%9%7%9%F%`$K$D$$$F(B, $B%"%I%P%s%9%H!&%G!<%?%Y!<%9%7%9%F%`!&%7%s%]%8%&%`(B, $B>pJs=hM}3X2q(B, 1992.

  21. $BGkC+>;8J(B: $B9b3,C10l2=$H>ZL@$N0lHL2=(B, $B?M9)CNG=3X2q;o(B, Vol.6, No.3, 1991, pp.388-396.

  22. $BBgC+9@;J(B, $B3QLn9(;J(B, $B;yEg>4(B, $BGkC+>;8J(B, $BI~ItN4;V(B, $BN-e$N%"%W%j%1!<%7%g%s9=C[$K$D$$$F(B, $B%3%s%T%e!<%?%=%U%H%&%'%"(B, Vol.7, No.1, 1990, pp.45-60.

Papers (Invited)

  1. $BGkC+>;8J(B: DNA$B%m%\%C%H$N<+F0@_7W$K8~$+$C$F(B $B!=(B DNA$B%J%N%F%/%N%m%8!<$H9g@.@8J*3X$H>pJs2J3X(B $B!=(B, $B7WB,<+F0@)8f3X2q(B, $B%7%9%F%`>pJsItLg9V1i2q(B (SSI09), 2009.

  2. $BGkC+>;8J(B, $B;3B<2m9,(B: $BJ,;R%W%m%0%i%_%s%0(B, $B%=%U%H%&%'%"9)3X$N4pAC(BXIV, $B%l%/%A%c!<%N!<%H(B/$B%=%U%H%&%'%"3X(B, $B6aBe2J3X

  3. $BGkC+(B $B>;8J(B: $BBgMFNL(BDNA$B%a%b%j$H%i%s%@%`@-$N3hMQ(B, $B?tM}%b%G%k2=$HLdBj2r7h%7%s%]%8%&%`(B, ISSN 1344-0640, $B>pJs=hM}3X2q%7%s%]%8%&%`%7%j!<%:(B, Vol.2006, Nol.10, 2006 pp.9-16.

  4. $BGkC+(B $B>;8J(B: $BJ,;R%3%s%T%e!<%?$NM}O@$H9=C[(B, $B?M9)CNG=3X2qA49qBg2q(B($BBh(B11$B2s(B)$BO@J8=8(B, 1997, pp.9-17.

Papers (Unrefereed)

  1. $B%&%Y!<%k!&%3%b%s(B-$B%k%s%I(B, $BGkC+>;8J(B, $B@nK\M5Je(B, $B]/ED1Q@-(B, $BF|K\1~MQ?tM}3X2q(B2009$BG/EYG/2q9V1iM=9F=8(B, 2009.

  2. $B@nK\M5Je(B, $B]/ED1Q;8J(B: $B%j%s%0=pL>$N7W;;O@E*$K7rA4$J7A<02=(B, $BF|K\1~MQ?tM}3X2q(B2008$BG/EYG/2q9V1iM=9F=8(B, 2008, pp.179-180.

  3. $BGkC+>;8J(B: Excel$B$G%W%m%0%i%`$r=q$/(B, $B2F$N%W%m%0%i%_%s%0!&%7%s%]%8%&%`(B, $B!V(BFirst Programming Languages $B%W%m%0%i%_%s%08@8l$NpJs=hM}3X2q(B, 2008, pp.5-11.

  4. $B]/ED1Q;8J(B: $B%V%i%$%s%I=pL>$r07$&$3$H$,2DG=$J7W;;O@E*$K7rA4$J%W%m%H%3%k8!>ZK!(B, $BF|K\1~MQ?tM}3X2q(B2007$BG/EYG/2q9V1iM=9F=8(B, 2007, pp.42-43.

  5. $B8^==MrBg(B, $BEDJUNIB'(B, $B@>_7905#(B, $BGkC+>;8J(B: min-plus$BBe?t(BN$B!g(B$B>e$NMMAj&L7W;;$H$=$N1~MQ(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B24$B2sBg2q(B, 2007.

  6. $BEDJUNIB'(B, $BGkC+>;8J(B: $B3,AXE*%0%i%U9=B$$N5-=R$H8!>Z$N$?$a$NMMAjO@M}(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B23$B2sBg2q(B, 2006.

  7. $B@nK\M5Je(B, $B??Ln7r(B, $B]/ED1Q;8J(B: $BEE;REjI<%W%m%H%3%k$NF?L>@-8!>Z$N$?$a$N4X?tItJ,CN<1%b%G%k(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B23$B2sBg2q(B, 2006.

  8. $B]/ED1Q;8J(B: $BA+0\4X78$N>\:Y2=$K$h$k@5B'%b%G%k8!::$N:F9=@.$H3HD%(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B23$B2sBg2q(B, 2006.

  9. $B0$It@52B(B, $BGkC+>;8J(B, $B@%@n=$(B: DNA $B%3%s%T%e!<%?@)8f%3!<%I$N:GE,2=(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B22$B2sBg2q(B, 2005.

  10. $B;3K\8w@2(B, $BGkC+>;8J(B: $B;~AjO@M}$K$h$kCj>]2=$rMQ$$$?8!>Z$H$=$N1~MQ(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B22$B2sBg2q(B, 2005.

  11. $BEDJUNIB'(B, $B9b669'0l(B, $B;3K\8w@2(B, $B:4F#5.MN(B, $B8MBt>=I'(B, $BGkC+>;8J(B: BDD$B$K$h$k $BF|K\%=%U%H%&%'%"2J3X2q(B, PPL2005, 2005.

  12. $BCf@n9&?M(B, $B%]%C%?!<(B $B%j%A%c!<%I(B, $B;3K\8w@2(B, $BGkC+>;8J(B, $B2CF#OBI'(B: SBUML$B$H(BGDB$B$NO"7H$K$h$k%^%k%A%W%m%;%9%"%W%j%1!<%7%g%s$N%b%G%k8!::(B, $BBh(B2$B2s%G%#%Z%s%@%V%k%=%U%H%&%'%"%o!<%/%7%g%C%W(BDSW2005$BO@J8=8(B, $BF|K\%=%U%H%&%'%"2J3X2q8&5f2q;qNA%7%j!<%:(B, No.35, 2005, pp.13-21.

  13. $B;3K\8w@2(B, $BGkC+>;8J(B: $B3J;R>u$NMMAj$r;}$D;~AjO@M}$K$h$kCj>]2=$N$?$a$N=$BF|K\%=%U%H%&%'%"2J3X2qBh(B21$B2sBg2q(B, 2004.

  14. $B:4F#5.MN(B, $BEDJUNIB'(B, $BGkC+>;8J(B: BDD$B$rMQ$$$?%,!<%IIU$-%U%i%0%a%s%H$N=$BF|K\%=%U%H%&%'%"2J3X2qBh(B21$B2sBg2q(B, 2004.

  15. $BCf@n9&?M(B, $BGkC+>;8J(B, $B%]%C%?!<%j%A%c!<%I(B: SBUML$B$rMQ$$$?(BOS$B%l%Y%k$G$N(BUndo$B$N$BF|K\%=%U%H%&%'%"2J3X2qBh(B21$B2sBg2q(B, 2004.

  16. $BGkC+>;8J(B, $B9b669'0l(B, $B;3K\8w@2(B, $B:4F#5.MN(B: $B;~AjO@M}$K$h$kCj>]2=$rMQ$$$?%;%k!&%*!<%H%^%H%s$N2r@O(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B20$B2sBg2q(B, 2003.

  17. $B>>2<9L;0(B, $BGkC+>;8J(B: $B7HBSEEOC>e$K$*$1$k>ZL@IU$-G'>Z(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B20$B2sBg2q(B, 2003.

  18. $BGkC+>;8J(B: $B%0%i%U=q$-49$($H;~6u4VMMAjO@M}(B, $B>pJs=hM}3X2q(B, $B%W%m%0%i%_%s%08&5f2q(B, 2003.

  19. $B@>_7(B $B905#(B, $BGkC+(B $B>;8J(B: Linear Logical Framework $B$N3HD%$K$h$k(B Local Model Checking $B$N7A<0E*8!>Z(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B19$B2sBg2q(B, 2002.

  20. * $BGkC+>;8J(B, $B;3K\8w@2(B, $B%8%c%s(B-$B%^%j(B $B%3%?%s(B: $B;~4VIU$-B?=E=89g=q$-49$($KBP$9$k5-9fE*2r@O$H$=$N%W%m%H%3%k2r@O$X$N1~MQ(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B18$B2sBg2q(B, 2001.

  21. * $B;3K\8w@2(B, $BGkC+>;8J(B: $BCj>]E~C#2DG=@-8!::$N(BPriced Timed Automaton$B$X$N1~MQ(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B18$B2sBg2q(B, 2001.

  22. $BGkC+>;8J(B, $B9b669'0l(B: $B>ZL@$NI=8=(B, $B2F$N%W%m%0%i%_%s%0%7%s%]%8%&%`!V7W;;5!$HI=8=!WJs9p=8(B, 2000$BG/(B8$B7n(B30$BF|!A(B9$B7n(B1$BF|(B, $B>pJs=hM}3X2q(B, 2001, pp.89-92.

  23. $BGkC+>;8J(B, $B>.5\7r(B, $B:dK\7r:n(B: SAT Engine$B$N7W;;NL(B --- $B3NN(%"%k%4%j%:%`$H$7$F$N(BDNA$B%"%k%4%j%:%`(B ---, $B?7$7$$7W;;%Q%i%@%$%`%7%s%]%8%&%`(B2000 $BO@J8=8(B, $B>pJs=hM}3X2q%7%s%]%8%&%`%7%j!<%:(B, Vol.2000, No.16, 2000, pp.109-114.

  24. $B:dK\7r:n(B, $B>.5\7r(B, $B2#;3LPG7(B, $BGkC+>;8J(B: DNA$BJ,;R$N<+8J2q9gH?1~$N2r@O(B, $B?7$7$$7W;;%Q%i%@%$%`%7%s%]%8%&%`(B2000 $BO@J8=8(B, $B>pJs=hM}3X2q%7%s%]%8%&%`%7%j!<%:(B, Vol.2000, No.16, 2000, pp.115-121.

  25. $BGkC+>;8J(B: $B3J;R%b%G%k$K$h$k%X%"%T%s7A@.$N%7%_%e%l!<%7%g%s(B, $B?7$7$$7W;;%Q%i%@%$%`%7%s%]%8%&%`(B2000 $BO@J8=8(B, $B>pJs=hM}3X2q%7%s%]%8%&%`%7%j!<%:(B, Vol.2000, No.16, 2000, p.85.

  26. $B;32;8J(B: $B%*%U%i%$%s;f%f!<%6%$%s%?%U%'!<%9$N$?$a$NNc$K$h$k?^7AG'<1%W%m%0%i%_%s%0(B, $B%$%s%?%i%/%F%#%V%7%9%F%`$H%=%U%H%&%'%"(BVIII, $B%l%/%A%c!<%N!<%H(B/$B%=%U%H%&%'%"3X(B, $B6aBe2J3X
  27. $B9b669'0l(B, $B8MEDMN;0(B, $BGkC+>;8J(B: $B%N%s%92r@O$H%9%H%i%s%I6u4V%b%G%k(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B17$B2sBg2qO@J8=8(B, 2000. English version is here.

  28. $B8MBt>=I'(B, $BGkC+>;8J(B: Java2$B$N(BPermission$B5!9=$N%b%G%k2=$H$BBh(B2$B2s%W%m%0%i%_%s%0$*$h$S%W%m%0%i%_%s%08@8l%o!<%/%7%g%C%W(B, $BF|K\%=%U%H%&%'%"2J3X2q(B, 2000.

  29. $BGkC+>;8J(B: $B8!>Z7O$rMQ$$$?%"%k%4%j%:%`$NH/8+(B, $BBh(B41$B2s%W%m%0%i%_%s%0!&%7%s%]%8%&%`Js9p=8(B, $B>pJs=hM}3X2q(B, 2000, pp.9-19.

  30. $B;3K\8w@2(B, $B9b669'0l(B, $BGkC+>;8J(B: $B%b%G%k8!::%"%k%4%j%:%`$N8!>Z$K$D$$$F(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B16$B2sBg2qO@J8=8(B, 1999, pp.337-344.

  31. $B9b669'0l(B, $BGkC+>;8J(B: $BDjM}>ZL@$K$*$1$k?^E*?dO@$N7rA4$J $BF|K\%=%U%H%&%'%"2J3X2qBh(B16$B2sBg2qO@J8=8(B, 1999, pp.81-84.

  32. $B9b669'0l(B, $BGkC+>;8J(B: $BCj>]%b%G%k8!::$K$h$kJBNs$4$_=8$a$N8!>Z(B, $BBh(B2$B2s%W%m%0%i%_%s%0$*$h$S1~MQ$N%7%9%F%`$K4X$9$k%o!<%/%7%g%C%W(B, SPA'99, $BF|K\%=%U%H%&%'%"2J3X2q(B, 1999.

  33. $B;3K\8w@2(B, $BGkC+>;8J(B: $B5"G$BF|K\%=%U%H%&%'%"2J3X2qBh(B15$B2sBg2qO@J8=8(B, 1998, pp.405-408.

  34. $BGkC+>;8J(B, $B9b669'0l(B, $B@>:j??Li(B: Java$B%/%i%9%m!<%@$NDj<02=$H%P%$%J%j8_49@-(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B15$B2sBg2qO@J8=8(B, 1998, pp.89-92.

  35. * $BGkC+>;8J(B: Java$B2>A[5!3# $BBh(B1$B2s%W%m%0%i%_%s%0$*$h$S1~MQ$N%7%9%F%`$K4X$9$k%o!<%/%7%g%C%WO@J8=8(B, $BF|K\%=%U%H%&%'%"2J3X2q(B, 1998. Also in $B>pJs=hM}3X2q(B, $B%W%m%0%i%_%s%08&5f2q(B, PRO-17-3, 1997.

  36. * $BGkC+>;8J(B, $B;3K\8w@2(B, $B9b669'0l(B, $B@>:j??Li(B, $B6L0fE/M:(B: $B%0%i%UC5:w%"%k%4%j%:%`$N7A<02=$H$=$N1~MQ(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B14$B2sBg2qO@J8=8(B, 1997, pp.593-596.

  37. * $B8MEDMN;0(B, $BGkC+>;8J(B: $B%?%/%F%#%/$N0lHL2=$K$h$k%W%m%0%i%`Cj=P(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B14$B2sBg2qO@J8=8(B, 1997, pp.561-564.

  38. $B8MEDMN;0(B, $BGkC+>;8J(B: tactic$B$+$i$N%W%m%0%i%`Cj=P(B, $B>pJs=hM}3X2q(B, $B%W%m%0%i%_%s%08&5f2q(B, PRO-12-2, 1997, pp.9-14.

  39. $BGr;8J(B: $BJT=8!a7W;;%Q%i%@%$%`$HNc$K$h$k%W%m%0%i%_%s%0(B, $B>pJs=hM}3X2q(B, $B%W%m%0%i%_%s%08&5f2q(B, PRO-3-1, 1995, pp.1-2.

  40. $BGkC+>;8J(B: $B@)LsIU$-7?M}O@$N $B4X?t%W%m%0%i%_%s%0(BII, JSSST'94, $B%l%/%A%c!<%N!<%H!?%=%U%H%&%'%"3X(B, $B6aBe2J3X
  41. $B@u0f90;R(B, $B@>:j??Li(B, $BGkC+>;8J(B: $B<+A38@8l%$%s%?!<%U%'!<%9$rMQ$$$?8!:w7k2L$N;k3P2=(B, 1993$BG/EY?M9)CNG=3X2qA49qBg2q(B, 1993, pp.589-592.

  42. $BGkC+>;8J(B: $B%F%-%9%H!&%(%G%#%?>e$N>ZL@%A%'%C%+(B, $B>pJs=hM}3X2q(B, $B%W%m%0%i%_%s%0(B-$B8@8l!&4pAC!& PRG-7-9, 1992.

  43. $BGkC+>;8J(B: $B5"G $B>pJs=hM}3X2q(B, $B%=%U%H%&%'%"4pACO@8&5f2q(B, SF-38-7, 1990.

  44. $BGkC+>;8J(B: $BDjM}>ZL@ $B>pJs=hM}3X2q(B, $B%=%U%H%&%'%"4pACO@8&5f2q(B, SF-36-3, 1990.

  45. $BGkC+>;8J(B: $B%*%V%8%'%/%H;X8~8@8l$K$*$1$k7?$N3HD%@-$K$D$$$F(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B4$B2sBg2qO@J8=8(B, 1987, pp.151-154

  46. $BGkC+>;8J(B: G$B$O(BGMW$B$N(BG --- GMW$B%&%#%s%I%&!&%7%9%F%`$N3HD%MQ8@8l(BG$B$K$D$$$F(B, $B>pJs=hM}3X2q(B, $B%W%m%0%i%_%s%08@8l8&5f2q(B, PL-13-1, 1987.

  47. $BGkC+>;8J(B: $B7?$N$"$k8@8l$K$*$1$k(Bmeta-circular$B$J%$%s%?!<%W%j%?$K$D$$$F(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B3$B2sBg2qO@J8=8(B, 1986, pp.9-15.

  48. $BGkC+>;8J(B: $B9=@.E*7?M}O@$K$*$1$k0lHL2=$K$D$$$F(B, $BF|K\%=%U%H%&%'%"2J3X2qBh(B2$B2sBg2qO@J8=8(B, 1985, pp.189-192. ($BF|K\%=%U%H%&%'%"2J3X2q9b66>)Ne>^^(B)

  49. $BEr@uB@0l(B, $BGkC+>;8J(B: Kyoto Common Lisp$B$N $B>pJs=hM}3X2q(B, $B5-9f=hM}8&5f2q(B, SYM-34-1, 1985.

  50. $BEr^IB@0l(B, $BGkC+>;8J(B: Common Lisp$B%7%9%F%`e$NLdBjE@(B, $B>pJs=hM}3X2q(B, $B5-9f=hM}8&5f2q(B, SYM-32-9, 1985.

  51. $BGkC+>;8J(B: Theory of Modal Logic Programming, $B>pJs=hM}3X2q(B, $B%=%U%H%&%'%"4pACO@8&5f2q(B, SF-9-4, 1984.

  52. $BGkC+>;8J(B: Prolog Shell ----Prolog with Modality, $B>pJs=hM}3X2q(B, $B5-9f=hM}8&5f2q(B, SYM-28-2, 1983.

  53. $BGkC+>;8J(B: Lazy Reduction$B$K$h$k(BHA$B$N(BNormalization, $B>pJs=hM}3X2qBh(B23$B2s(B($B> 1981, pp.31-32.

  54. $BGkC+>;8J(B, $B:4F#2mI'(B: Hyperlisp$B$H$=$N(Bimplementation, $B>pJs=hM}3X2q(B, $B5-9f=hM}8&5f2q(B, SYM-14-3, 1980.

Tutorials

  1. $BGkC+>;8J(B: $B@8L?$N!V$7$+$1!W$G:n$kJ,;R5!3#(B, $B$8$C$-$g$&(B, No.25, $B

  2. $BGkC+>;8J(B: $B0B?4!&0BA4$J$BM}Bg(B $B2J3X%U%)!<%i%`(B, $BEl5~M}2JBg3X(B $B2J3X65M\;o(B, No4, 2009, pp.28-32.

  3. $BGkC+>;8J(B: $B>pJs2J3X$HO@M}(B,$B?tM}2J3X(B, Vol.46, No.11, 2008, pp.43-48.

  4. $BGkC+>;8J(B: $B%U%)!<%^%k%a%=%C%I$K$h$k0E9f0BA4@-(B, $B>pJs=hM}(B, Vol.49, No.5, 2008, pp.537-543.

  5. $BGkC+>;8J(B: $B@8L?E*%3%s%T%e!<%F%#%s%0(B, $B?M9)CNG=3X2q;o(B, Vol.23, No.3, 2008, pp.404-414.

  6. $BGkC+>;8J(B: DNA$B:?$K4p$E$/%J%N%7%9%F%`(B, $B9bJ,;R(B, Vol.56, No.6, 2007, p.440.

  7. $BGkC+>;8J(B: $B?tM}E*5;K!$K$h$k%;%-%e%j%F%#%W%m%H%3%k$N8!>Z(B, $BF|K\1~MQ?tM}3X2q(B2006$BG/EYG/2q9V1iM=9F=8(B, 2006, pp.8-11.

  8. $BGkC+>;8J(B: $BBg3XF~;n$K$*$1$k!V>pJs!W2JL\$NF3F~$X8~$1$F(B, $B$8$C$-$g$&(B, No.17, $B
  9. $BGkC+>;8J(B: $BJ,;R%3%s%T%e!<%F%#%s%0$NH/E8(B --- $BJ,;R%^%7%s$+$iJ,;R%3%_%e%K%1!<%7%g%s$X(B ---, $BEE;R>pJsDL?.3X2q;o(B, Vol.89, No.6, 2006, pp.500-505.

  10. $BGkC+>;8J(B: $BFs$B%7%_%e%l!<%7%g%s(B, Vol.24, No.4, 2005, pp.21-24.

  11. $BGkC+>;8J(B: $BJ,;R%W%m%0%i%_%s%0(B, $B1~MQJ*M}(B, Vol.74, No.7, 2005, pp.930-934.

  12. $BGkC+>;8J(B: $B%=%U%H%&%'%"!&%;%-%e%j%F%#$K$*$1$kM}O@8&5f$NLr3d(B, $B2J3X(B, Vol.74, No.2, $B4dGH=qE9(B, 2004, pp.185-190.

  13. $BGkC+>;8J(B: $B%5%$%(%s%9$X$N>7BT(B: $BJ,;R%3%s%T%e!<%F%#%s%0$N$3$H(B, $BEl5~Bg3X9-Js;o!VC8@D!W(B, Vol.6, February, 2002, p.24.

  14. $BGkC+>;8J(B: $B:G6a$NJ,;R%3%s%T%e!<%F%#%s%0(B, Computer Today, No.109, 2002, pp.4-10.

  15. $BGkC+>;8J(B, $BM-ED@55,(B: $BJ,;R7W;;$H$=$NJ*M}3XE*4pAC(B, $BF|K\J*M}3X2q;o(B, Vol.56, No.6, 2001, pp.403-410.

  16. $BGkC+>;8J(B: $BFC=8(B $BL$MhM=A[(B --- 2050$BG/$"$k$b$N$J$$$b$N(B, $B%3%s%T%e!<%?%5%$%(%s%9(B, bit, Vol.33, No.11, 2001, pp.18-21.

  17. $BGkC+>;8J(B: $BJ,;R7W;;$+$iJ,;R%W%m%0%i%_%s%0$X(B, $B7WB,$H@)8f(B, Vol.40, No.1, 2001, pp.100-105.

  18. $BGkC+>;8J(B, $BJF:jD>Z5;=Q$NL$Mh(B, bit, Vol.32, No.12, 2000, pp.3-8.

  19. $BGkC+>;8J(B, $B@>@nL@CK(B: DNA$B7W;;(B, $B0dEAE*%"%k%4%j%:%`#4(B, $BBh#1>O(B, $B;:6H?^=q(B, 2000, pp.3-48

  20. $BGkC+>;8J(B, $B@>@nL@CK(B: DNA$B7W;;$H$O2?$+(B, $BEE;R>pJsDL?.3X2q;o(B, Vol.83, No.10, 2000, pp.756-762.

  21. $B@>@nL@CK(B, $BGkC+>;8J(B: DNA$B7W;;$N$?$a$N%7%_%e%l!<%7%g%s$N;n$_(B, $B?tM}2J3X(B, No.445, 2000$BG/(B7$B7n9f(B, pp.15-26.

  22. $BGkC+>;8J(B: DNA$B7W;;$N?74p<4(B, $B?M9)CNG=3X2q;o(B, Vol.15, No.1, 2000, pp.43-50.

  23. $BGkC+>;8J!&@>@nL@CK(B: $BJ,;R7W;;$+$i8+$?JB9T7W;;(B -- Making Chemical Abstract Machines More Chemical --, $BF|K\%U%!%8%#3X2q;o(B, Vol.11, No.1, 1999, pp.2-13.

  24. $BGkC+>;8J(B: $B7W;;%7%9%F%`$N8!>Z$H9g@.(B, $B3X=Q7nJs(B, Vol.51, No.10, 1998, pp.10-14.

  25. $BGkC+>;8J(B: $B@8J*$N7O$N%b%G%k2=$H%7%_%e%l!<%7%g%s(B: $B$=$N0U5A$H8&5fJ}8~(B, $BFC=8(B:$B!V%2%N%`>pJs!W(B,$B>pJs=hM}(B, Vol.37, No.10, October 1996, pp.941-945.

  26. $BGkC+>;8J(B: $B7A<0E*?t3X$N$?$a$N7W;;5!4D6-(B, $BF|K\?t3X2qG/2q(B, $BFCJL9V1i(B, 1996.

  27. $BGkC+>;8J(B: $B>ZL@%A%'%C%+$H$=$N%f!<%6!&%$%s%?!<%U%'!<%9(B, $B?M9)CNG=3X2q;o(B, Vol.10, No.1, January 1995, pp.52-60.

  28. $BGkC+>;8J(B, $BN- $B?^7A$rMQ$$$??dO@$N4pAC$E$1(B, $B?M9)CNG=3X2q;o(B, Vol.9, No.2, March 1994, pp.190-195.

  29. $BGkC+>;8J(B: $B;k3PE*%W%m%0%i%_%s%0$H<+F0%W%m%0%i%_%s%0(B, $B%3%s%T%e!<%?%=%U%H%&%'%"(B, Vol.8, No.2, 1991, pp.27-39.

  30. $BGkC+>;8J(B: $B%0%i%U%#%+%k$J%f!<%6!&%$%s%?%U%'!<%9$H$=$N3+H/4D6-$K$D$$$F(B, bit, Vol.21, No.5, 1989, pp.51-62.

  31. $BGkC+>;8J(B, $B?9Eg98G/(B: $B%o!<%/%9%F!<%7%g%s>e$N%&%#%s%I%&!&%7%9%F%`$K$D$$$F(B, $B%3%s%T%e!<%?%=%U%H%&%'%"(B, Vol.5, No.2, 1988, pp.2-24.

  32. $BGkC+>;8J(B: GMW$B%&%#%s%I%&!&%7%9%F%`$K$D$$$F(B, bit, Vol.19, No.3, 1987, pp.4-19.

  33. $BEr@uB@0l(B, $BGkC+>;8J(B: KCl(Kyoto Common Lisp), $B%3%s%T%e!<%?%=%U%H%&%'%"(B, Vol.1, No.2, 1984, pp.69-72.

  34. $BGkC+>;8J(B: Prolog$B$N4pAC(B, $B>pJs=hM}(B, Vol.25, No.12, 1984, pp.1336-1344.

  35. $BGkC+>;8J(B: $B$h$$;R$N$O$$$Q!<$j$9$W(B, bit, Vol.14, No.3, 1982, pp.28-37.

Books (including Books Edited)

  1. $BGkC+>;8J(B, $B;3K\8w@2(B: $B2=3X7O$H@8J*7O$N7W;;%b%G%k(B, $B%"%k%4%j%:%`!&%5%$%(%s%9(B $B%7%j!<%:-0(B, $B6&N)=PHG(B, 2009.

  2. $B@n9g7E(B, $BGkC+>;8J(B: $B4pAC>pJs2J3X(B, $BJ|AwBg3XBg3X1!J82=2J3X8&5f2J(B, $BF|K\J|Aw=PHG6(2q(B, 2009.

  3. $BGkC+>;8J(B, $B@>@nL@CK(B: DNA$B%m%\%C%H(B--$B@8L?$N$7$+$1$GAO$kJ,;R5!3#(B, $B4dGH2J3X%i%$%V%i%j!<(B153, $B4dGH=qE9(B, 2008.
    $BD{@5(B: p.20$B$N?^(B10$B$NMf@{9=B$$K$*$$$F!"(B3'$B$H(B5'$B$,$9$Y$F5U$G$9!#(B $B?=$7Lu$"$j$^$;$s!#(Bm(_ _)m

  4. $BGkC+>;8J4F=$(B, $B5H2,?.OB(B, $B@DLZMx98(B, $BED869/G7Cx(B: SPIN$B$K$h$k@_7W%b%G%k8!>Z(B, $B6aBe2J3X
  5. $BGkC+>;8J(B, $B@>:j??Li(B: $BO@M}$H7W;;$N$7$/$_(B, $B4dGH=qE9(B, 2007. $BD{@5$HJdB-(B (2008$BG/EYBg@n=PHG>^^(B)

  6. $B4dGH=qE9JT=8ItJT(B: $B>pJs2J3X$X$NF;!">pJs2J3X$N9T$/F;(B, $B%V%C%/%,%$%I(B $BJ88K$GFI$`2J3X(B, $B4dGH2J3X%i%$%V%i%j!<(B132, 2007, pp.105-114.

  7. $BGkC+>;8JJTCx(B: $BJ,;R%3%s%T%e!<%?$N8=>u$HE8K>(B -- $BJ,;R%W%m%0%i%_%s%0$X$NE83+(B, $BNW;~JL:}!&?tM}2J3X(B, SGC$B%i%$%V%i%j(B31, $B%5%$%(%s%9

  8. $BGkC+>;8J(B, $B2#?95.(B($B6&JT(B): DNA$B%3%s%T%e!<%?(B, $BG]Iw4[(B, 2001.

  9. $BGkC+>;8J(B: $B4X?t%W%m%0%i%_%s%0(B, $BF|K\I>O@
  10. $BGkC+>;8J(B: $B%=%U%H%&%'%"2J3X$N$?$a$NO@M}3X(B, $B4dGH9V:B!V%=%U%H%&%'%"2J3X!W(B, $BBh(B11$B4,(B, 1994.

  11. $BGkC+>;8J(B: $BO@M}$H7W;;(B, $B4dGH9V:B!V1~MQ?t3X!W(B, $B4pAC(B11, 1993.

  12. $BEr@uB@0l(B, $BGkC+>;8J(B: Common Lisp$BF~Lg(B, $B4dGH=qE9(B, 1986. $B1Q8lLu(B --- Introduction to Common Lisp, Academic Press, Inc., 1987.

  13. $BEr@uB@0l(B, $BGkC+>;8J(B: Kyoto Common Lisp Report, $BDk9q0u:~(B, 1985.

  14. $BGkC+>;8J(B: $B%=%U%H%&%'%"9M8=3X(B, CQ$B=PHG(B, 1985.

Lecture Notes (Informally Distributed)

  1. $B%U%)!<%^%k%a%=%C%I$K$h$k0E9f%W%m%H%3%k$N8!>Z(B $BEl5~Bg3XM}3XIt>pJs2J3X2J(B4$BG/!V7W;;5!8@8lO@!W(B, 2009$BG/2F3X4|(B, $BEl5~Bg3XBg3X1!>pJsM}9)3X7O8&5f2J!V7W;;%7%9%F%`8!>ZO@!W(B, 2008$BG/E_3X4|(B.

  2. JavaPathFinder$B$K$h$k%b%G%k8!::(B $BEl5~Bg3XM}3XIt>pJs2J3X2J(B4$BG/!V7W;;5!8@8lO@!W(B, 2009$BG/2F3X4|(B, 2008$BG/2F3X4|(B, 2007$BG/2F3X4|(B, $BEl5~Bg3XBg3X1!>pJsM}9)3X7O8&5f2J!V7W;;%7%9%F%`8!>ZO@!W(B, 2007$BG/E_3X4|(B.

  3. $B>pJsO@M}(B $BEl5~Bg3XM}3XIt>pJs2J3X2J(B3$BG/!V>pJsO@M}!W(B, 2009$BG/2F3X4|(B, 2008$BG/2F3X4|(B, 2007$BG/2F3X4|(B. 2006$BG/2F3X4|(B, 2005$BG/2F3X4|(B, 2004$BG/2F3X4|(B.

  4. $B>pJs2J3X(B, $BEl5~Bg3X65M\3XIt!V>pJs2J3X!W(B 2008$BG/E_3X4|(B, 2007$BG/E_3X4|(B, 2006$BG/E_3X4|(B, $BEl5~Bg3X65M\3XItAm9g2JL\!V7W;;5!%W%m%0%i%_%s%0(BI$B!W(B, 2004$BG/2F3X4|(B.

  5. $B7A<0E*8!>Z5;=Q(B: Logical Framework $B$H(B Modal Logic, $BBh(B5$B2s!VBe?t3X$H7W;;!W8&5f=82q(B(AC2003), $BEl5~ETN)Bg3X(B, 2003.

  6. $B@~7A;~4V;~AjO@M}%b%G%k8!::(B90$BJ,AaJ,$+$j(B, $BBh0l2s%W%m%0%i%_%s%0$*$h$S%W%m%0%i%_%s%08@8l%5%^!<%9%/!<%k(B, $BF|K\%=%U%H%&%'%"2J3X2q!&%W%m%0%i%_%s%0O@8&5f2q(B, 2003.

  7. $B7W;;%7%9%F%`$N8!>Z(B $BEl5~Bg3XM}3XIt>pJs2J3X2J(B4$BG/!V7W;;5!8@8lO@!W(B, 2003$BG/2F3X4|(B, 2002$BG/2F3X4|(B, 2001$BG/2F3X4|(B, 2000$BG/2F3X4|(B, 1999$BG/2F3X4|(B. $BC^GHBg3XBh;03X72>pJs3XN`!V>pJs2J3XFCJL9V5A(BID$B!W=8Cf9V5A(B, 1999$BG/(B2$B7n(B20$BF|(B, 3$B7n(B6$BF|(B.

  8. $B@8J*>pJs2J3X(B $BEl5~Bg3XM}3XIt@8J*>pJs2J3X3XIt650iFCJL%W%m%0%i%`!V@8J*>pJs2J3X35O@!W(B, 2005$BG/2F3X4|(B, 2004$BG/2F3X4|(B, 2003$BG/2F3X4|(B, 2002$BG/2F3X4|(B.

  9. $BJ,;R%3%s%T%e!<%F%#%s%0(B $BEl5~Bg3XM}3XIt>pJs2J3X2J(B4$BG/!V7W;;%b%G%kO@!W(B, 2005$BG/2F3X4|(B, 2004$BG/2F3X4|(B. $BEl5~Bg3XM}3XIt>pJs2J3X2J(B4$BG/!V>pJs2J3XFCJL9V5A(BI$B!W(B, 2003$BG/2F3X4|(B. $BEl5~Bg3XM}3XIt>pJs2J3X2J(B4$BG/!V@8L?>pJsO@!W(B, 2002$BG/2F3X4|(B.

  10. $B>uBVC5:w$K$h$k8!>Z$*$h$S%O%$%V%j%C%I!&%7%9%F%`(B $BEl5~Bg3XBg3X1!>pJsM}9)3X7O8&5f2J!V7W;;%7%9%F%`8!>ZO@!W(B, 2002$BG/E_3X4|(B, 2001$BG/E_3X4|(B.

  11. Java$B$H%5!<%A(B $BEl5~Bg3X65M\3XItAm9g2JL\!V7W;;$HCNG=$N2J3X!W(B, 2000$BG/2F3X4|(B, 1999$BG/2F3X4|(B.

  12. $B:F5"E*4X?t$H%j%9%H=hM}(B, $BEl5~Bg3X65M\3XItAm9g2JL\!V7W;;$HCNG=$N2J3X!W(B, 1997$BG/2F3X4|(B, 1996$BG/2F3X4|(B.

  13. $B5"G $BEl5~Bg3XM}3XIt>pJs2J3X2J(B4$BG/!V7W;;5!8@8lO@!W(B, 1998$BG/2F3X4|(B, 1997$BG/2F3X4|(B, 1996$BG/2F3X4|(B. $BC^GHBg3XBh;03X72>pJs3XN`!V?M9)CNG=(BI$B!W=8Cf9V5A(B, 1995$BG/(B11$B7n(B. $B7D1~Bg3X!V7W;;5!2J3XFCO@!W(B, 1995$BG/(B11$B7n(B. $BIUO?(B: $B;3K\8w@2;a$K$h$k(BHOL$B$rMQ$$$?8!>Z(B$B$H(B $B$=$N2r@b(B.

  14. $B%3%s%Q%$%i(B $BEl5~Bg3XM}3XIt>pJs2J3X2J(B3$BG/!V8@8l=hM}7OO@!W(B, 2003$BG/2F3X4|(B, 2002$BG/2F3X4|(B, 2001$BG/2F3X4|(B, 2000$BG/2F3X4|(B, 1999$BG/2F3X4|(B, 1998$BG/2F3X4|(B, 1997$BG/2F3X4|(B, 1996$BG/2F3X4|(B. $BEl5~Bg3XM}3XIt>pJs2J3X2J(B3$BG/!V%3%s%Q%$%i9=@.O@!W(B, 1995$BG/E_3X4|(B, 1994$BG/E_3X4|(B.

  15. $B>pJs=hM}(B, $BEl5~Bg3X65M\3XItM}2J(B1$BN`(B1$BG/!V>pJs=hM}!W(B, 1996$BG/2F3X4|(B, 1995$BG/2F3X4|(B, 1994$BG/2F3X4|(B.

  16. $B5"G $BEl5~Bg3XM}3XIt>pJs2J3X2J(B4$BG/!V7W;;5!8@8lO@!W(B, 1995$BG/2F3X4|(B.

  17. $B!V9=@.E*%W%m%0%i%_%s%0$H7?IU$-&K7W;;!WF~Lg(B, $BEl5~Bg3XM}3XIt>pJs2J3X2J(B4$BG/!V7W;;5!8@8lO@!W(B, 1995$BG/2F3X4|(B. $BC^GHBg3XBh;03X72>pJs3XN`!V?M9)CNG=(BI$B!W=8Cf9V5A(B, 1994$BG/(B11$B7n(B. $BEl5~Bg3XM}3XIt>pJs2J3X2J(B4$BG/!V7W;;5!8@8lO@!W(B, 1994$BG/2F3X4|(B.

Essays