更新日: 2019/03/14

主な発表論文


学位論文

  1. Naoki Nishida.
    Transformational Approach to Inverse Computation in Term Rewriting.
    博士論文, 名古屋大学(大学院工学研究科) (2004年-1月).
    [ps][pdf]

論文誌(査読付き)

  1. Ivan Lanese, Naoki Nishida, Adrián Palacios, and Germán Vidal.
    A Theory of Reversibility for Erlang.
    Journal of Logical and Algebraic Methods in Programming, Vol. 100, pp. 71-97, Nov. 2018.
    [link]

  2. Takahiro Nagao and Naoki Nishida.
    Rewriting induction for constrained inequalities.
    Science of Computer Programming, Vol. 155, pp. 76-102, April 2018.
    [link]

  3. Naoki Nishida, Adrián Palacios, and Germán Vidal.
    Reversible computation in term rewriting.
    Journal of Logical and Algebraic Methods in Programming 94:128-149, January 2018.
    [link]

  4. Carsten Fuhs, Cynthia Kop, and Naoki Nishida.
    Verifying Procedural Programs via Constrained Rewriting Induction.
    ACM Transactions on Computational Logic (TOCL) 18(2):14:1-14:50, June 2017.
    英語版のページからダウンロード可)

  5. José Iborra, Naoki Nishida, Germán Vidal, and Akihisa Yamada.
    Relative Termination via Dependency Pairs.
    Journal of Automated Reasoning 58(3):391-411, Springer, March, 2017.
    [link]

  6. Naoki Nishida and Germán Vidal.
    A framework for computing finite SLD trees.
    The Journal of Logical and Algebraic Methods in Programming, Vol. 84, Issue 2, pp. 197-217 (2015年-3月).
    [link]

  7. Naoki Nishida and Germán Vidal.
    Conversion to tail recursion in term rewriting.
    The Journal of Logic and Algebraic Programming, Vol. 83, Issue 1, pp. 53-63 (2014年1月).
    [link]

  8. Naoki Nishida, Masahiko Sakai, and 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-4, pp. 1-49, (2012年8月).
    SPECIAL ISSUE: Selected papers of the "22nd International Conference on Rewriting Techniques and Applications (RTA'11)".
    Preliminary version can be found in the proceedings of RTA 2011.
    [link]

  9. Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, and Naoki Nishida.
    A Sound Type System for Typing Runtime Errors.
    IPSJ Transactions on Programming, Vol. 5, No. 2, pp. 16-24, (2012年-3月).
    [link]

  10. Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, and Toshiki Sakabe.
    Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems.
    IPSJ Transactions on Programming, Vol. 4, No. 4, pp. 12-35 (2011年-9月).
    [link]

  11. 中林直生, 西田直樹, 草刈圭一朗, 坂部俊樹, 酒井正彦.
    制約付き項書換え系の書換え帰納法における補題等式の自動生成法.
    コンピュータソフトウェア, Vol. 28, No. 1, pp. 173-189, (2011年-2月).

  12. Naoki Nishida and Germán Vidal.
    Termination of Narrowing via Termination of Rewriting.
    Applicable Algebra in Engineering, Communication and Computing, Vol. 21, No. 3, pp. 177-225, (2010年-5月).
    [link]

  13. 馬野洋平, 酒井正彦, 西田直樹, 坂部俊樹, 草刈圭一朗,
    基本対象関数に基づく節を持つCNF論理式の充足可能性判定.
    電子情報通信学会論文誌D,
    Vol. J93-D, No. 1, pp. 1-9, (2010年-1月).

  14. 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.20-32, (2009年-7月).
    [link]

  15. Naoki Nishida and Masahiko Sakai.
    Completion after Program Inversion of Injective Functions.
    Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'08),
    Vol. 237 of Electronic Notes in Theoretical Computer Science, pp. 39-56, (2009年-4月).
    (This is a revised version of the preproceeding at WRS'08.)
    [link] (full version [pdf])

  16. 坂田翼, 西田直樹, 坂部俊樹, 酒井正彦, 草刈圭一朗.
    制約付き項書換え系における書換え帰納法.
    情報処理学会論文誌プログラミング, Vol. 2, No. 2, pp. 80-96, (2009年-3月).
    [link]

  17. 古市祐樹, 西田直樹, 酒井正彦, 草刈圭一朗, 坂部俊樹.
    制約付き項書換え系の潜在帰納法を利用した手続き型プログラム検証の試み.
    情報処理学会論文誌プログラミング, Vol. 1, No. 2, pp. 100-121, (2008年-9月).
    [link]

  18. 黒川翔, 桑原寛明, 山本晋一郎, 坂部俊樹, 酒井正彦, 草刈圭一朗, 西田直樹.
    例外処理付きオブジェクト指向プログラムにおける情報流の安全性解析のための型システム.
    電子情報通信学会論文誌 D,
    Vol. J91-D, No. 3, pp. 757-770, (2008年-3月).

  19. Naoki Nishida, Tomohiro Mizutani, and Masahiko Sakai.
    Transformation for Refining Unraveled Conditional Term Rewriting Systems.
    Proceedings of the Sixth International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2006),
    Vol. 174 of Electronic Notes in Theoretical Computer Science, Issue 10, pp. 75-95, (2007年-7月).
    (This is a revised version of the preproceeding at WRS'06.)
    [link]

  20. 櫻井敬大, 草刈圭一朗, 酒井正彦, 坂部俊樹, 西田直樹.
    単純型項書換え系上の依存対法における実効規則と直積型項へのラベル付け.
    電子情報通信学会論文誌 D,
    Vol. J90-D, No. 4, pp. 978-989, (2007年-4月).

  21. 西田直樹, 酒井正彦, 坂部俊樹.
    構成子項書換え系の逆計算プログラムの生成.
    電子情報通信学会論文誌 D-I,
    Vol. J88-D-I, No. 8, pp. 1171-1183 (2005年-8月).

  22. 西田直樹, 酒井正彦, 坂部俊樹.
    右辺のみに現れる変数を持つ線形構成子項書換え系の計算の効率化.
    コンピュータソフトウェア,
    Vol. 21, No. 3, pp. 40-47 (2004年-5月).

  23. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe.
    Narrowing-Based Simulation of Term Rewriting Systems with Extra Variables and its Termination Proof.
    Functional and Constraint Logic Programming,
    Vol. 86 of Electronic Notes in Theoretical Computer Science, Issue 3, pp. 1-18 (2003年-11月).
    (the revised version of the preproceeding at WFLP'03)
    [link]

  24. 西田直樹, 酒井正彦, 坂部俊樹.
    右辺のみに現れる変数を持つ項書換え系の計算モデル.
    コンピュータソフトウェア,
    Vol. 20, No. 5, pp. 85-89 (2003年-9月).

  25. 西田直樹, 酒井正彦, 坂部俊樹.
    PT関数の逆関数を定義するTRSの生成.
    コンピュータソフトウェア,
    Vol. 19, No. 1, pp. 29-33 (2002年-1月).

会議録(査読付き)

  1. Yoshiaki Kanazawa and Naoki Nishida.
    On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems,
    In Proceedings of the 5th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2018),
    Electronic Proceedings in Theoretical Computer Science, Vol. 289, pp. 34-52, Open Publishing Association, February 2019.
    [link]

  2. Naoki Nishida and Yuya Maeda.
    On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions,
    In Proceedings of the 5th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2018),
    Electronic Proceedings in Theoretical Computer Science, Vol. 289, pp. 68-87, Open Publishing Association, February 2019.
    [link]

  3. Naoki Nishida and Sarah Winkler.
    Loop Detection by Logically Constrained Term Rewriting,
    In Proceedings of the 10th Working Conference on Verified Software: Theories, Tools, and Experiments (VSTTE 2018),
    Vol. 11294 of Lecture Notes in Computer Science, pp. 309-321, 2018.

  4. Naoki Nishida and Yuya Maeda.
    Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems,
    In Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018),
    Leibniz International Proceedings in Informatics, Vol. 108, pp. 26:1-26:20, July 2018.
    [LIPIcs page]

  5. Naoki Nishida, Yuta Tsuruta, and Yoshiaki Kanazawa,
    Convergence of Simultaneously and Sequentially Unraveled TRSs for Normal Conditional TRSs,
    In Proceedings of the 7th International Workshop on Confluence (IWC 2018), pp. 51-55, July 2018.

  6. Ivan Lanese, Naoki Nishida, Adrián Palacios, and Germán Vidal.
    CauDEr: A Causal-Consistent Reversible Debugger for Erlang,
    In Proceedings of the 14th International Conference on Functional and Logic Programming (FLOPS 2018),
    Vol. 10818 of Lecture Notes in Computer Science, pp. 247-263, May 2018.
    [link]

  7. Shinnosuke Mizutani and Naoki Nishida.
    Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction.
    In Proceedings of the 4th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2017),
    Electronic Proceedings in Theoretical Computer Science, Vol. 265, pp. 35-51, Open Publishing Association, February 2018.
    [link]

  8. Tomohiro Sasano, Naoki Nishida, Masahiko Sakai and Tomoya Ueyama.
    Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers.
    In Proceedings of the 4th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2017),
    Electronic Proceedings in Theoretical Computer Science, Vol. 265, pp. 82-97, Open Publishing Association, February 2018.
    [link]

  9. Naoki Nishida, Adrián Palacios, and Germán Vidal.
    Towards Reversible Computation in Erlang.
    In Revised Selected Papers of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016),
    Vol. 10184 of Lecture Notes in Computer Science, pp. 259-274 (2017年-7月).

  10. Ryota Nakayama, Naoki Nishida, and Masahiko Sakai.
    Sound Structure-Preserving Transformation for Ultra-Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems.
    In Proceedings of the 3rd International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2016),
    Electronic Proceedings in Theoretical Computer Science, Vol. 235, pp. 62–77, Open Publishing Association, January 2017.
    [EPTCS page] [link]

  11. Naoki Nishida.
    Notes on Confluence of Ultra-WLL SDCTRSs via a Structure-Preserving Transformation.
    In Proceedings of the 5th International Workshop on Confluence (IWC 2016), pp. 60-64, September, 2016.

  12. Takahiro Nagao and Naoki Nishida.
    Proving inductive validity of constrained inequalities.
    In Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming (PPDP 2016), pp. 50-61, ACM, September, 2016.
    [link]

  13. Naoki Nishida, Adrián Palacios, and Germán Vidal.
    Reversible Term Rewriting in Practice.
    In Informal Proceedings of the 3rd International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2016), pp. 77-85, June, 2016.

  14. Naoki Nishida, Adrián Palacios, and Germán Vidal.
    Reversible Term Rewriting.
    In Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016),
    Leibniz International Proceedings in Informatics, Vol. 52, pp. 28:1-28:18, June, 2016.
    [LIPIcs page]

  15. Cynthia Kop and Naoki Nishida.
    Constrained Term Rewriting tooL.
    In Proceedings of the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-20),
    Vol. 9450 of Lecture Notes in Computer Science, pp. 549-557, 2015年11月.

  16. Cynthia Kop and Naoki Nishida.
    Automatic Constrained Rewriting Induction towards Verifying Procedural Programs.
    In Proceedings of the 12th Asian Symposium on Programming Languages and Systems (APLAS 2014),
    Vol. 8858 of Lecture Notes in Computer Science, pp. 334-353, 2014年11月.

  17. Naoki Nishida and Takumi Kataoka.
    On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants.
    Proceedings of the 14th International Workshop on Termination (WST 2014), 5 pages, 2014年7月.

  18. Karl Gmeiner and Naoki Nishida.
    Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems.
    Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2014),
    OpenAccess Series in Informatics (OASIcs), Vol. 40, pp. 3-14, 2014年7月.
    [OASIcs page]

  19. Naoki Nishida, Makishi Yanagisawa, and Karl Gmeiner.
    On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings.
    Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2014),
    OpenAccess Series in Informatics (OASIcs), Vol. 40, pp. 39-50, 2014年7月.
    [OASIcs page] [link]

  20. Masanori Nagashima, Tomofumi Kato, Masahiko Sakai, and Naoki Nishida.
    Inverse Unfold Problem and Its Heuristic Solving.
    Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2014),
    OpenAccess Series in Informatics (OASIcs), Vol. 40, pp. 27-38, 2014年7月.
    [OASIcs page]

  21. Naoki Nishida, Makishi Yanagisawa, and Karl Gmeiner.
    On Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation.
    Proceedings of the 3rd International Workshop on Confluence (IWC 2014), pp. 24-28, 2014年7月.

  22. Naoki Nishida, Masahiko Sakai, and Yasuhiro Nakano.
    On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms.
    Proceedings of the 2nd International Workshop on Trends in Tree Automata and Tree Transducers (TTATT 2013),
    Electronic Proceedings in Theoretical Computer Science, Vol. 134, pp. 1–10 [2013年10月].
    [link]

  23. Cynthia Kop and Naoki Nishida.
    Term Rewriting with Logical Constraints.
    In Proceedings of the 9th International Symposium on Frontiers of Combining Systems (FroCoS 2013),
    Vol. 8152 of Lecture Notes in Artificial Intelligence, pp. 343-358 (2013年-9月).

  24. Naoki Nishida and Germán Vidal.
    A Finite Representation of the Narrowing Space .
    In Revised Selected Papers of the 23rd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2013),
    Vol. 8901 of Lecture Notes in Computer Science, pp. 54-71, (2014年-12月).

  25. Karl Gmeiner, Naoki Nishida, and Bernhard Gramlich.
    Proving Confluence of Conditional Term Rewriting Systems via Unravelings.
    In Proceedings of the 2nd International Workshop on Confluence (IWC 2013),
    pp. 35-39 (2013年-6月).

  26. 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),
    Vol. 7844 of Lecture Notes in Computer Science, pp. 155-175 (2013年-4月).
    (Presented at LOPSTR 2012 as "Extending Matching Operation in Grammar Program for Program Inversion")

  27. Naoki Nishida and Germán Vidal.
    Computing More Specific Versions of Conditional Rewriting Systems.
    In Revised Selected Papers of the 22nd International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2012),
    Vol. 7844 of Lecture Notes in Computer Science, pp. 137-154 (2013年-4月).

  28. 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, (2012年-6月).

  29. Naoki Nishida and Germán Vidal.
    More Specific Term Rewriting Systems.
    In Proceedings of the 21st International Workshop on Functional and (Constraint) Logic Programming (WFLP 2012), 15 pages, (2012年-5月).

  30. Tsubasa Sakata, Naoki Nishida, and Toshiki Sakabe.
    On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs.
    In Proceedings of the 20th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2011),
    Vol. 6816 of Lecture Notes in Computer Science, pp. 138-155 (2011-7).
    [link]

  31. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe.
    Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity.
    In Proceedings of the 22nd International Conference on Rewriting Techniques and Applications (RTA 2011),
    Vol. 10 of LIPIcs, pp. 267-282 (2011-5).
    [link]

  32. Naoki Nishida and Germán Vidal.
    Program Inversion for Tail Recursive Functions.
    In Proceedings of the 22nd International Conference on Rewriting Techniques and Applications (RTA 2011),
    Vol. 10 of LIPIcs, pp. 283-298 (2011-5).
    [link]

  33. Naoki Nishida, Masahiko Sakai, and Tatsuya Hattori.
    On Disproving Termination of Constrained Term Rewriting Systems.
    In Proceedings of the 11th International Workshop on Termination (WST 2010),
    5 pages (2010-7).

  34. José Iborra, Naoki Nishida, and Germán Vidal.
    Goal-directed and Relative Dependency Pairs for Proving the Termination of Narrowing.
    In Danny De Schreye, editor, Postproceedings of the 19th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2009),
    Vol. 6037 of Lecture Notes in Computer Science, pp. 52-66, Springer (2010年-4月).

  35. Naoki Nishida and Masahiko Sakai.
    Proving Injectivity of Functions via Program Inversion in Term Rewriting.
    In Matthias Blume, Naoki Kobayashi, and Germán Vidal, editors, Proceedings of the 10th International Symposium on Functional and Logic Programming (FLOPS 2010),
    Vol. 6009 of Lecture Notes in Computer Science, pp. 288-303, Springer (2010年-4月).

  36. José Iborra, Naoki Nishida, and Germán Vidal.
    Improving the Termination Analysis of Narrowing in Left-Linear Constructor Systems.
    In Proceedings of the 19th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2009),
    9 pages, (2009年-9月).

  37. Naoki Nishida, Masahiko Sakai, and Terutoshi Kato.
    Convergent Term Rewriting Systems for Inverse Computation of Injective Functions.
    In Dieter Hofbauer and Alexander Serebrenik, editors, Proceedings of the 9th International Workshop on Termination (WST'07),
    pp. 77-81, (2007年-6月).
    (the full version is available from [pdf])

  38. Naoki Nishida and Koichi Miura.
    Dependency Graph Method for Proving Termination of Narrowing.
    In Alfons Geser and Harald Søndergaard, editors, Proceedings of the 8th International Workshop on Termination (WST'06),
    pp. 12-16, (2006年-8月).
    [pdf]

  39. 櫻井敬大, 草刈圭一朗, 西田直樹, 酒井正彦, 坂部俊樹.
    関数プログラムの再帰構造解析と強計算性に基づく十分完全性の証明法.
    第4回情報科学技術フォーラム (FIT2005) 論文集,
    情報科学技術レターズ, No. LA-001, pp. 1-4 (2005年-9月).
    [pdf]

  40. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe.
    Partial Inversion of Constructor Term Rewriting Systems.
    In Jürgen Giesl, editor, Proceedings of the 16th International Conference on Rewriting Techniques and Applications,
    Vol. 3467 of Lecture Notes in Computer Science, pp. 264-278. Springer (2005年-4月).
    [link][ps][pdf]

  41. Naoki Nishida, Masahiko Sakai, and Toshiki Sakabe.
    Generation of Inverse Term Rewriting Systems for Pure Treeless Functions.
    In Yoshihito Toyama, editor, Proceedings of the International Workshop on Rewriting in Proof and Computation (RPC'01),
    pp. 188-198, Sendai, Japan (2001年-10月).
    [ps][pdf]

その他(査読なし)

  1. 中林直生, 西田直樹, 草刈圭一朗, 坂部俊樹, 酒井正彦.
    制約付き項書換え系の書換え帰納法における補題等式の自動生成法.
    日本ソフトウェア科学会第26回大会講演論文集, 7B-2, pp.1-14 (2009年-9月).

  2. 西田直樹, 坂田翼, 酒井正彦, 草刈圭一朗, 坂部俊樹.
    制約付き項書換え系の定理自動証明における等式の方向付けのための簡約化順序.
    信学技報 SS2008-20, 電子情報通信学会, (2008-7月).
    Vol. 108, No. 173, pp. 43-48.

  3. 坂田翼, 西田直樹, 坂部俊樹, 酒井正彦, 草刈圭一朗.
    プレスブルガー文付き項書換え系における書換え帰納法について.
    信学技報 SS2008-1, 電子情報通信学会, (2008年-5月).
    Vol. 108, No. 64, pp. 1-6.

  4. 水野清貴, 西田直樹, 坂部俊樹, 酒井正彦, 草刈圭一朗.
    等式を規則化する変換の停止条件.
    信学技報 SS2007-61, 電子情報通信学会 (2008年-3月).
    Vol. 107, No. 505, pp. 25-30.

  5. 近藤悟, 酒井正彦, 坂部俊樹, 草刈圭一朗, 西田直樹.
    プログラム生成系GeneSysにおける等式仕様への否定の導入.
    信学技報 SS2007-45, 電子情報通信学会 (2007年-12月).
    Vol. 107, No. 392, pp. 43-48.

  6. 水谷知博, 西田直樹, 酒井正彦, 坂部俊樹, 草刈圭一朗.
    導出木からのループ検出による論理プログラムの非停止性証明法.
    信学技報 SS2007-30, 電子情報通信学会 (2007年-10月).
    Vol. 107, No. 275, pp. 1-6.

  7. 笹田悠司, 酒井正彦, 西田直樹, 坂部俊樹, 草刈圭一朗.
    振舞等価性の証明のための等式付き書換えに基づく潜在帰納法.
    信学技報 SS2007-17, 電子情報通信学会 (2007年-8月).
    Vol. 107, No. 176, pp. 7-12.

  8. 村田俊樹, 西田直樹, 酒井正彦, 坂部俊樹, 草刈圭一朗.
    左線形な定向条件付き項書換え系における到達可能な項集合の近似集合を認識する木オートマトン.
    信学技報 SS2007-16, 電子情報通信学会 (2007年-8月).
    Vol. 107, No. 176, pp. 1-6.

  9. 古市祐樹, 西田直樹, 酒井正彦, 草刈圭一朗, 坂部俊樹.
    手続き型プログラムから書換え系への変換に基づくソフトウェア検証の試み.
    信学技報 SS2006-41 (KBSE2006-17), 電子情報通信学会 (2006年-10月).
    Vol. 106, No. 324, pp. 7-12.
    [pdf]

  10. 三浦浩一, 西田直樹, 酒井正彦, 坂部俊樹, 草刈圭一朗.
    等式付き書換え系の等式数を削減する変換.
    信学技報 SS2006-14, 電子情報通信学会 (2006年-6月).
    Vol. 106, No. 120, pp. 7-12.
    [pdf]

  11. 西田直樹, 酒井正彦, 坂部俊樹.
    On Simulation-Completeness of Unraveling for Conditional Term Rewriting Systems.
    信学技報 SS2004-18, 電子情報通信学会, (2004-8月).
    Vol. 104, No. 243, pp. 25--30.
    [ps][pdf]

全ての論文リスト
酒井研 情報学研究科 工学部情報工学コース 工学研究科 名古屋大学
Produced by N.Nishida (nishida @ i.nagoya-u.ac.jp)