dblp.uni-trier.dewww.uni-trier.de

Mitsuhiro Okada Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
45EEKoji Mineshima, Mitsuhiro Okada, Yuri Sato, Ryo Takemura: Diagrammatic Reasoning System with Euler Circles: Theory and Experiment Design. Diagrams 2008: 188-205
2007
44EEGergei Bana, Koji Hasebe, Mitsuhiro Okada: Computational Semantics for Basic Protocol Logic - A Stochastic Approach. ASIAN 2007: 86-94
43EEMitsuhiro Okada, Ryo Takemura: Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic lambda -Calculus. Rewriting, Computation and Proof 2007: 167-181
2006
42EEMitsuhiro Okada, Yutaro Sugimoto, Sumi Yoshikawa, Akihiko Konagaya: Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences. Essays Dedicated to Joseph A. Goguen 2006: 616-642
41EEFrédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada: The Calculus of Algebraic Constructions CoRR abs/cs/0610063: (2006)
40EEFrédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada: Inductive-data-type Systems CoRR abs/cs/0610066: (2006)
39EEKoji Hasebe, Mitsuhiro Okada: Completeness and Counter-Example Generations of a Basic Protocol Logic: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 147(1): 73-92 (2006)
38EEMax I. Kanovich, Mitsuhiro Okada, Kazushige Terui: Intuitionistic phase semantics is almost classical. Mathematical Structures in Computer Science 16(1): 67-86 (2006)
2003
37 Mitsuhiro Okada, Benjamin C. Pierce, Andre Scedrov, Hideyuki Tokuda, Akinori Yonezawa: Software Security -- Theories and Systems, Mext-NSF-JSPS International Symposium, ISSS 2002, Tokyo, Japan, November 8-10, 2002, Revised Papers Springer 2003
36EEKoji Hasebe, Mitsuhiro Okada: Inferences on Honesty in Compositional Logic for Protocol Analysis. ISSS 2003: 65-86
35 Jean-Yves Girard, Mitsuhiro Okada, Andre Scedrov: Preface. Theor. Comput. Sci. 294(3): 333 (2003)
34 Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Phase semantics for light linear logic. Theor. Comput. Sci. 294(3): 525-549 (2003)
33 Misao Nagayama, Mitsuhiro Okada: A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic. Theor. Comput. Sci. 294(3): 551-573 (2003)
2002
32EEKoji Hasebe, Mitsuhiro Okada: A Logical Verification Method for Security Protocols Based on Linear Logic and BAN Logic. ISSS 2002: 417-440
31EEKoji Hasebe, Mitsuhiro Okada: Formal Analysis of the iKP Electronic Payment Protocols. ISSS 2002: 441-460
30EEMitsuhiro Okada: Ideal Concepts, Intuitions, and Mathematical Knowledge Acquisitions in Husserl and Hilbert. Progress in Discovery Science 2002: 40-77
29EEMariangiola Dezani-Ciancaglini, Mitsuhiro Okada, Masako Takahashi: Theories of Types and Proofs 1997 - Preface. Theor. Comput. Sci. 272(1-2): 1-2 (2002)
28EEFrédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada: Inductive-data-type systems. Theor. Comput. Sci. 272(1-2): 41-68 (2002)
27EEMitsuhiro Okada: A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theor. Comput. Sci. 281(1-2): 471-498 (2002)
2001
26 Misao Nagayama, Mitsuhiro Okada: A New Correctness Criterion for The Proof Nets of Non-Commutative Multiplicative Linear Logics. J. Symb. Log. 66(4): 1524-1542 (2001)
1999
25EEFrédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada: The Calculus of algebraic Constructions. RTA 1999: 301-316
24 Mitsuhiro Okada, Kazushige Terui: The Finite Model Property for Various Fragments of Intuitionistic Linear Logic. J. Symb. Log. 64(2): 790-802 (1999)
23EEMitsuhiro Okada: Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic. Theor. Comput. Sci. 227(1-2): 333-396 (1999)
1998
22EEMasahiro Hamano, Mitsuhiro Okada: A direct independence proof of Buchholz's Hydra Game on finite labeled trees. Arch. Math. Log. 37(2): 67-89 (1998)
21EEMax I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Specifying Real-Time Finite-State Systems in Linear Logic. Electr. Notes Theor. Comput. Sci. 16(1): (1998)
1997
20EEMax I. Kanovich, Mitsuhiro Okada, Andre Scedrov: Phase semantics for light linear logic. Electr. Notes Theor. Comput. Sci. 6: (1997)
19 Masahiro Hamano, Mitsuhiro Okada: A Relationship Among Gentzen's Proof-Reduction, Kirby-Paris' Hydra Game and Buchholz's Hydra Game. Math. Log. Q. 43: 103-120 (1997)
18EEJean-Pierre Jouannaud, Mitsuhiro Okada: Abstract Data Type Systems. Theor. Comput. Sci. 173(2): 349-391 (1997)
1996
17EEMisao Nagayama, Mitsuhiro Okada: A Graph-Theoretic Characterization Theorem for Multiplicative Fragment of Non-Commutative Linear Logic. Electr. Notes Theor. Comput. Sci. 3: (1996)
16EEMitsuhiro Okada: Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs. Electr. Notes Theor. Comput. Sci. 3: (1996)
15EEJean-Yves Girard, Mitsuhiro Okada, Andre Scedrov: Preface. Electr. Notes Theor. Comput. Sci. 3: (1996)
1993
14EEYexuan Gui, Mitsuhiro Okada: System Description of LAMBDALG - A Higher Order Algebraic Specification Language. LPAR 1993: 354-356
13EEYexuan Gui, Mitsuhiro Okada: LAMBDALG: Higher Order Algebraic Specification Language. RTA 1993: 462-466
1991
12 Stéphane Kaplan, Mitsuhiro Okada: Conditional and Typed Rewriting Systems, 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990, Proceedings Springer 1991
11EEJean-Pierre Jouannaud, Mitsuhiro Okada: Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable. ICALP 1991: 455-468
10 Jean-Pierre Jouannaud, Mitsuhiro Okada: A Computation Model for Executable Higher-Order Algebraic Specification Languages LICS 1991: 350-361
1990
9 Nachum Dershowitz, Mitsuhiro Okada: A Rationale for Conditional Equational Programming. Theor. Comput. Sci. 75(1&2): 111-138 (1990)
1989
8EEMitsuhiro Okada: Strong Normalizability for the Combined System of the Typed lambda Calculus and an Arbitrary Convergent Term Rewrite System. ISSAC 1989: 357-363
1988
7EENachum Dershowitz, Mitsuhiro Okada, G. Sivakumar: Canonical Conditional Rewrite Systems. CADE 1988: 538-549
6 Nachum Dershowitz, Mitsuhiro Okada: Conditional Equational Programming and the Theory of Conditional Term Rewriting. FGCS 1988: 337-346
5 Nachum Dershowitz, Mitsuhiro Okada: Proof-Theoretic Techniques for Term Rewriting Theory LICS 1988: 104-111
4 Mitsuhiro Okada: On a Theory of Weak Implications. J. Symb. Log. 53(1): 200-211 (1988)
1987
3 Mitsuhiro Okada: A Logical Analysis on Theory of Conditional Rewriting. CTRS 1987: 179-196
2 Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar: Confluence of Conditional Rewrite Systems. CTRS 1987: 31-44
1 Mitsuhiro Okada: A Simple Relationship between Buchholz's New System of Ordinal Notations and Takeuti's System of Ordinal Diagrams. J. Symb. Log. 52(3): 577-581 (1987)

Coauthor Index

1Gergei Bana [44]
2Frédéric Blanqui [25] [28] [40] [41]
3Nachum Dershowitz [2] [5] [6] [7] [9]
4Mariangiola Dezani-Ciancaglini [29]
5Jean-Yves Girard [15] [35]
6Yexuan Gui [13] [14]
7Masahiro Hamano [19] [22]
8Koji Hasebe [31] [32] [36] [39] [44]
9Jean-Pierre Jouannaud [10] [11] [18] [25] [28] [40] [41]
10Max I. Kanovich [20] [21] [34] [38]
11Stéphane Kaplan [12]
12Akihiko Konagaya [42]
13Koji Mineshima [45]
14Misao Nagayama [17] [26] [33]
15Benjamin C. Pierce [37]
16Yuri Sato [45]
17Andre Scedrov [15] [20] [21] [34] [35] [37]
18G. Sivakumar [2] [7]
19Yutaro Sugimoto [42]
20Masako Takahashi [29]
21Ryo Takemura [43] [45]
22Kazushige Terui [24] [38]
23Hideyuki Tokuda [37]
24Akinori Yonezawa [37]
25Sumi Yoshikawa [42]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)