|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
MSS, SS |
2023-01-11 13:30 |
Osaka |
(Primary: On-site, Secondary: Online) |
A formal description of a functional language with exception handling, and constrained dependency pairs for the termination proofs Takeshi Hamaguchi, Masahiko Sakai (Nagoya Univ.) MSS2022-56 SS2022-41 |
This paper proposes a termination-proof method for functional programs with exception handling. First, we give a small s... [more] |
MSS2022-56 SS2022-41 pp.66-71 |
SS |
2019-03-05 15:25 |
Okinawa |
|
Automatic Repair of Conditional Expressions for Functional Programs by Using Counterexamples Ken Matsui, Ryosuke Sato, Naoyasu Ubayashi, Yasutaka Kamei (Kyushu Univ.) SS2018-80 |
In software development, manual bug fixing consumes much time and effort. Therefore, automated program repair methods ha... [more] |
SS2018-80 pp.169-174 |
MSS, SS |
2015-01-26 17:45 |
Tottori |
|
Implementing a Conditional Dependency Pair Method for Proving Termination of Functional Programs with Exception Handling Koichi Ota, Takeshi Hamaguchi, Masahiko Sakai (Nagoya Univ.), Akihisa Yamada (AIST), Naoki Nishida, Toshiki Sakabe (Nagoya Univ.) MSS2014-78 SS2014-42 |
In this paper, we discuss implementation of the conditional dependency pair method for proving termination of functional... [more] |
MSS2014-78 SS2014-42 pp.55-60 |
SS, KBSE |
2013-07-26 09:30 |
Hokkaido |
|
Conditional Dependency Pair Method for Proving Termination of Functional Programs with Exception Handling Takeshi Hamaguchi, Masahiko Sakai (Nagoya Univ.) SS2013-23 KBSE2013-23 |
We have recently proposed a method for proving termination/non-termination properties of eager-evaluation-based function... [more] |
SS2013-23 KBSE2013-23 pp.61-66 |
SS |
2005-06-24 10:45 |
Nagano |
Shinshu Univ. Ohta-Kokusai-Kinenkan |
On Proving Termination of Simply-Typed Term Rewriting Systems Based on Strong Computability Keiichirou Kusakari, Takahiro Sakurai, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe (Nagoya Univ.) |
Terminating functional programs are safe in execution, and valuable because their reduction relations are suitable for i... [more] |
SS2005-21 pp.19-24 |
|
|
|
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]
|