Thu, Jun 23 PM 13:00 - 17:00 |
(1) |
13:00-13:30 |
Modeling Software Characteristics and Their Correlations in A Specific Domain by Comparing Existing Similar Systems |
Akira Osada, Daigo Ozawa, Haruhiko Kaiya, Kenji Kaijiri (Shinshu Univ.) |
(2) |
13:30-14:00 |
Software Technology Recommendation Based on Collaborative Filtering |
Tomohiro Akinaga, Naoki Ohsugi, Takeshi Kakimoto, Masateru Tsunoda, Akito Monden, Ken-ichi Matsumoto (NAIST) |
|
14:00-14:15 |
Break ( 15 min. ) |
(3) |
14:15-14:45 |
A Verification Method of Invalid Cells of State Transition Matrices |
Michihiro Matsumoto, Naohito Yamashita (Fukuoka IST), Ikuko Suzuki (Sharp), Akira Fukuda (Kyushu Univ.) |
(4) |
14:45-15:15 |
Analysis of Review Process using Programmers' Eye Movement |
Hidetake Uwano, Noboru Nakamichi, Hiroshi Igaki, Akito Monden, Masahide Nakamura, Ken-ichi Matsumoto (NAIST) |
(5) |
15:15-15:45 |
An extended regular expression matching System which can dynamically define operations |
Yoshifumi Okada, Hiroaki Yamamoto (Shinshu Univ.) |
|
15:45-16:00 |
Break ( 15 min. ) |
(6) |
16:00-17:00 |
[Invited Talk]
Self-proliferate software product diagnosis system |
Kenji Kaijiri (Shinshu Univ.) |
Fri, Jun 24 AM 09:00 - 12:15 |
(7) |
09:00-09:30 |
A Static Analysis using Tree Automata for XML Access Control |
Isao Yagi, Yoshiaki Takata, Hiroyuki Seki (NAIST) |
(8) |
09:30-10:00 |
A Study on Software Design Using Ontology Technologies |
Hiroshi Yoshida, Takashi Inoue, Yasumi Matsuyuki, Tetsuya Yamamura (NTT) |
(9) |
10:00-10:30 |
A Formal Model for Stateful Trust Management Systems |
Hisashi Mouri, Yoshiaki Takata, Hiroyuki Seki (NAIST) |
|
10:30-10:45 |
Break ( 15 min. ) |
(10) |
10:45-11:15 |
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.) |
(11) |
11:15-11:45 |
Programming Method in Obfuscated Language Malbolge |
Hisashi Iizawa, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari, Naoki Nishida (Nagoya Univ.) |
(12) |
11:45-12:15 |
Dependency Graph Method for Proving Termination of Narrowing |
Koichi Miura, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari, Toshiki Sakabe (Nagoya Univ.) |