Links

• DBLP

Publications

Journal papers

• Sayaka Ishizuki, Masahiko Sakai, and Michio Oyamaguchi,
  Conditions for Confluence of Innermost Terminating Term Rewriting Systems,
  Applicable Algebra in Engineering, Communication and Computing (AAECC), Vol.30, Issue 4, pp.349-360, 2019.
  AAM pdf : This is a post-peer-review, pre-copyedit version of an article published in AAECC. The final authenticated version will be available online at: doi 10.1007/s00200-018-0377-8
  
  
• Yutaro Nagae and Masahiko Sakai,
  Reduced Dependency Spaces for Existential Parameterised Boolean Equation Systems,
  Electronic Proceedins in Theoretical Computer Science (EPTCS), Vol. 265, pp. 67-81, Jan 2018.
  doi 10.4204/EPTCS.265.6
  
  
• Tomohiro Sasano, Naoki Nishida, Masahiko Sakai and Tomoya Ueyama,
  Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers,
  Electronic Proceedins in Theoretical Computer Science (EPTCS), Vol. 265, pp. 82-97, Jan 2018.
  doi 10.4204/EPTCS.265.7
  
  
• Yutaro Nagae, Masahiko Sakai and Hiroyuki Seki,
  An extension of proof graphs for disjunctive parameterised Boolean equation systems,
  Electronic Proceedins in Theoretical Computer Science (EPTCS), Vol. 235, pp. 46-61, Jan 2017.
  doi 10.4204/EPTCS.235.4
  
  
• Ryota Nakayama, Naoki Nishida and Masahiko Sakai,
  Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems,
  Electronic Proceedins in Theoretical Computer Science (EPTCS), Vol. 235, pp. 62-77, Jan 2017.
  doi 10.4204/EPTCS.235.5
  
  
• Masahiko Sakai and Hidetomo Nabeshima,
  Construction of an ROBDD for a PB-constraint in band form and related techniques for PB-solvers,
  IEICE Transaction on Information and Systems, Vol. E98-D, No. 6, pp. 1121-1127, Jun 2015,
  doi 10.1587/transinf.2014FOP0007.
  
  
• Masanori Nagashima, Masahiko Sakai and Toshiki Sakabe
  Determinization of Conditional Term Rewriting Systems,
  Theoretical Computer Science, Vol.464, pp.72-89, 2012,
  doi 10.1016/j.tcs.2012.09.005.
  
  abstract and pre-print
  
  
• Naoki Nishida, Masahiko Sakai, Toshiki Sakabe,
  Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity,
  Logical Methods in Computer Science, Vol.8, No.3 (2012).
  
  
• Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari and Toshiki Sakabe, Decidability of Reachability for Right-Shallow Context-Sensitive Term Rewriting Systems, IPSJ Transactions of Programming, Vol.4, No.2, pp.12-35 (2011, 10)
  abstract and pdf file
  
  
• Takeshi Hamaguchi, Masahiko Sakai, Masataka Baba and Kiyoshi Agusa
  Proving Method of Termination/Non-Termination for Functional Programs with Exception Handling, IPSJ Transactions of Programming, Vol.4, No.2, pp.13-30 (2011,Mar) (In Japanese).
  
  
• Naoki Nakabayashi, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe and Masahiko Sakai
  Lemma Generation Method in Rewriting Induction for Constrained Term Rewriting Systems, Computer Software, Vol.28, No.1, pp.173-189 (2011.2) (in Japanese).
  
  
• Masahiko Sakai, Mizuhito Ogawa
  Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent,
  Information Processing Letters, Vol.110, Issues 18-19, pp.810--814 (2010 Sep).
  abstract and pdf file of the pre-print
  
  
• Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe
  Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs,
  IEICE Trans. on Information and Systems, Vol.E93-D, No.5, pp.953-962, May 2010,
  doi 10.1587/transinf.E93.D.953.
  
  
• Yohei Umano, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, Keiichirou Kusakari
  Solving Satisfiability of CNF Formulas with Clauses based on Elementary Symmetric Functions,
  IEICE Trans. on Information and Systems, Vol.J93-D, No.1, pp.1-9(2010,1) (in Japanese).
  abstract and pdf file
  
  
• Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frederic Blanqui
  Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems, IEICE Trans. on Information and Systems, Vol.E92-D, No.10, pp.2007-2015, Oct 2009,
  doi 10.1587/transinf.E92.D.2007.
  
  
• Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari and Toshiki Sakabe
  Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems, IPSJ Transactions on Programming, Vol.2, No.3, pp.162-174(2009 Jul).
  abstract and pdf file
  
  
• Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa
  Head-Needed Strategy of Higher-Order Rewrite Systems and Its Decidable Classes, IPSJ Transactions on Programming, Vol.2, No.2, pp.144-165(2009,3).
  abstract and pdf file
  
  
• Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa
  Recognizability of Redexes for Higher-Order Rewrite Systems, IPSJ Transactions on Programming, Vol.2, No.2, pp.166-175(2009,3).
  abstract and pdf file
  
  
• Keiichirou Kusakari, Masahiko Sakai
  Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques,
  IEICE Transaction on Information and Systems, Vol. E92-D, No. 2, pp. 235-247, Feb 2009,
  doi 10.1587/transinf.E92.D.235.
  
  
• Yuki Furuichi, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari, Toshiki Sakabe
  Approach to Procedural-Program Verification based on Implicit Induction of Constrained Term Rewriting Systems, IPSJ Programming Vol.1, No.2, pp.100-121(2008,9) (in Japanese).
  
  
• Keiichirou Kusakari, Masahiko Sakai:
  Enhancing Dependency Pair Method using Strong Computability in Simply-Typed Term Rewriting Systems, Applicable Algebra in Engineering, Communication and Computing, Vol.18, No.5, pp.407-431(2007,10).
  abstract and pdf file of the preliminary version
  
  
• Keita Sakurai, Keiichirou Kusakari, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
  Usable Rules and Labeling Product-Typed Terms for Dependency Pair Method in Simply-Typed Term Rewriting Systems, IEICE Transactions on Information and Systems, Vol.J90-D, No.4, pp.978-989(2007,4) (in Japanese).
  
  
• Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe
  Primitive Indeuctive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting, IEICE Trans. on Information and Systems, Vol.E88-D, No.12, pp.2715-2726(2005,12).
  abstract and pdf file of the preliminary version
  
  
• Keita Sakurai, Keiichirou Kusakari, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
  Proving Sufficient Completeness of Functional Programs based on Recursive Structure Analysis and Strong Computability, In Proceedings of the Forum on Information Technology 2005 (FIT2005), Information Technology Letters, LA-001, pp.1-4(2005) (in Japanese).
  
  
• Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
  Generation of Inverse Computation Programs for Constructor Term Rewriting Systems, Tran. of IEICE, Vol.J88-D-I-8(2005), pp,1171-1183 (in Japanese).
  
  
• Masahiko Sakai, Keiichirou Kusakari
  On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems, IEICE Trans. on Information and Systems, Vol.E88-D, No.3, pp.583-593(2005).
  abstract and pdf file of the preliminary version
  
  
• Masanori Nagashima, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari
  Program Generation by Transformation from Quantified Equational Specifications, Computer Software, Japan Society for Software Science and Technology, Vol.21, No.4, pp.49-54(2004) (in Japanese).
  
  
• Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
  Improving Efficiency of Linear Constructor Term Rewriting Systems with Extra Variables, Computer Software, Japan Society for Software Science and Technology, Vol.21, No.3, pp.40-47(2004) (in Japanese).
  
  
• Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
  A Computation Model of Term Rewriting Systems with Extra Variables, Computer Software, Japan Society for Software Science and Technology, Vol.20, No.5, pp.85-89(2003) (in Japanese).
  
  
• Mihoko Horie, Masahiko Sakai, Toshiki Sakabe
  Typing Exceptions in an Object Calculus, Computer Software, Japan Society for Software Science and Technology, Vol.20, No.2, pp.54-58(2003) (in Japanese).
  
  
• Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, Generation of a TRS Implementing the Imverses of Pure Treeless Functipapers-j.htmlon, Computer Software, Japan Society for Software Science and Technology, Vol.19, No.1, pp.29-33(2002) (in Japanese).
  
  
• Masahiko Sakai, Yoshitsugu Watanabe, Toshiki Sakabe
  An Extension of Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems, IEICE Trans. on Information and Systems, Vol.E84-D, No.8, pp.1025-1032(2001,8). abstract and pdf file
  
  
• Sun Hui Hong, Masahiko Sakai, Toshiki Sakabe
  Confluence of Orthogonal Metaterm Rewriting Calculus with Rules Containing rules, Computer Software, Japan Society for Software Science and Technology, Vol.17,No.6, pp.47-51(2000) (in Japanese).
  
  
• Masahiko Sakai, Yoshihito Toyama
  Semantics and Strong Sequentiality of Priority Term Rewriting Systems, Theoretical Computer Science, Vol.208, pp.87-110(1998).
  abstract

• Munehiro Iwami, Masahiko Sakai, Yoshihito Toyama
  An Improved Recursive Decomposition Ordering for Higher-Order Rewrite Systems, IEICE Trans. on Information and Systems, Vol.E81-D, No.9, pp.988-996(1998,9).
  abstract
  
  
• Takashi Nagaya, Masahiko Sakai, Yoshihito Toyama
  Index Reduction of Overlapping Strongly Sequential Systems, IEICE Trans. on Information and Systems, Vol.E81-D, No.5, pp.419-426(1998,5).
  abstract and pdf file
  
  
• Masahiko Sakai
  Left-Incompatible Term Rewriting Systems and Functional Strategy, IEICE Trans. on Information and System E80-D 12(1997), 1176-1182.
  abstract and pdf file
  
  
• H.Kasuya, M.Sakai, S.Yamamoto, K.Agusa
  Term Set Rewriting Systems and their Confluent Property, Tran. of IEICE J80-D-I 4(1997), 325-334 (in Japanese).
  
  
• Y.Takahasi, M.Sakai, Y.Toyama
  , On the Confluence Property of Conditional Term Rewriting Systems, Trans. of IEICE J79-D-I 11(1996), 1-6 (in japanese).
  
  
• S.Yamamoto, R.Ishikawa, M.Sakai, K.Agusa
  An Implementation of TRS on Shared Memory Multiprocessors, Trans. of IEICE J78-D-I 6(1995), 559-562 (in Japanese).
  
  
• M.Kawakita, M.Sakai, S.Yamamoto, K.Agusa
  A model for reuse based on formal specifications, Trans. of IPSJ 36 5(1995), 1050-1058 (in Japanese).
  
  
• Y.Hamaguchi, M.Sakai, S.Yamamoto, K.Agusa
  Error Description on Algebraic Specification and its Automatic Addition, Trans. of IEICE J78-D-I 3 (1995) 323-330 (in japanese).
  
  
• M.Sakai, T.Sakabe, Y.Inagaki
  Cover Set Induction for Verifying Algebraic Specifications, Trans. of IEICE J75-D-I 3 (1992), 170-179 (in japanese).
  
  
• M.Sakai, T.Sakabe, Y.Inagaki
  Algebraic Specification and Automatic Generation of Compilers, Trans. of IEICE J73-D-I 12 (1990), 979-989 (in japanese).
  
  
• M.Sakai, T.Sakabe, Y.Inagaki
  LASS, Language Processor Generator based on Algebraic Specification Method, Trans. of IEICE J73-D-I 10 (1990), 829-838 (in japanese).
  
  
• M.Sakai, T.Sakabe, Y.Inagaki
  Direct Implementation System of Algebraic Specification of Abstract Data Types, Computer Software, Japan Society for Software Science and Technology, Vol.3, No.4 pp.16-27 (1988) (in japanese).
  
  

Conferences, Workshops(refereed)

• Aart Middeldorp, Masahiko Sakai, and Sarah Winkler,
  Ground Canonical Rewrite Systems Revisited,
  Proceedings of the 12th International Workshop on Confluence (IWC 2023), pp. 44-48, Obergurgl, Austria, August 23-24, 2023.
  IWC 2023 proceedings.
  
  
• Francesco Foscarin, Andrew McLeod, Philippe Rigaux, Florent Jacquemard, and Masahiko Sakai,
  ASAP: a dataset of aligned scores and performances for piano transcription,
  Proceedings of the 21st International Society for Music Information Retrieval Conference (ISMIR 2020), pp. 534-541, virtual, October 11th-16th, 2020.
  doi 10.5281/zenodo.4245490.
  
  
• Francesco Foscarin, Florent Jacquemard, Philippe Rigaux, and Masahido Sakai,
  A Parse-based Framework for Coupled Rhythm Quantization and Score Structuring,
  Proceedings of the 7th International Conference on Mathematics and Computation in Music (MCM 2019), Lecture Notes in Artificial Intelligence, Vol. 11502, pp. 248-260, Madrid, June 2019.
  doi 10.1007/978-3-030-21392-3_20.
  
  pp. 145-153, A Coruna, Spain, May 2017.
  
  
• Masahiko Sakai,
  SQL for combinatorial optimization problems and SMT-based solving by SQL transformation,
  Sixth International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2019), Dortmund, June 2019. (Invited talk, non-refereed)
  
  
• Genki Sakanashi and Masahiko Sakai,
  Transformation of Combinatorial Optimization Problems Written in Extended SQL into Constraint Problems,
  In Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming (PPDP 2018), ACM, isbn:978-1-4503-6441-6, pp. 19:1-19:13, Frankfurt am Main, September 2018.
  accepted version (c)authors/2018. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive version was published in doi 10.1145/3236950.3236963
  
  
• Florent Jacquemard, Adrien Ycart, and Masahiko Sakai,
  Generating Equivalent Rhythmic Notations Based on Rhythm Tree Languages,
  Proceedings of the International Conference on Technologies for Music Notation and Representation (TENOR 2017), pp. 145-153, A Coruna, Spain, May 2017.
  
  
• Sayaka Ishizuki, Masahiko Sakai, and Michio Oyamaguchi,
  Conditions for confluence of innermost terminating term rewriting systems,
  Proceedings of the 5th International Workshop on Confluence (IWC 2016), pp. 65-69, Obergurgl, Austria, September 8-9, 2016.
  
  
• Ryota Nakayama, Naoki Nishida, and Masahiko Sakai,
  Sound Structure-Preserving Transformation for Ultra-Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems,
  Informal Proceedings of the 3rd International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2016), pp. 61-75, June 23, 2016.
  
  
• Yutaro Nagae and Masahiko Sakai,
  An extension of proof graphs for disjunctive parameterised Boolean equation systems,
  Informal Proceedings of the 3rd International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2016), pp. 3-14, June 23, 2016.
  
  
• Masahiko Sakai, Michio Oyamaguchi, and Mizuhito Ogawa,
  Non-E-overlapping, weakly shallow, and non-collapsing TRSs are confluent,
  Proceddings of the 25th International Conference on Automated Deduction (CADE 2015), Lecture Notes in Computer Science, Vol. 9195, pp. 111-126, Berlin, August 2015.
  
  
• Yoshiharu Kojima, Masahiko Sakai, and Florent Jacquemard,
  Term Rewriting with Prefix Context Constraints and Regularity Preservation and Bottom-Up Strategies,
  Proceddings of the 25th International Conference on Automated Deduction (CADE 2015), Lecture Notes in Artificial Intelligence, Vol. 9195, pp.137-151 , Berlin, August 2015.
  
  
• Pierre Donat-Bouillud, Florent Jacquemard, and Masahiko Sakai
  Towards an Equational Theory of Rhythm Notation,
  The Music Encoding Conference 2015, 2 pages, Florence, May 18-21 2015.
  
  
• Masanori Nagashima, Tomofumi Kato, Masahiko Sakai and Naoki Nishida,
  Inverse Unfold Problem and Its Heuristic Solving,
  Proceedings of the 1st International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2014), OASIcs, Vol. 40, pp.27-38, Vienna, July 2014.
  
  
• Masahiko Sakai, Michio Oyamaguchi, Mizuhito Ogawa,
  Non-E-overlapping and weakly shallow TRSs are confluent,
  Proceedings of the 3rd International Workshop on Confluence (IWC 2014), pp.34-38, Vienna, July 13 2014.
  
  
• Naoki Nishida, Masahiko Sakai, and Yasuhiro Nakano,
  On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms,
  2nd International Workshop on Trends in Tree Automata and Tree Transducers (TTATT 2013), Electronic Proceedings in Theoretical Computer Science, Vol. 134, pp. 1-10, Hanoi, Vietnam, Oct. 2013.
  
  
• Minami Niwa, Naoki Nishida, and Masahiko Sakai,
  Extending Matching Operation in Grammar Program for Program Inversion,
  In Proceedings of the 22nd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2012), pp. 130-139, Leuven, Belgium, Sept. 2012.
  Minami Niwa, Naoki Nishida, and Masahiko Sakai,
  Improving Determinization of Grammar Programs for Program Inversion,
  In Revised Selected Papers of the 22nd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2012), Lecture Notes in Computer Science, Vol. 7844, pp. 137-154, April 2013.
  
  
• Naoki Nishida, Futoshi Nomura, Katsuhisa Kurahashi and Masahiko Sakai,
  Constrained Tree Automata and their Closure Properties,
  In Proceedings of the 1st International Workshop on Trends in Tree Automata and Tree Transducers (TTATT 2012), pp. 24-34, Nagoya, June 2012.
  
  
• Masahiko Sakai,
  On determinazation of conditional term rewriting systems,
  Proc. of 9th Asian Workshop on Foundation of Software (AWFS 2012), pp.18-19, Chengdu, June 23 - 24 2012.
  
  
• Masahiko Sakai, Yohei Umano and Yoshizane Hino,
  CNFs with Elementary Symmetric Clauses and Their SAT Solving,
  Proc. of 8th Asian Workshop on Foundation of Software (AWFS 2011), 2 pages, Shanghai, May 13 - 14 2011.
  
  
• Florent Jacquemard, Yoshiharu Kojima and Masahiko Sakai
  Controlled Term Rewriting,
  Proc. of 8th Int'l Symposium Frontiers of Combining Systems, 2011(FroCos 2011), LNCS 6989, pp.179-194.
  
  
• Naoki Nishida, Masahiko Sakai and Toshiki Sakabe
  Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity, Proc. of 22nd Int'l Conference on Rewriting Techniques and Applications, 2011(RTA2011), LIPIcs, Vol.10, pp.267-282.
  LIPIcs on line journal
  
  
• Naoki Nishida, Masahiko Sakai and Tatsuya Hattori
  On Disproving Termiation of Constrained Term Rewriting Systems, Proc. of 11th Int'l Workshop on Termination, 2010(WST2010), 5 pages.
  abstract and pre-print
  
  
• Naoki Nishida and Masahiko Sakai
  Proving Injectivity of Functions via Program Inversion in Term Rewriting, Proc. of 10th Int'l Symposium on Functional and Logic Programming, 2010(FLOPS2010), LNCS 6009, pp.288-303.
  abstract and pre-print
  
  
• Yoshiharu Kojima and Masahiko Sakai
  Innermost Reachability and Context Sensitive Reachability Properties are Decidable for Linear Right-Shallow Term Rewriting Systems, Proc. of 19th Int'l Conference on Term Rewriting and Applications, Hagenberg, 2008(RTA2008), LNCS 5117, pp.187-201.
  abstract and pre-print
  
  
• Naoki Nishida and Masahiko Sakai
  Completion as Post-Process in Program Inversion of Injective Functions, Proc. of 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS2007), Hagenberg, pp.61-75 (2008).
  abstract and pre-print
  
  
• Masahiko Sakai and Wang Yi
  Undecidable Properties on Length-Two String Rewriting Systems, Proc. of 7th International Workshop on Reduction Strategies in Rewriting and Programming, Paris, 2007(WRS2007), pp.43-57.
  Electric Notes in Theoretical Computer Science, Vol.204, No.4, pp.53-69 (2008,4).
  abstract and pre-print
  
  
• Keita Uchiyama, Masahiko Sakai and Toshiki Sakabe
  Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems, Proc. of 7th International Workshop on Reduction Strategies in Rewriting and Programming (WRS2007), Paris, pp.16-27 (2007).
  Electric Notes in Theoretical Computer Science, Vol.204, No4, pp.21-34 (2008,4).
  abstract and pre-print
  
  
• Naoki Nishida, Masahiko Sakai, and Terutoshi Kato. Convergent Term Rewriting Systems for Inverse Computation of Injective Functions, Proc. of the 9th International Workshop on Termination, Paris, 2007(WST'07), pp.77-81.
  abstract and pre-print
  
  
• Wang Yi and Masahiko Sakai
  Decidability of Termination for Semi-Constructor TRSs, Left-Linear Shallow TRSs and Related Systems, Proc. of 17th Int'l Conference on Term Rewriting and Applications, Seattle, 2006(RTA2006), LNCS 4098, pp.343-356.
  abstract, pre-print and bug fixed version
  
  
• Wang Yi and Masahiko Sakai
  On Non-looping Term Rewriting, Proc. of Eighth International Workshop on Termination, Seattle, 2006(WST2006), pp.17-21.
  abstract and pre-print
  
  
• Naoki Nishida, Tomohiro Mizutani, and Masahiko Sakai
  Transformation for Refining Unraveled Conditional Term Rewriting Systems, Proc. of 6th International Workshop on Reduction Strategies in Rewriting and Programming, Seattle, 2006(WRS2006), pp.34-48
  abstract and pre-print
  Electronic Notes in Theoretical Computer Science, Issue 10, Vol.174, pp.75-95, 2007.
  
  
• Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
  Partial Inversion of Constructor Term Rewriting Systems, Proc. of 16th Int'l Conference on Term Rewriting and Applications, Nara, 2005(RTA2005), Springer, LNCS 3467, pp.264-278.
  abstract and pre-print
  
  
• Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
  Narrowing-based Simulation of Term Rewriting Systems with Extra Variables and its Termination Proof, 12th Int'l Workshop on Functional and (Constraint) Logic Programming Valencia, Spain, June 12-13, 2003(WFLP'03).
  abstract and pre-print
  
  
• Masahiko Sakai, Kouji Okamoto, Toshiki Sakabe
  Innermost Reductions Find All Normal Forms on Right-Linear Terminating Overlay TRSs, Proc. of 3rd Int'l Workshop on Reduction Strategies in Rewriting and Programming, Valencia, Spain, June 8, 2003 (WRS'03). (wrs03.ps.gz)  (wrs03.pdf)
  
  
• Hideto Kasuya, Masahiko Sakai and Kiyoshi Agusa
  Descendants and Head Normalization of Higher-Order Rewrite Systems, Sixth International Symposium on Functional and Logic Programming, Aizu, Japan, September 15-17, in LNCS 2441, pp.198-211(2002). (flops02_13.ps.gz)  (flops02_13.pdf)
  
  
• Masahiko Sakai and Keiichirou Kusakari
  On Proving Termination of Higher-Order Rewrite Systems by Dependency Pair technique, The First International Workshop on Higher-Order Rewriting (HOR'02), Copenhagen, Denmark, July 21, p.25(2002). (HOR02.ps.gz)  (HOR02.pdf)
  
  
• Masahiko Sakai and Keiichirou Kusakari
  On New Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems, The International Workshop on Rewriting in Proof and Computation (RPC'01), Sendai, Japan, October 25-27, pp.176-187(2001). (rpc01a.ps.gz)  (rpc01a.pdf)
  
  
• Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe
  Generation of Inverse Term Rewriting Systems for Pure Treeless Functions, The International Workshop on Rewriting in Proof and Computation (RPC'01), Sendai, Japan, October 25-27, pp.188-198(2001). (rpc01b.ps.gz)  (rpc01b.pdf)
  
  
• M.Sakai, Y.Toyama
  Semantics and Strong Sequentiality of Priority Term Rewriting Systems, Proc. on Rewriting Techniques and Applications at New Brunswick NJ USA (RTA'96), LNCS 1103 (1996), 377-391. (rta96.ps.gz)
  
  
• Yasuyoshi Inagaki, Hidehiko Kita, Masahiko Sakai, Toshiki Sakabe
  An Algebraic Approach to Specification of Programming Languages and Automatic Generation of Language Processors, Proc. Regional Symp. on Computer Sci. and its Applications, in Thai, pp.35-1--35-25(1987).

Others(selected)

• Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda,
  Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions,
  doi 10.48550/arXiv.2110.05184.
  
  
• Genki Sakanashi and Masahiko Sakai
  Transformation of SQL-based Combinatorial Optimization Problems into Constraint Problems,
  The 112th meeting of Special Interest Group on Fundamental Problems in Artificial Intelligence (SIG-FPAI), SIG-FPAI-B903-03, pp. 12-17, 2020. pdf file
  
  
• Keita Uchiyama，Masahiko Sakai，Toshiki Sakabe，Keiichirou kusakari， Naoki Nishida
  Decidability of Termination Properties for Term Rewriting Systems consisting of Shallow Dependency Pairs, Tech. Rep. of IEICE (SS2008-45), Vol.108, No.362, pp.37-42(2008).
  abstract and pdf file
  
  
• Yasuo Isogai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida
  Proving Termination of Higher-Order Rewrite Systems based on Strongly Computable Dependency Pair Method, Tech. Rep. of IEICE (SS2006-6) Vol.106, No.15, pp.31-36(2006). (in Japanese) (SS06-04.ps.gz)  (SS06-04.pdf)
  An abridgment by English (ss0604e.ps)  (ss0604e.pdf)
  An improvement version of the abridgment (ss0604e+.ps)  (ss0604e+.pdf)
  
  
• K.Okamoto, M.Sakai, T.Sakabe
  A Condition for Completeness of Innermost Strategy on Right-Linear Terminating TRSs, Tokai-Shibu Taikai, p.564(2003) (in Japanese). (pdf) (pdf: Translated into English)
  
  

Note

• Masahiko Sakai
  Innermost Terminating Right-Linear Overlay Term Rewriting Systems are Terminating, note, Oct. 2003(sin-sn-031015.pdf)