Tatsuya Abe, Ph.D.

Contact Information

Name in Japanese:
name
Office:
I moved to AICS, RIKEN, 650-0047, Japan.
E-mail:
email
Recent Photo (at SC12 in Salt Lake City):
picture

Referred Papers

  1. Tatsuya Abe, Toshiyuki Maeda, and Mitsuhisa Sato. Model checking stencil computations written in a partitioned global address space language. To appear.
  2. Tasuku Hiraishi, Masaru Ueno, Tatsuya Abe, Motoharu Hibino, Takeshi Iwashita, and Hiroshi Nakashima. Xcrypt on Lisp: a scripting system for job level parallel programming in Lisp. In Proceedings of International Lisp Conference (ILC), pages 107--114. Kyoto, October 2012.
  3. Tatsuya Abe, Toshiyuki Maeda, and Mitsuhisa Sato. Model checking with user-definable abstraction for partitioned global address space languages. In Proceedings of the 6th Conference on Partitioned Global Address Space Programming Models (PGAS), 10 pages. Santa Barbara, October 2012.
  4. Tatsuya Abe and Mitsuhisa Sato. On-the-fly synchronization checking for interactive programming in XcalableMP. In Proceedings of the 5th International Workshop on Parallel Programming Models and Systems Software for High-End Computing (P2S2), pages 29--37. Pittsburgh, September 2012.
  5. Tatsuya Abe and Mitsuhisa Sato. Auto-tuning of numerical programs by block multi-color ordering code generation and job-level parallel execution. In Proceedings of the 7th International Workshop on Automatic Performance Tuning (iWAPT), volume 7851 of Lecture Notes in Computer Science, pages 404--419. Springer, Kobe, July 2012.
  6. Tasuku Hiraishi, Tatsuya Abe, Takeshi Iwashita, and Hiroshi Nakashima. Xcrypt: a Perl extension for job level parallel programming. In Proceedings of the 2nd International Workshop on High-performance Infrastructure for Scalable Tools (WHIST), 9 pages. Venice, June 2012.
  7. Tatsuya Abe. Completeness of modal proofs in first-order predicate logic. JSSST Computer Software, 24(4):165--177, 2007.
  8. Tatsuya Abe. A concurrent system of multi-ported processes with causal dependency. In Proceedings of the 2nd Asian Symposium on Programming Languages and Systems (APLAS), volume 3302 of Lecture Notes in Computer Science, pages 146--162. Springer, Taipei, November 2004.

Preprints

  1. Kripke and Meta-Logical Completeness via Curry-Howard Isomorphism: provides an alternative proof of Kripke and meta-logical completeness of intuitionistic modal logic using Curry-Howard isomorphism.
  2. Split of Classical Logic: splits classical logic into intuitionistic and paraconsistent logics.

Softwares

  1. Xcrypt: a job-level parallel scripting language that helps automating Plan-Do-Check-Act (PDCA) cycles.
  2. Xtract: enables us to extract strings by designating columns, ranges, Perl's sentences and scripts.
  3. XMP-mode: Emacs major mode for editing XcalableMP programs.
  4. Patch: makes Promela-mode to highlight keywords without using an obsolete Emacs Lisp variable font-lock-defaults-alist.
  5. XMP shaker: generates a huge number of programs from a XcalableMP program by moving directives.
  6. Unblock: removes BLOCK constructs and duplicated declarations from a Fortran program.