Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2011] | [2012] | [2013] | [2014] | [2015] | [2016] | [2017] | [Japanese] / [English]
MSS2014-69
Evaluation of clone extraction method with code shape
Kouki Kakiya, Kazuki Nakatani, MasayukiHirayama (Nihon Univ.), Nahomi Kikuchi (OKI)
pp. 1 - 6
MSS2014-70
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)
pp. 7 - 12
MSS2014-71
An empirical study on code clone detection using supercomputer techniques
Ataru Osaka, Yasutaka Kamei (Kyushu Univ), Keisuke Hotta (Osaka Univ), Naoyasu Ubayashi (Kyushu Univ)
pp. 13 - 18
MSS2014-72
Just-In-Time Defect Prediction Tool anko
Shutaro Tanaka, Takafumi Fukushima, Kazuhiro Yamashita, Yasutaka Kamei, Naoyasu Ubayashi (Kyushu Univ.)
pp. 19 - 24
MSS2014-73
Approximate Simulation Based Verification of Automation Surprises in Human-machine Systems
Daiki Ishii, Toshimitsu Ushio (Osaka Univ.)
pp. 25 - 29
MSS2014-74
Optimal Sampling for Kalman Filtering by Sensor Network Based on Energy Consumption and Information Entropy
Ken Imai, Toshimitsu Ushio (Osaka Univ.)
pp. 31 - 36
MSS2014-75
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)
pp. 37 - 41
MSS2014-76
On Efficacy of Narrowing in Proving Termination of Constrained Term Rewriting Systems
Tomoya Ueyama, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe (Nagoya Univ.)
pp. 43 - 48
MSS2014-77
A Consideration on How to Model Check Distributed Snapshot Reachability Property
Wenjie Zhang, Kazuhiro Ogata (JAIST), Min Zhang (ECNU)
pp. 49 - 54
MSS2014-78
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.)
pp. 55 - 60
MSS2014-79
An approach to Application of Inductive Logic Programming to Characterization of Reachable States
Dung Tuan Ho (JAIST), Min Zhang (ECNU), Kazuhiro Ogata (JAIST)
pp. 61 - 66
MSS2014-80
Statistical Model Checking of Hybrid Systems using Interval Analysis
Daisuke Ishii, Naoki Yonezaki (Titech)
pp. 67 - 71
MSS2014-81
Direct Update of XML Documents Compressed by Tree Grammars
Takeshi Goto (Nagoya Univ.), Takahiro Onoue (NAIST), Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.)
pp. 73 - 78
MSS2014-82
A supervisor synthesis by MaxSAT solvers under partial observation
Tatsuki Hirota, Shoji Yuen (Nagoya Univ), Tetsuya Tohdo (DENSO)
pp. 79 - 84
MSS2014-83
Extract Superclass Problem of Workow Nets and Refining the Solution
Sohma Nishi, Shingo Yamaguchi (Yamaguchi Univ.)
pp. 85 - 90
MSS2014-84
An approach based on implicit places to refactoring problem of workflow nets
Jia Zhang, Ichiro Toyoshima, Shingo Yamaguchi (Yamaguchi Univ.)
pp. 91 - 96
MSS2014-85
Considerations on a Statistical Reduct Method for the Decision Table
Yuichi Kato (Shimane Univ.), Tetsuro Saeki (Yamaguchi Univ.), Shoutaro Mizuno (Shimane Univ.)
pp. 97 - 102
MSS2014-86
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)
pp. 103 - 108
MSS2014-87
Towards the Development of a Formal Language for Frequency of Events
Osamu Takaki (Gunma Univ.)
pp. 109 - 114
MSS2014-88
On Conformance Checking of SOA-based Systems
Hiroyuki Oimura, Toshiyuki Miyamoto (Osaka Univ.)
pp. 115 - 120
MSS2014-89
A Source-Code Searching for a Dynamically-Typed Programming Language Based on Arbitrary-Granularity Function Model
Toshihiro Kamiya (Fun)
pp. 121 - 126
MSS2014-90
Toward to exploit interaction history in change guide method based on version history
Akihiro Yamamori (Titech), Anders Mikael Hagward (Titech/KTH), Takashi Kobayashi (Titech)
pp. 127 - 132
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.