| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Software Science (SS) (Searched in: 2017)
Search Results: Keywords 'from:2017-10-19 to:2017-10-19'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| SS, DC | 2017-10-19 13:15 |
Kochi | Kochi City Culture-plaza CUL-PORT | Towards a lambda-graph rewriting to analyze modification impacts and identify behaviors of dynamically typed procedural languages Koji Yamamoto (Fujitsu Labs.)  SS2017-21 DC2017-20 |
Static code analysis, in contrast to dynamic analysis, offers results with higher code coverage to locate differences of... [more] | SS2017-21 DC2017-20 pp.1-6 |
| SS, DC | 2017-10-19 13:45 |
Kochi | Kochi City Culture-plaza CUL-PORT | A Direct Update Method for Compressed Data with Top Tree Suguru Nishimura, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) SS2017-22 DC2017-21 |
This paper proposes a direct update method for a data compressed with top tree. For a given compressed data (top DAG) an... [more] | SS2017-22 DC2017-21 pp.7-12 |
| SS, DC | 2017-10-19 14:15 |
Kochi | Kochi City Culture-plaza CUL-PORT | A Transformation Method of XQuery Expressions for Evaluation on Compressed XML Documents Jukiya Ogura, Yasunori Ishihara, Toru Fujiwara (Osaka Univ.) SS2017-23 DC2017-22 |
While XML documents can easily express data structure, there is a disadvantage that the document size becomes large. For... [more] | SS2017-23 DC2017-22 pp.13-18 |
| SS, DC | 2017-10-19 14:45 |
Kochi | Kochi City Culture-plaza CUL-PORT | Towards a behavioral model of Yampa programs in a discrete runtime environment Tomoki Ichihashi, Shouji Yuuen (Nagoya Univ.) SS2017-24 DC2017-23 |
We propse an operational model for discrete executions of Yampa programs whose behavior are defined in the dense time. Y... [more] | SS2017-24 DC2017-23 pp.19-24 |
| SS, DC | 2017-10-19 15:25 |
Kochi | Kochi City Culture-plaza CUL-PORT | Making of Code Clone Elimination Problem Function for Java Programming Learning Assistant System Nobuya Ishihara, Nobuo Funabiki, Minoru Kuribayashi (Okayama Univ.) SS2017-25 DC2017-24 |
To let students study the object-oriented programming of writing program codes without redundancy, we have proposed the ... [more] | SS2017-25 DC2017-24 pp.25-30 |
| SS, DC | 2017-10-19 15:55 |
Kochi | Kochi City Culture-plaza CUL-PORT | An Informative Test Code Approach for Code Writing Problem in Java Programming Learning Assistant System Khin Khin Zaw, Nobuo Funabiki (Okayama Univ.) SS2017-26 DC2017-25 |
To assist Java programming educations, we have developed a Web-based Java Programming Learning Assistant System (JPLAS),... [more] | SS2017-26 DC2017-25 pp.31-36 |
| SS, DC | 2017-10-19 16:35 |
Kochi | Kochi City Culture-plaza CUL-PORT | SS2017-27 DC2017-26 |
We present FGyama, a novel dataflow graph representation for extracting high-level semantics from source code. FGyama is... [more] | SS2017-27 DC2017-26 pp.37-42 |
| SS, DC | 2017-10-19 17:05 |
Kochi | Kochi City Culture-plaza CUL-PORT | SS2017-28 DC2017-27 |
[more] | SS2017-28 DC2017-27 pp.43-48 |
| SS, DC | 2017-10-19 17:35 |
Kochi | Kochi City Culture-plaza CUL-PORT | An Empirical Study of Correction Candidates in a Requirements Specification Document for an Embbeded System Ryota Yamamoto, Norihiro Yoshida, Hiroaki Takada (Nagoya Univ.) SS2017-29 DC2017-28 |
Software developers tend to write incorrect/ambiguous expressions in a document. Incorrect/ambiguous expressions often c... [more] | SS2017-29 DC2017-28 pp.49-54 |
| SS, DC | 2017-10-20 09:30 |
Kochi | Kochi City Culture-plaza CUL-PORT | On the generation of constrained locating arrays using an SMT solver Hao Jin (Osaka Univ.), Eun-Hye Choi (AIST), Tatsuhiro Tsuchiya (Osaka Univ.) SS2017-30 DC2017-29 |
Combinatorial interaction testing (CIT) is a well-known testing strategy for software systems. We inves- tigate a new C... [more] |
SS2017-30 DC2017-29 pp.55-60 |
| SS, DC | 2017-10-20 10:00 |
Kochi | Kochi City Culture-plaza CUL-PORT | Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks Michiko Inoue, Fukuhito Ooshita (NAIST), Sebastien Tixeuil (UPMC) SS2017-31 DC2017-30 |
We present a new self-stabilizing 1-maximal matching algorithm that works under the distributed unfair daemon for arbitr... [more] | SS2017-31 DC2017-30 pp.61-66 |
| SS, DC | 2017-10-20 10:30 |
Kochi | Kochi City Culture-plaza CUL-PORT | Wormhole Attacks on Duty-Cycling Wireless Sensor Networks and Their Countermeasures Wang Wen Yang, Takashi Minohara (Takushoku Univ.) SS2017-32 DC2017-31 |
Wireless sensor networks(WSN) which employ a large number of wireless sensor nodes to monitor physical or environmenta... [more] |
SS2017-32 DC2017-31 pp.67-72 |
| SS, DC | 2017-10-20 11:00 |
Kochi | Kochi City Culture-plaza CUL-PORT | Generating Top-k List by Using Delay Tolerant Networks and Crowdsourcing Shouhei Karaguchi, Kazuya Sakai, Satoshi Fukumoto (Tokyo Metropolitan Univ.) SS2017-33 DC2017-32 |
In this paper, we propose an algorithm that obtains a top-k list of items out of a large itemset in delay tolerant netwo... [more] | SS2017-33 DC2017-32 pp.73-76 |
[Return to Top Page]