A Concurrent System of Multi-ported Processes with Causal Dependency. - Tatsuya Abe 001 (APLAS, 2004)

Completeness of Modal Proofs in First-Order Predicate Logic. - Tatsuya Abe 001 (Inf. Media Technol., 2008)

On-the-Fly Synchronization Checking for Interactive Programming in XcalableMP. - Tatsuya Abe 001; Mitsuhisa Sato (ICPP Workshops, 2012)

Auto-tuning of Numerical Programs by Block Multi-color Ordering Code Generation and Job-Level Parallel Execution. - Tatsuya Abe 001; Mitsuhisa Sato (VECPAR, 2012)

Model Checking Stencil Computations Written in a Partitioned Global Address Space Language. - Tatsuya Abe 001; Toshiyuki Maeda; Mitsuhisa Sato (IPDPS Workshops, 2013)

Optimization of a General Model Checking Framework for Various Memory Consistency Models. - Tatsuya Abe 001; Toshiyuki Maeda (PGAS, 2014)

Observation-Based Concurrent Program Logic for Relaxed Memory Consistency Models. - Tatsuya Abe 001; Toshiyuki Maeda (APLAS, 2016)

Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models. - Tatsuya Abe 001; Tomoharu Ugawa; Toshiyuki Maeda; Kousuke Matsumoto (SETTA, 2016)

A Verifier of Directed Acyclic Graphs for Model Checking with Memory Consistency Models. - Tatsuya Abe 001 (Haifa Verification Conference, 2017)

Reordering Control Approaches to State Explosion in Model Checking with Memory Consistency Models. - Tatsuya Abe 001; Tomoharu Ugawa; Toshiyuki Maeda (VSTTE, 2017)

Concurrent Program Logic for Relaxed Memory Consistency Models with Dependencies across Loop Iterations. - Tatsuya Abe 001; Toshiyuki Maeda (J. Inf. Process., 2017)

Model checking copy phases of concurrent copying garbage collection with various memory models. - Tomoharu Ugawa; Tatsuya Abe 001; Toshiyuki Maeda (Proc. ACM Program. Lang., 2017)

A general model checking framework for various memory consistency models. - Tatsuya Abe 001; Toshiyuki Maeda (Int. J. Softw. Tools Technol. Transf., 2017)

Local Data Race Freedom with Non-multi-copy Atomicity. - Tatsuya Abe 001 (SPIN, 2018)

Improvement of a Library for Model Checking under Weakly Ordered Memory Model with SPIN. - Kosuke Matsumoto; Tomoharu Ugawa; Tatsuya Abe 001 (J. Inf. Process., 2018)

A type system for data independence of loop iterations in a directive-based PGAS language. - Tatsuya Abe 001 (MPLR, 2019)

Polymorphic computation systems: Theory and practice of confluence with call-by-value. - Makoto Hamana; Tatsuya Abe 001; Kentaro Kikuchi (Sci. Comput. Program., 2020)

A Symmetric Lambda-Calculus Corresponding to the Negation-Free Bilateral Natural Deduction. - Tatsuya Abe 001; Daisuke Kimura (CoRR, 2021)

An Extensionally Equivalence-ensured Language for Task Parallel Processing with Backtracking-based Load Balancing. - Tatsuya Abe 001; Tasuku Hiraishi (J. Inf. Process., 2021)

Extending a Call-by-Value Calculus Based on Bilateralism with Dynamic Binding. - Tatsuya Abe 001; Daisuke Kimura (FLAP, 2023)

A typed lambda-calculus with first-class configurations. - Tatsuya Abe 001; Daisuke Kimura (J. Log. Comput., 2023)

Owicki-Gries Logic for Timestamp Semantics. - Tatsuya Abe 001 (CoRR, 2025)