外山研輪講 紹介論文一覧 (2012年度)

• 1月30日(水) 紹介者: 四方駿作
  S. Vágvölgyi,
  Rewriting preserving recognizability of finite tree languages,
  The Journal of Logic and Algebraic Programming, Volume 82 Issue 2, pp. 71-94, 2013.
• 1月22日(火) 紹介者: 内田和真
  J. Jouannaud, J. Liu,
  From diagrammatic confluence to modularity,
  Theoretical Computer Science, Vol. 464, pp. 20-34, 2012.
• 12月19日(水) 紹介者: 鈴木貴樹
  C. Urban, A. M. Pitts, M. J. Gabbay,
  Nominal unification,
  Theoretical Computer Science, Vol. 323, pp. 473-497, 2004.
• 12月5日(水) 紹介者: 佐藤洸一
  J. Giesl,
  Context-moving transformations for function verification,
  In Proceedings of Logic-Based Program Synthesis and Transformation (LOPSTR 1999), Lecture Note in Computer Science, Vol. 1817, pp. 293-312, 2000.
• 11月28日(水) 紹介者: 椛澤涼
  P. Rety, J. Vuotto,
  Tree automata for rewrite strategies,
  Journal of Symbolic Computation 40, pp. 749-794, 2005.
• 11月14日(水) 紹介者: 高橋翔大
  T. Takai, Y. Kaji, H. Seki,
  Right-linear finite path overlapping rewrite systems effectively preserve recognizability,
  Sienticae Mathematicae japonicae, vol. 72, No. 2, pp. 127-153, 2010.
• 10月17日(水) 紹介者: 中嶋辰成
  S. Falke, D. Kapur,
  Rewriting Induction + Linear Arithmetic = Decision Procedure,
  Proceedings of the 6th International joint conference on Automated Reasoning (IJCAR'12), LNAI 7364, pp. 241-255, 2012.
• 9月19日(水) 紹介者: 四方駿作
  B. Felgenhauer,
  Deciding Confluence of Ground Term Rewrite Systems in Cubic Time,
  Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12), LIPIcs 15, pp. 165-175, 2012.
• 9月12日(水) 紹介者: 内田和真
  D. Klein, N. Hirokawa,
  Confluence of Non-Left-Linear TRSs via Relative Termination,
  LNCS 7180, pp. 258-273, 2012.
• 7月25日(水) 紹介者: 椛澤涼
  M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison,
  Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems,
  Information and Computation 88, pp. 187-201, 1990.
• 7月18日(水) 紹介者: 高橋翔大
  Y. Kojima, M. Sakai, N. Nishida, K. Kusakari,T. 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月11日(水) 紹介者: 中嶋辰成
  D. Kapur, M. Subramaniam,
  Extending Decision Procedure with Induction Schemes,
  Proceedings of the 17th International Conference on Automated Deduction(CADE '00), LNAI 2896, pp. 125-145, 2000.
• 6月20日(水) 紹介者: 内田和真
  E. Payet,
  Loop detection in term rewriting using the eliminating unfoldings,
  Theoretical Computer Science 403, pp. 307-327, 2008.
• 6月13日(水) 紹介者: 四方駿作
  A. Gascon, G. Godoy, F. Jacquemard,
  Closure of Tree Automata Languages under Innermost Rewriting.
  Laboratoire Specification et Verification, Research Report number 08-31, 2008.
• 6月6日(水) 紹介者: 高橋翔大
  I. Durand, G. Snizergues,
  Bottom-Up rewriteing is Inverse Recognizability Preserving,
  Proceedings of the 18th International Conference on Rewriting Techniques and Applications (RTA 2007), LNCS 4533, pp. 107-121, 2007.
• 5月9日(水) 紹介者: 椛澤涼
  K. Matsuda, K. Inaba, and K. Nakano,
  Polynomial-Time Inverse Computation for Accumulative Functions with Multiple Data Traversals,
  PEPM 2012: ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation, pp. 5-14, 2012.
• 4月25日(水) 紹介者: 中嶋辰成
  S. Falke, D. Kapur,
  Inductive Decidability Using Implicit Induction,
  Lecture Notes in Artificial Intelligence, vol. 4246, pp. 45-59, 2006.
• 4月18日(水) 紹介者: 高橋翔大
  I. Durand, M. Sylvestre,
  Left-linear Bounded TRSs are Inverse Recognizability Preserving,
  Leibniz International Proceedings in Informatics, Vol. 10, pp. 361-376, 2011.

webmaster