Mon, Jan 26 PM
13:30 - 18:35 |
| (1) |
13:30-13:55 |
Evaluation of clone extraction method with code shape |
Kouki Kakiya, Kazuki Nakatani, MasayukiHirayama (Nihon Univ.), Nahomi Kikuchi (OKI) |
| (2) |
13:55-14:20 |
Applying Code Clone Analysis Techniques to Derivation Software |
Yoshiki Higo, Keisuke Hotta, Hiroaki Murakami, Shinji Kusumoto (Osaka Univ.), Nobuhiro Nakamura (SEI), Takanori Katou, Yukinari Muta, Kenji Nishikawa (SIS) |
| (3) |
14:20-14:45 |
An empirical study on code clone detection using supercomputer techniques |
Ataru Osaka, Yasutaka Kamei (Kyushu Univ), Keisuke Hotta (Osaka Univ), Naoyasu Ubayashi (Kyushu Univ) |
| (4) |
14:45-15:10 |
Just-In-Time Defect Prediction Tool anko |
Shutaro Tanaka, Takafumi Fukushima, Kazuhiro Yamashita, Yasutaka Kamei, Naoyasu Ubayashi (Kyushu Univ.) |
| |
15:10-15:25 |
Break ( 15 min. ) |
| (5) |
15:25-15:50 |
Approximate Simulation Based Verification of Automation Surprises in Human-machine Systems |
Daiki Ishii, Toshimitsu Ushio (Osaka Univ.) |
| (6) |
15:50-16:15 |
Optimal Sampling for Kalman Filtering by Sensor Network Based on Energy Consumption and Information Entropy |
Ken Imai, Toshimitsu Ushio (Osaka Univ.) |
| (7) |
16:15-16:40 |
A Two Phase Scheme for De Novo Genome Assembly based on de Bruijn Graphs for Multiple Short Read Sets |
Takuto Shigenobu, Morikazu Nakamura (Univ. of the Ryukyus) |
| |
16:40-16:55 |
Break ( 15 min. ) |
| (8) |
16:55-17:20 |
On Efficacy of Narrowing in Proving Termination of Constrained Term Rewriting Systems |
Tomoya Ueyama, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe (Nagoya Univ.) |
| (9) |
17:20-17:45 |
A Consideration on How to Model Check Distributed Snapshot Reachability Property |
Wenjie Zhang, Kazuhiro Ogata (JAIST), Min Zhang (ECNU) |
| (10) |
17:45-18:10 |
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.) |
| (11) |
18:10-18:35 |
An approach to Application of Inductive Logic Programming to Characterization of Reachable States |
Dung Tuan Ho (JAIST), Min Zhang (ECNU), Kazuhiro Ogata (JAIST) |
Tue, Jan 27 AM
08:30 - 15:30 |
| (12) |
08:30-08:55 |
Statistical Model Checking of Hybrid Systems using Interval Analysis |
Daisuke Ishii, Naoki Yonezaki (Titech) |
| (13) |
08:55-09:20 |
Direct Update of XML Documents Compressed by Tree Grammars |
Takeshi Goto (Nagoya Univ.), Takahiro Onoue (NAIST), Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) |
| (14) |
09:20-09:45 |
A supervisor synthesis by MaxSAT solvers under partial observation |
Tatsuki Hirota, Shoji Yuen (Nagoya Univ), Tetsuya Tohdo (DENSO) |
| |
09:45-10:00 |
Break ( 15 min. ) |
| (15) |
10:00-10:25 |
Extract Superclass Problem of Workow Nets and Refining the Solution |
Sohma Nishi, Shingo Yamaguchi (Yamaguchi Univ.) |
| (16) |
10:25-10:50 |
An approach based on implicit places to refactoring problem of workflow nets |
Jia Zhang, Ichiro Toyoshima, Shingo Yamaguchi (Yamaguchi Univ.) |
| (17) |
10:50-11:15 |
Considerations on a Statistical Reduct Method for the Decision Table |
Yuichi Kato (Shimane Univ.), Tetsuro Saeki (Yamaguchi Univ.), Shoutaro Mizuno (Shimane Univ.) |
| |
11:15-12:30 |
Lunch ( 75 min. ) |
| (18) |
12:30-12:55 |
Discussion of a Tool for Supporting Pull Request Driven Software Development |
Yusuke Saito, Kenji Fujiwara (NAIST), Hiroshi Igaki (Osaka Univ.), Norihiro Yoshida (Nagoya Univ.), Hajimu Iida (NAIST) |
| (19) |
12:55-13:20 |
Towards Security Analysis based on Traceability |
Hirokazu Yatsu (Kyushu Univ.), Masaru Matsunami (SDNA), Toshimi Sawada (Thinker's craft house), Takahiro Ando, Kenji Hisazumi (Kyushu Univ.), Kong Weiqiang (DLUT), Akira Fukuda (Kyushu Univ.) |
| |
13:20-13:35 |
Break ( 15 min. ) |
| (20) |
13:35-14:00 |
Towards the Development of a Formal Language for Frequency of Events |
Osamu Takaki (Gunma Univ.) |
| (21) |
14:00-14:25 |
On Conformance Checking of SOA-based Systems |
Hiroyuki Oimura, Toshiyuki Miyamoto (Osaka Univ.) |
| |
14:25-14:40 |
Break ( 15 min. ) |
| (22) |
14:40-15:05 |
A Source-Code Searching for a Dynamically-Typed Programming Language Based on Arbitrary-Granularity Function Model |
Toshihiro Kamiya (Fun) |
| (23) |
15:05-15:30 |
Toward to exploit interaction history in change guide method based on version history |
Akihiro Yamamori (Titech), Anders Mikael Hagward (Titech/KTH), Takashi Kobayashi (Titech) |
: t
ba
s