| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2021-08-25 17:00 |
Online | Online | Proving A Theorem of two-player TANHINMIN via Coq Proof Assistant Katsuki Ohto (無所属)  COMP2021-12 |
(To be available after the conference date) [more] | COMP2021-12 pp.14-18 |
| DC, SS | 2019-10-24 14:55 |
Kumamoto | Kumamoto Univ. | Extending rewriting induction to existentially quantified equations Kazushi Nishie, Naoki Nishida, Masahiko sakai (Nagoya Univ.) SS2019-17 DC2019-45 |
In this paper, we extend rewriting induction which is developed to prove equations, to existentially quantified equation... [more] | SS2019-17 DC2019-45 pp.25-30 |
| MSS, NLP (Joint) |
2018-03-13 14:55 |
Osaka | Deductive Verification of real-time safety properties for embedded assembly program using theorem prover Princess Naoki Odajima (Kanazawa Univ.), Gakuhi Fukuda (Kanazawa Nishikigaoka), Satoshi Yamane (Kanazawa Univ.) MSS2017-84 |
It is important to verify both the correctness and real-time properties for embedded systems. In this paper, we propos... [more] |
MSS2017-84 pp.35-40 |
|
| KBSE | 2018-01-25 14:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A Code Completion Method Using Automated Theorem Proving Ryohei Koike (Waseda Univ.), Kouichi Ono (IBM Japan), Yoshiaki Fukazawa (Waseda Univ.) KBSE2017-33 |
Code completion is one of the techniques for making software development efficient. Code completion can complete the mis... [more] | KBSE2017-33 pp.7-11 |
| SS | 2017-03-09 11:50 |
Okinawa | Equivalence Checking for Methods in Java and Its Applications Kozo Okano (Shinshu Univ.), Satoshi Harauchi (Mitsubishi Electric Corp.), Shinpei Ogata (Shinshu Univ.), Toshifusa Sekizawa (Nihon Univ.), Takeshi Obara (Shinshu Univ.) SS2016-65 |
A programmer sometimes implements both of equals method and hashCode method in a class of Java. The programmer should ob... [more] | SS2016-65 pp.31-36 |
|
| QIT (2nd) |
2015-05-25 13:20 |
Osaka | Osaka University | [Poster Presentation]
Formal Verification of Robertson-type Uncertainty Relation Takaaki Masuhara, Toru Kuriyama, Masakazu Yoshida, Jun Cheng (Doshisha Univ.) |
Formal verification using interactive theorem provers have been noticed as a method of verification of proofs that are t... [more] | |
| SS | 2010-03-08 11:40 |
Kagoshima | Kagoshima Univ. | On a Combination Method of Decision Procedures for Theories Sharing Common Symbols Koji Iwanuma (Univ. of Yamanashi) SS2009-67 |
The Nelson-Oppen method is a well-known general framework for combining decision procedures into a single decision proce... [more] | SS2009-67 pp.115-120 |
| CPSY, VLD, IPSJ-SLDM | 2005-01-25 15:50 |
Kanagawa | Solving SAT problem by PCMGTP on FPGA Shohei Kinoshita, Junichi Matsuda, Hiroshi Fujita, Miyuki Koshimura, Ryuzo Hasegawa (Kyushu Univ) |
In this paper, a new design of the SAT solver PCMGTP implemented on an FPGA chip is described. Although the previous imp... [more] | VLD2004-107 CPSY2004-73 pp.57-62 |
|
| AI | 2004-06-21 14:35 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Preprocessing Clause Sets by Abstract Model Generation Mayumi Umeda, Miyuki Koshimura, Ryuzo Hasegawa (Kyushu Univ.) |
Abstract model generation is model generation for abstract clause sets in which arguments of atoms are ignored. We give ... [more] | AI2004-7 pp.33-38 |
[Return to Top Page]