Links

• DBLP

主な著書・論文

著書など

• 坂部俊樹編、分担執筆酒井正彦： プログラムの設計、 オーム社、116頁(2000,8).

論文誌

• 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 is 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.
  
  
• 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, pp.193-216 (2011, 10)
  doi 10.2197/ipsjtrans.4.193
  
  
• 濱口 毅, 酒井正彦, 馬場正貴, 阿草清滋
  例外処理を持つ関数型プログラムの停止性・非停止性証明法,
  IPSJ Transactions of Programming, Vol.4, No.2, pp.13-30 (2011,3).
  abstract and pdf
  
  
• 中林直生, 西田直樹, 草刈圭一朗, 坂部俊樹, 酒井正彦
  制約付き項書換え系の書換え帰納法における補題等式の自動生成法, コンピュータソフトウェア, Vol.28, No.1, pp.173-189 (2011.2).
  abstract and pdf file
  
  
• 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.
  
  
• 馬野洋平, 酒井正彦, 西田直樹, 坂部俊樹, 草刈圭一朗
  基本対象関数に基づく節を持つCNF論理式の充足可能性判定,
  電子情報通信学会論文誌, Vol.J93-D, No.1, pp.1-9(2010,1).
  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.
  
  
• 古市祐樹, 西田直樹, 酒井正彦, 草刈圭一朗, 坂部俊樹
  制約付き項書換え系の潜在帰納法を利用した手続き型プログラム検証の試み, 情報処理学会論文誌プログラミング Vol.1, No.2, pp.100-121(2008,9).
  
  
• 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 pre-print
  
  
• 櫻井敬大, 草刈圭一朗, 酒井正彦, 坂部俊樹，西田直樹
  単純型項書き換え系上の依存対法における実効規則と直積型項へのラベル付け、 電子情報通信学会論文誌 Vol.J90-D, No.4, pp.978-989(2007,4).
  
  
• 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 pre-print
  
  
• 櫻井敬大、草刈圭一朗、西田直樹、酒井正彦、坂部俊樹
  関数プログラムの再帰構造解析と強計算性に基づく十分完全性の証明法、 第4回情報科学技術フォーラム(FIT2005)、情報科学技術レターズ、 LA-001，pp.1-4(2005,9)．
  
  
• 西田直樹、酒井正彦、坂部俊樹
  構成子項書換え系の逆計算プログラムの生成， 電子情報通信学会論文誌 Vol.J88-D-I, No.8, pp.1171-1183(2005,8).
  概要
  
  
• 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 pre-print
  
  
• 長島正徳、酒井正彦、坂部俊樹、草刈圭一朗
  限量子付き等式理論の 変換に基づく仕様からのプログラム生成、コンピュータソフトウェア, Vol.21, No.4, pp.49-54(2004)
  
  
• 西田直樹、酒井正彦、坂部俊樹
  右辺のみに現れる変数を持つ線形構 成子項書換え系の計算の効率化、コンピュータソフトウェア, Vol.21, No.3, pp.40-47(2004)
  
  
• 西田直樹、酒井正彦、坂部俊樹
  右辺のみに現れる変数を持つ項書換 え系の計算モデル、コンピュータソフトウェア, Vol.20, No.5, pp.85-89(2003,9)
  
  
• 堀江美保子、酒井正彦、坂部俊樹
  オブジェクト指向計算モデルにおける例外 処理機能の型付、コンピュータソフトウェア, Vol.20, No.2, pp.54-58(2003,3).
  
  
• 西田直樹, 酒井正彦, 坂部俊樹
  PT関数の逆関数を定義するTRSの生成, コンピュータソフトウエア, Vol.19, No.1, pp.29-33(2002,1).
  
  
• 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
  
  
• 洪順姫、酒井正彦、坂部俊樹
  メタ項書換え計算における規則中に規則を含む 直交メタ項の合流性、コンピュータソフトウェア、Vol.17, No.6, pp.47-51(2000).
  
  
• 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
  
  
• 粕谷、酒井、山本、阿草
  項集合書換え系とその合流性，電子 情報通信学会論文誌 Vol.J80-D-I, No.4, pp.325-334(1997,4).
  概要
  
  
• 高橋, 酒井, 外山
  条件付き項書換え系の合流性について, 電子情 報通信学会論文誌, Vol.J79-D-I, No.11, pp.1-6, 1996.
  
  
• 山本、石川、酒井、阿草
  共有メモリ型並列計算機における 項書換え系の実現方式，電子情報通信学会論文誌，Vol.J78-D-I, No.6, pp.559-562(1995,6).
  
  
• 川北、酒井、山本、阿草
  形式的仕様を用いた再利用モデル， 情報処理学会論文誌，Vol.36, No.5, pp.1050-1058(1995,5).
  
  
• 濱口, 酒井, 山本, 阿草
  エラーつき代数的仕様とエラー記述の自動 付加, 電子情報通信学会論文誌, 電子情報通信学会論文誌, Vol.J78-D-I, No.3, pp.323-330, 1995.
  
  
• 酒井, 坂部, 稲垣
  代数的仕様の検証のための被覆集合帰納法, 電子 情報通信学会論文誌, Vol.J75-D-I, No.3, 1992.
  
  
• 酒井, 坂部, 稲垣
  コンパイラの代数的仕様記述と自動生成, 電子情 報通信学会論文誌, Vol.J73-D-I, No.12, 1990.
  
  
• 酒井, 坂部, 稲垣
  代数的仕様記述法に基づく言語処理系の自動生成 システム Lass, 電子情報通信学会論文誌, Vol.J73-D-I, No.10, 1990.
  
  
• 酒井, 坂部, 稲垣
  抽象データ型の代数的仕様の直接実現系Cdimple, コンピュータソフトウエア, Vol.4, No.4, 1987.

国際会議など(査読つき)

• 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.
  
  
• 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)
  
  
• 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.
  
  
• 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.
  abstract and pre-print
  
  
• 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, 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 (WRS2007), Paris, pp.43-57 (2007),
  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 8th 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, 16th Int'l Conference on Term Rewriting and Applications, Nara, 2005(RTA2005), Springer, LNCS 3467, pp.264-278.
  abstract and pdf
  
  
• 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, pp.198-211, 2003(WFLP'03).
  abstract and pdf
  
  
• 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, pp.79-88, 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 (FLOPS2002), 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)
  
  
• Masahiko Sakai, Yoshihito 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, pp.377-391(1996). (rta96.ps.gz)  (rta96.pdf)
  
  
• 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).

その他(一部)

• 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, 柳川市（開催中止）, Mar 8-9, 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
  
  
• 磯谷泰巨、草刈圭一朗、酒井正彦、坂部俊樹、西田直樹
  強計算依存対法による高階書換え系の停止性証明、 電子情報通信学会技術報告 Vol.106, No.15 (SS2006-6), pp.31-36(2006). (SS06-04.ps.gz)  (SS06-04.pdf)
  
  
• 水野健一、草刈圭一朗、酒井正彦、坂部俊樹
  左辺が一致するオーバ レイ性を持つ左線形TRSの正規化戦略、2003年度冬のLAシンポジウム， pp.37.1--37.6(2004,2). 計算機科学基礎理論の新展開、京都大学数理解析研 究所講究録, No.1375, pp.247-252(2004).(kokyuroku2004.pdf)
  
  
• 岡本晃治、酒井正彦、坂部俊樹
  最内書換えに基づく項書換え系の完全な書換え戦略、平成15年度電気関係学会東海支部連合大会講演論文集、 p.564(2003). (pdf) (pdf: Translated into English)
  
  
• 粕谷英人、酒井正彦、山本晋一郎、阿草清滋
  項集合書換え系の 完備化について、電子情報通信学会技術報告，SS98-66, pp.25-31(1998,12).

ノート

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

---

Last modified: Jul.17.2024 by Masahiko Sakai(mail: sakai at i.nagoya-u.ac.jp).