Masahito Kurihara

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Azuma Ohuchi

> Home > Persons > Masahito Kurihara

Publications

1996
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/scjapan/KondoKO96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scjapan/KondoKO96
Hisashi Kondo, Masahito Kurihara, Azuma Ohuchi:
Completion of term-rewriting systems with multiple reduction orderings. Syst. Comput. Jpn. 27(6): 33-44 (1996)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/disco/NumazawaKO96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/disco/NumazawaKO96
Masanobu Numazawa, Masahito Kurihara, Azuma Ohuchi:
A Reflective Language Based on Conditional Term Rewriting. DISCO 1996: 65-66
1995
[j9]
- view
  - electronic edition @ ieice.org
  - no references & citations available
- export record
  dblp key:
  - journals/ieicet/KuriharaO95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/KuriharaO95
Masahito Kurihara, Azuma Ohuchi:
Decomposable Termination of Composable Term Rewriting Systems. IEICE Trans. Inf. Syst. 78-D(4): 314-320 (1995)
[j8]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/KuriharaO95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KuriharaO95
Masahito Kurihara, Azuma Ohuchi:
Modularity in Noncopying Term Rewriting. Theor. Comput. Sci. 152(1): 139-169 (1995)
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/rta/KuriharaKO95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rta/KuriharaKO95
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi:
Completion for Multiple Reduction Orderings. RTA 1995: 71-85
1992
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/ijseke/KuriharaKO92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijseke/KuriharaKO92
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi:
Using ATMS to Efficiently Verify the Termination of Rewrite Rule Programs. Int. J. Softw. Eng. Knowl. Eng. 2(4): 547-565 (1992)
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/KuriharaO92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KuriharaO92
Masahito Kurihara, Azuma Ohuchi:
Modularity of Simple Termination of Term Rewriting Systems with Shared Constructors. Theor. Comput. Sci. 103(2): 273-282 (1992)
1991
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/compsac/KuriharaO91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compsac/KuriharaO91
Masahito Kurihara, Azuma Ohuchi:
An algebraic specification of a reflective language. COMPSAC 1991: 231-236
1986
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/tsmc/OhuchiKK86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsmc/OhuchiKK86
Azuma Ohuchi, Masahito Kurihara, Ikuo Kaji:
Implication Theory and Algorithm for Reachability Matrix Model. IEEE Trans. Syst. Man Cybern. 16(4): 610-616 (1986)
1985
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/tsmc/OhuchiKK85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsmc/OhuchiKK85
Azuma Ohuchi, Masahito Kurihara, Ikuo Kaji:
An efficient procedure for transitive coupling in ISM. IEEE Trans. Syst. Man Cybern. 15(3): 426-431 (1985)
1984
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tsmc/OuchiKK84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsmc/OuchiKK84
Azuma Ohuchi, Masahito Kurihara, Ikuo Kaji:
A theorem and a procedure for the complete implication matrix of system interconnection matrices. IEEE Trans. Syst. Man Cybern. 14(3): 545-550 (1984)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.