Munehiro Iwami

munehiro [at] cis [.] shimane-u [.] ac [.] jp

Research Interests

Term rewriting system, Functional and logic programming language, Automated deduction

Ph.D.Thesis

"Termination of higher-order rewrite systems," Japan Advanced Institute of Science and Technology (JAIST), 1999.

Refereed Papers

1. M. Iwami, M. Sakai and Y. Toyama,
   "An improved recursive decomposition ordering for higher-order rewrite systems,"
   IEICE Transactions on Information and Systems, Vol.E81-D, No.9, pp.988-996, 1998.
2. M. Iwami and Y. Toyama,
   "Simplification ordering for higher-order rewrite systems,"
   IPSJ Transactions on Programming, Vol.40, No.SIG 4 (PRO 3), pp.1-10, 1999.
3. M. Iwami,
   "Persistence of termination for non-overlapping term rewriting systems,"
   Proc. of 1st International Forum on Information and Computer Technology, Shizuoka University, Japan, pp.198-202, 2003.
4. M. Iwami,
   "Persistence of termination of term rewriting systems with ordered sorts,"
   Proc. of 5th JSSST Workshop on Programming and Programming Languages, Shizuoka, Japan, pp.47-56, 2003.
5. M. Iwami,
   "Persistence of termination for locally confluent overlay term rewriting systems,"
   Proc. of IASTED International Conference on Artificial Intelligence and Applications
   as part of the 22nd IASTED International Multi-Conference on APPLIED INFORMATICS,
   Innsbruck, Austria, ACTA Press, pp.529-534, 2004.
6. M. Iwami,
   "An improved recursive decomposition ordering for term rewriting systems revisited,"
   Advances in Logic Based Intelligent Systems, Frontiers in Artificial Intelligence and its Applications, vol. 132,
   (Proc. of 5th Congress on Logic Applied to Technology, University of Hyogo, Japan), IOS Press, pp.18-25, 2005.
7. M. Iwami,
   "Confluence of left-linear and K-development closed term rewriting systems,"
   IEICE Transactions on Information and Systems, Vol.J90-D, No.10, pp.2932-2935，2007, (in Japanese).
8. M. Iwami,
   "Acyclicity of combinator L,"
   Forum on Information Technology 2007 (FIT 2007), Information Technology Letters, Vol.6, pp.25-26, 2007, (in Japanese).
9. M. Iwami,
   "On the acyclic and related properties of combinators,"
   IPSJ Transactions on Programming, Vol.2, No. 2, pp.97-104, 2009, (in Japanese).
10. M. Iwami and T. Aoto,
    "A procedure for disproving strong head normalization of infinitary term rewriting systems,"
    Proc. of 12th JSSST Workshop on Programming and Programming Languages, Kagawa, Japan, pp.261-273, 2010 (in Japanese).
11. M. Iwami and T. Aoto,
    "Disproving strong head normalization and general productivity automatically in infinitary term rewriting systems,"
    Computer Software, Vol.29, No.1, pp.211-239, 2012 (in Japanese).

Unrefereed Papers

1. M. Iwami, M. Sakai and Y. Toyama,
   "Termination of higher-order rewrite systems,"
   Proc. the Joint Conf. of Hokuriku Chapters of Institutes of Electrical Engineers, Japan, E-28, pp.314, 1995 (in Japanese).
2. M. Iwami, M. Sakai and Y. Toyama,
   "On the termination of higher order rewrite systems,"
   Technical Report of IEICE, COMP95-85, pp.113-122, 1996 (in Japanese).
3. M. Iwami, M. Sakai and Y. Toyama,
   "Termination of higher-order rewrite systems,"
   Proc. LA Symp., Summer, pp.55-60, 1996 (in Japanese).
4. M. Iwami, M. Sakai and Y. Toyama,
   "An improved recursive decomposition ordering for higher-order rewrite systems,"
   Technical Report of IEICE, COMP96-73, pp.17-24, 1997.
5. M. Iwami and Y. Toyama,
   "On the persistency of termination of term rewriting systems with ordered sorts,''
   Proc. 14th Conf. on Japan Society for Software Science and Technology, pp.357-360, 1997 (in Japanese).
6. M. Iwami and Y. Toyama,
   ``Simplification ordering for higher-order rewrite systems,''
   Research Report, IS-RR-98-0024F, School of Information Science, JAIST, 1998.
7. M. Iwami and Y. Toyama,
   "Simplification ordering and higher-order recursive path ordering,"
   LA Symp., Summer, pp.11-1-11-6, 1999.
8. M. Iwami,
   "Persistence of termination for locally confluent overlay term rewriting systems,"
   LA Symp., Summer, pp.23-1-23-8, 2003.
9. M. Iwami,
   "Persistence of termination for non-overlapping term rewriting systems",
   RIMS, No. 1366, pp. 91-99, 2004.
10. M. Iwami,
    "Persistence of termination for overlay term rewriting systems",
    RIMS, No. 1375, pp. 240-246, 2004.
11. M. Iwami,
    "An improved recursive decomposition ordering for term rewriting systems revisited,"
    RIMS, No. 1426, pp.126--132, 2005.

Workshops, Meetings

36th TRS meeting, February 27-29, 2012, Shimane University
24th TRS meeting, April 2-4, 2004, Shimane University, Japan
CVS/AIST WORKSHOP SERIES ONE-DAY WORKSHOP ON VERIFICATION AND REWRITING 21 October, 2004, CVS/AIST, Japan
25th TRS meeting, November 26-27, 2004, Mie University, Japan

Conferences

RDP 2005
RTA 2005
TLCA 2005
DSN 2005
CCA 2005
IEEE Symposium on Logic in Computer Science (LICS)
FLOPS 2006
FLoC 2006
RTA 2006

Profile

B.S., Tokai University, 1994.
M.S., Japan Advanced Institute of Science and Technology (JAIST) , 1996.
Ph.D., Japan Advanced Institute of Science and Technology (JAIST) , 1999.
Research Associate, Shimane University, 1999-2007.
Assistant Professor, Shimane University, 2007-2008.
Associate Professor, Shimane University, 2008- .

Links

Researchers in Rewriting
Home Pages of Researchers in Computer Science
Rewriting Researchers Forum
Logic for Information Science (Toyama laboratory),
Research Institute of Electrical Communication, Tohoku University
Kurt Godel Society
ACIS
ACM
AISB
EATCS
IASTED
IEEE
IFIP
ISAI

Back