| * | 2008 |
|---|
| 8 | | Osamu Takaki,
Takahiro Seino,
Izumi Takeuti,
Noriaki Izumi,
Koichi Takahashi:
Quality Improvement of Workflow Diagrams Based on Passback Flow Consistency.
ICEIS (3-2) 2008: 351-359 |
| 7 | EE | Osamu Takaki,
Izumi Takeuti,
Takahiro Seino,
Noriaki Izumi,
Koichi Takahashi:
Incremental Verification of Large ScaleWorkflows Based on Extended Correctness.
ICSEA 2008: 478-487 |
| 6 | EE | Osamu Takaki,
Takahiro Seino,
Izumi Takeuti,
Noriaki Izumi,
Koichi Takahashi:
Workflow Diagrams Based on Evidence Life Cycles.
JCKBSE 2008: 145-154 |
| 2007 |
|---|
| 5 | EE | Osamu Takaki,
Takahiro Seino,
Izumi Takeuti,
Noriaki Izumi,
Koichi Takahashi:
Verification Algorithm of Evidence Life Cycles in Extended UML Activity Diagrams.
ICSEA 2007: 9 |
| 2006 |
|---|
| 4 | EE | Hiroshi Watanabe,
Koki Nishizawa,
Osamu Takaki:
A Coalgebraic Representation of Reduction by Cone of Influence.
Electr. Notes Theor. Comput. Sci. 164(1): 177-194 (2006) |
| 2005 |
|---|
| 3 | EE | Osamu Takaki:
Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM.
Arch. Math. Log. 44(6): 689-709 (2005) |
| 2000 |
|---|
| 2 | EE | Osamu Takaki:
Finite presentability of strongly finite dilators.
ITA 34(6): 425-431 (2000) |
| 1997 |
|---|
| 1 | | Osamu Takaki:
Strong Normalization Theorem for a Constructive Arithmetic with Definition by Transfinite Recursion and Bar Induction.
Notre Dame Journal of Formal Logic 38(3): 350-373 (1997) |
