Algebraic specification and automatic generation of compilers. - Masahiko Sakai; Toshiki Sakabe; Yasuyoshi Inagaki (Syst. Comput. Jpn., 1992)

Error description on algebraic specification and its automatic addition. - Takeshi Hamaguchi; Shinichirou Yamamoto; Kiyoshi Agusa; Masahiko Sakai (Syst. Comput. Jpn., 1996)

Algebraic specification with provision for the automatic addition of error descriptions. - Takeshi Hamaguchi; Masahiko Sakai; Shinichirou Yamamoto; Kiyoshi Agusa (Syst. Comput. Jpn., 1997)

Semantics and Strong Sequentiality of Priority Term Rewriting Systems. - Masahiko Sakai; Yoshihito Toyama (Theor. Comput. Sci., 1998)

Descendants and Head Normalization of Higher-Order Rewrite Systems. - Hideto Kasuya; Masahiko Sakai; Kiyoshi Agusa (FLOPS, 2002)

Narrowing-based simulation of term rewriting systems with extra variables. - Naoki Nishida 001; Masahiko Sakai; Toshiki Sakabe (WFLP, 2003)

Partial Inversion of Constructor Term Rewriting Systems. - Naoki Nishida 001; Masahiko Sakai; Toshiki Sakabe (RTA, 2005)

Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting. - Keiichirou Kusakari; Masahiko Sakai; Toshiki Sakabe (IEICE Trans. Inf. Syst., 2005)

On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems. - Masahiko Sakai; Keiichirou Kusakari (IEICE Trans. Inf. Syst., 2005)

Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems. - Yi Wang; Masahiko Sakai (RTA, 2006)

Transformation for Refining Unraveled Conditional Term Rewriting Systems. - Naoki Nishida 001; Tomohiro Mizutani; Masahiko Sakai (WRS@FLoC, 2006)

Enhancing dependency pair method using strong computability in simply-typed term rewriting. - Keiichirou Kusakari; Masahiko Sakai (Appl. Algebra Eng. Commun. Comput., 2007)

Undecidable Properties on Length-Two String Rewriting Systems. - Masahiko Sakai; Yi Wang (WRS@RDP, 2007)

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems. - Keita Uchiyama; Masahiko Sakai; Toshiki Sakabe (WRS@RDP, 2007)

Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems. - Yoshiharu Kojima; Masahiko Sakai (RTA, 2008)

Completion after Program Inversion of Injective Functions. - Naoki Nishida 001; Masahiko Sakai (WRS@RTA, 2008)

Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems. - Keiichirou Kusakari; Yasuo Isogai; Masahiko Sakai; Frédéric Blanqui (IEICE Trans. Inf. Syst., 2009)

Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques. - Keiichirou Kusakari; Masahiko Sakai (IEICE Trans. Inf. Syst., 2009)

Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes. - Hideto Kasuya; Masahiko Sakai; Kiyoshi Agusa (Inf. Media Technol., 2009)

Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems. - Yoshiharu Kojima; Masahiko Sakai; Naoki Nishida 001; Keiichirou Kusakari; Toshiki Sakabe (Inf. Media Technol., 2009)

Proving Injectivity of Functions via Program Inversion in Term Rewriting. - Naoki Nishida 001; Masahiko Sakai (FLOPS, 2010)

Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs. - Keita Uchiyama; Masahiko Sakai; Toshiki Sakabe (IEICE Trans. Inf. Syst., 2010)

Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent. - Masahiko Sakai; Mizuhito Ogawa (Inf. Process. Lett., 2010)

Controlled Term Rewriting. - Florent Jacquemard; Yoshiharu Kojima; Masahiko Sakai (FroCoS, 2011)

Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. - Naoki Nishida 001; Masahiko Sakai; Toshiki Sakabe (RTA, 2011)

Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems. - Yoshiharu Kojima; Masahiko Sakai; Naoki Nishida 001; Keiichirou Kusakari; Toshiki Sakabe (Inf. Media Technol., 2011)

Improving Determinization of Grammar Programs for Program Inversion. - Minami Niwa; Naoki Nishida 001; Masahiko Sakai (LOPSTR, 2012)

Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity - Naoki Nishida 001; Masahiko Sakai; Toshiki Sakabe (Log. Methods Comput. Sci., 2012)

A Sound Type System for Typing Runtime Errors. - Akihisa Yamada 002; Keiichirou Kusakari; Toshiki Sakabe; Masahiko Sakai; Naoki Nishida 001 (Inf. Media Technol., 2012)

Determinization of conditional term rewriting systems. - Masanori Nagashima; Masahiko Sakai; Toshiki Sakabe (Theor. Comput. Sci., 2012)

On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms. - Naoki Nishida 001; Masahiko Sakai; Yasuhiro Nakano (TTATT, 2013)

Inverse Unfold Problem and Its Heuristic Solving. - Masanori Nagashima; Tomofumi Kato; Masahiko Sakai; Naoki Nishida 001 (WPTE@RTA/TLCA, 2014)

Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies. - Florent Jacquemard; Yoshiharu Kojima; Masahiko Sakai (CADE, 2015)

Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent. - Masahiko Sakai; Michio Oyamaguchi; Mizuhito Ogawa (CADE, 2015)

Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers. - Masahiko Sakai; Hidetomo Nabeshima (IEICE Trans. Inf. Syst., 2015)

An Extension of Proof Graphs for Disjunctive Parameterised Boolean Equation Systems. - Yutaro Nagae; Masahiko Sakai; Hiroyuki Seki (WPTE@FSCD, 2016)

Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems. - Ryota Nakayama; Naoki Nishida 001; Masahiko Sakai (WPTE@FSCD, 2016)

Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems. - Yutaro Nagae; Masahiko Sakai (WPTE@FSCD, 2017)

Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers. - Tomohiro Sasano; Naoki Nishida 001; Masahiko Sakai; Tomoya Ueyama (WPTE@FSCD, 2017)

Transformation of Combinatorial Optimization Problems Written in Extended SQL into Constraint Problems. - Genki Sakanashi; Masahiko Sakai (PPDP, 2018)

A Parse-Based Framework for Coupled Rhythm Quantization and Score Structuring. - Francesco Foscarin; Florent Jacquemard; Philippe Rigaux; Masahiko Sakai (MCM, 2019)

Conditions for confluence of innermost terminating term rewriting systems. - Sayaka Ishizuki; Michio Oyamaguchi; Masahiko Sakai (Appl. Algebra Eng. Commun. Comput., 2019)

ASAP: a dataset of aligned scores and performances for piano transcription. - Francesco Foscarin; Andrew McLeod; Philippe Rigaux; Florent Jacquemard; Masahiko Sakai (ISMIR, 2020)

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. - Mutsunori Banbara; Kenji Hashimoto; Takashi Horiyama; Shin-ichi Minato; Kakeru Nakamura; Masaaki Nishino; Masahiko Sakai; Ryuhei Uehara; Yushi Uno; Norihito Yasuda (CoRR, 2021)

8+8=4: Formalizing Time Units to Handle Symbolic Music Durations. - Emmanouil Karystinaios; Francesco Foscarin; Florent Jacquemard; Masahiko Sakai; Satoshi Tojo; Gerhard Widmer (CoRR, 2023)

Trash Detection Algorithm Suitable for Mobile Robots Using Improved YOLO. - Ryotaro Harada; Tadahiro Oyama; Kenji Fujimoto; Toshihiko Shimizu; Masayoshi Ozawa; Julien Samuel Amar; Masahiko Sakai (J. Adv. Comput. Intell. Intell. Informatics, 2023)

Navit(oo)n: Open Source Mobile Robot Project for Nakanoshima Robot Challenge. - Shunya Hara; Toshihiko Shimizu; Masayoshi Ozawa; Masahiko Sakai; Tadahiro Oyama; Julien Samuel Amar (J. Robotics Mechatronics, 2023)