| 2009 |
|---|
| 26 | EE | Nguyen Van Tang,
Mizuhito Ogawa:
Event-Clock Visibly Pushdown Automata.
SOFSEM 2009: 558-569 |
| 2008 |
|---|
| 25 | EE | Xin Li,
Daryl Shannon,
Indradeep Ghosh,
Mizuhito Ogawa,
Sreeranga P. Rajan,
Sarfraz Khurshid:
Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution.
APLAS 2008: 36-52 |
| 24 | EE | Guoqiang Li,
Mizuhito Ogawa:
Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol.
ATVA 2008: 374-385 |
| 2007 |
|---|
| 23 | EE | Guoqiang Li,
Mizuhito Ogawa:
On-the-Fly Model Checking of Fair Non-repudiation Protocols.
ATVA 2007: 511-522 |
| 2006 |
|---|
| 22 | EE | Nguyen Van Tang,
Dang Van Hung,
Mizuhito Ogawa:
Modeling Urgency in Component-Based Real-Time Systems.
ASIAN 2006: 248-255 |
| 2005 |
|---|
| 21 | EE | Mizuhito Ogawa,
Eiichi Horita,
Satoshi Ono:
Proving Properties of Incremental Merkle Trees.
CADE 2005: 424-440 |
| 20 | EE | Isao Sasano,
Mizuhito Ogawa,
Zhenjiang Hu:
Maximum Marking Problems with Accumulative Weight Functions.
ICTAC 2005: 562-578 |
| 2004 |
|---|
| 19 | EE | Mizuhito Ogawa:
Complete Axiomatization of an Algebraic Construction of Graphs.
FLOPS 2004: 163-179 |
| 18 | EE | Li Xin,
Mizuhito Ogawa:
A Lightweight Mutual Authentication Based on Proxy Certificate Trust List.
PDCAT 2004: 628-632 |
| 17 | EE | Mizuhito Ogawa:
Well-quasi-orders and regular omega-languages.
Theor. Comput. Sci. 324(1): 55-60 (2004) |
| 2003 |
|---|
| 16 | EE | Mizuhito Ogawa,
Zhenjiang Hu,
Isao Sasano:
Iterative-free program analysis.
ICFP 2003: 111-123 |
| 15 | EE | Mizuhito Ogawa:
Call-by-need reduction for membership conditional term rewriting Systems.
Electr. Notes Theor. Comput. Sci. 86(4): (2003) |
| 14 | EE | Mizuhito Ogawa:
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains.
Inf. Comput. 186(2): 236-259 (2003) |
| 2002 |
|---|
| 13 | | Mizuhito Ogawa,
Zhenjiang Hu,
Isao Sasano,
Masato Takeichi:
Algebraic construction of graphs with bounded tree width and its applications - Catamorphic Approach to Program Analyses.
APLAS 2002: 58-73 |
| 2001 |
|---|
| 12 | | Mizuhito Ogawa:
Abstract Interpretation over Infinite Abstract Domains (Tentative Report).
APLAS 2001: 183-191 |
| 11 | EE | Zurab Khasidashvili,
Mizuhito Ogawa,
Vincent van Oostrom:
Uniform Normalisation beyond Orthogonality.
RTA 2001: 122-136 |
| 10 | EE | Mizuhito Ogawa:
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders.
TACS 2001: 283-297 |
| 9 | | Zurab Khasidashvili,
Mizuhito Ogawa,
Vincent van Oostrom:
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems.
Inf. Comput. 164(1): 118-151 (2001) |
| 8 | EE | Ken Mano,
Mizuhito Ogawa:
Unique normal form property of compatible term rewriting systems: a new proof of Chew's theorem.
Theor. Comput. Sci. 258(1-2): 169-208 (2001) |
| 2000 |
|---|
| 7 | | Mizuhito Ogawa:
A Note on Algebraic Structure of Tree Decomposition of Graphs.
APLAS 2000: 223-229 |
| 6 | EE | Isao Sasano,
Zhenjiang Hu,
Masato Takeichi,
Mizuhito Ogawa:
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems.
ICFP 2000: 137-149 |
| 1999 |
|---|
| 5 | | Mizuhito Ogawa:
Automatic Verification Based on Abstract Interpretation.
Fuji International Symposium on Functional and Logic Programming 1999: 131-146 |
| 1997 |
|---|
| 4 | | Zurab Khasidashvili,
Mizuhito Ogawa:
Perpetuality and Uniform Normalization.
ALP/HOA 1997: 240-255 |
| 1996 |
|---|
| 3 | | Ken Mano,
Mizuhito Ogawa:
Unique Normal Form Property of Higher-Order Rewriting Systems.
ALP 1996: 269-283 |
| 1992 |
|---|
| 2 | | Mizuhito Ogawa:
Chew's Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems-.
ISAAC 1992: 309-318 |
| 1988 |
|---|
| 1 | | Mizuhito Ogawa,
Satoshi Ono:
Transformation of Strictness-Related Analyses Nased on Abstract Interpretation.
FGCS 1988: 430-438 |
