IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 7 of 7  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
SS, MSS 2012-01-26
16:00		 Kochi Kochi City Culture-Plaza Cul-Port On Usable Rules under Argument Filterings in Higher-Order Rewrite Systems
Kazuhiro Ooi, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida (Nagoya Univ.) MSS2011-64 SS2011-49		 The static dependency pair method is known as a powerful method for proving termination of higher-order rewrite systems ... [more] MSS2011-64 SS2011-49
pp.57-62
SS 2010-08-05
16:00		 Hokkaido Asahikawa Shimin-Bunka-Kaikan (Civic Culture Hall) Argument Filterings and Usable Rules in Higher-Order Rewrite Systems
Sho Suzuki, Keiichirou Kusakari (Nagoya Univ.), Frederic Blanqui (INRIA) SS2010-24		 The static dependency pair method is a method for proving the termination
of higher-order rewrite systems {\em \`a la} ... [more]		 SS2010-24
pp.47-52
SS 2009-12-17
15:50		 Kagawa Kagawa Univ. Argument Filtering and Usable Rules in Higher-Order Rewrite Systems
Sho Suzuki, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, Naoki Nishida (Nagoya Univ.) SS2009-39		 Simply-typed term rewriting systems (STRSs) and higher-order rewrite systems (HRSs)
have been proposed to extend term r... [more]		 SS2009-39
pp.25-30
SS 2008-07-31
17:30		 Hokkaido Future University-Hakodate A Reduction Order for Orienting Equations in Theorem Proving of Constrained TRSs
Naoki Nishida, Tsubasa Sakata, Masahiko Sakai, Keiichirou Kusakari, Toshiki Sakabe (Nagoya Univ.) SS2008-20		 In automated theorem proving, we often face cases where the procedure
keeps running. To avoid such cases, the theorem p... [more]		 SS2008-20
pp.43-48
SS 2008-03-03
13:05		 Nagasaki Nagasaki Univ. Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques
Keiichirou Kusakari, Masahiko Sakai (Nagoya Univ.) SS2007-61		 We proposed a static dependency pair method,
which can effectively prove termination of functional programs.
Since the... [more]		 SS2007-61
pp.25-30
SS 2007-06-22
10:10		 Ishikawa JAIST Argument Filtering Method on Second-Order Rewriting System
Yasuo Isogai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida (Nagoya Univ.) SS2007-13		 Higher-order rewrite systems are computation models of functional programming languages, and the termination property is... [more] SS2007-13
pp.23-28
SS 2005-06-24
11:45		 Nagano Shinshu Univ. Ohta-Kokusai-Kinenkan Dependency Graph Method for Proving Termination of Narrowing
Koichi Miura, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari, Toshiki Sakabe (Nagoya Univ.) 		Term rewriting systems with extra variables (called EV-TRSs) has an ability to represent inverse-computation programs, a... [more] SS2005-23
pp.31-36
 Results 1 - 7 of 7  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan