Latest Volume/Issue

Volume And Issue List
Computer Software
- Vol.33(2016)
- Vol.32(2015)
- Vol.31(2014)
- Vol.30(2013)
- Vol.29(2012)
- Vol.28(2011)
- Vol.27(2010)
- Vol.26(2009)
- Vol.25(2008)
- Vol.24(2007)
- Vol.23(2006)
- Vol.22(2005)
- Vol.21(2004)
- Vol.20(2003)
- Vol.19(2002)
- Vol.18(2001)
- Vol.18-0(2000)
- Vol.17(2000)

Computer Software Vol. 33(2016) No. 3

[title in Japanese]

Shigeru CHIBA

Released: September 25, 2016

p.3_1

Full Text PDF[112K]

Introduction to the Special Issue on Network Technologies

Osamu AKASHI, Michiko IZUMI, Eiji KAWAI, Yuusuke KAWAKITA

Released: September 25, 2016

p.3_2

Full Text PDF[113K]

Prototype Implementations and Evaluation Techniques for Information-Centric Networking

Hitoshi ASAEDA, Kazuhisa MATSUZONO

Released: September 25, 2016

p.3_3-3_15

Information- (or Content-) Centric Networking (ICN/CCN) uses “content name” as the communication identifier and enables users to obtain content from caching routers in the network. This future Internet technology provides content for users rapidly and effectively. In this paper, we present the concept and characteristics of ICN/CCN and introduce the prototype implementations as well as the evaluation techniques such as simulator, emulator, and testbed. We then discuss the research direction toward the ICN/CCN deployment.

Detecting Malicious Domains with Probabilistic Threat Propagation on DNS Graph

Yuta KAZATO, Kensuke FUKUDA, Toshiharu SUGAWARA

Released: September 25, 2016

p.3_16-3_28

This paper proposes a method to estimate malicious domain names from a large scale DNS query response dataset. The key idea of the work is to leverage the use of DNS graph that is a bipartite graph consisting of domain names and corresponding IP addresses. We apply a concept of Probabilistic Threat Propagation (PTP) on the graph with a set of predefined benign and malicious node to a DNS graph obtained from DNS queries at a backbone link. The performance of our proposed method (EPTP) outperformed that of an original PTP method (9% improved) and that of a traditional method using N-gram (40% improved) in an ROC analysis. We finally estimated 2,170 of new malicious domain names with EPTP.

Multipathing in Commodity-based Data Center Networks with IP Tunneling

Ryo NAKAMURA, Tomohiro ISHIHARA, Yuji SEKIYA, Hiroshi ESAKI

Released: September 25, 2016

p.3_29-3_43

Improving availability and throughput is a significant challenge for data center networks. Recent studies have attempted to use a variety of routing and multipathing techniques. However, no method has yet managed to combine availability and throughput improvement with actual deployability, usually because of dedicated hardware requirements. In addition, recent approaches lack availability for topology changes because of requiring pre-configured topology. In this study, we propose a method to construct efficient commodity-based random graph topology network by using an IP tunneling technique. The proposed method only requires minimal modification for software network stack on end hosts. In addition, we designed and implemented a control plane system for proposed method using OSPF. Moreover, the evaluation shows that our proposed method enables throughput improvement of a network and high availability with commodity hardware switches.

Recent Advances on Data Infrastructure Systems

Hideyuki KAWASHIMA

Released: September 25, 2016

p.3_44-3_49

A data infrastructure system is composed by two sub systems. They are an SQL query processing system and a transaction processing system. A conventional database management system (DBMS) involves both of them, while recent activities focus to improve each subsystem for high efficiency. This paper explains recent advances on them.

Open Source Software at Enterprise in Practice

Yoshihide NOMURA, Kosaku KIMURA, Masahiro FUKUYORI, Hideo TANIDA

Released: September 25, 2016

p.3_50-3_65

Open source software (OSS) becomes essential for not only individual developers and academia, but also enterprises. Enterprises can benefit from using OSS for developing software products. However, using OSS in enterprises has a lot of problems regarding quality assurance, license compliance, version mismatch, and so on. In this paper, we introduce several case studies of software developments using OSS in Fujitsu and Fujitsu Laboratories. Furthermore, we discuss benefits and problems for using OSS in enterprises and describe expectations for the future on the OSS engineering.

Toward Japanese Writing System through Technology

Tatsuo KOBAYASHI

Released: September 25, 2016

p.3_66-3_71

Full Text PDF[399K]

Reordering Results of Keyword-based Code Search Tool by Code Clone and Logical Coupling

Yusuke SABI, Hiroaki MURAKAMI, Yoshiki HIGO, Shinji KUSUMOTO

Released: September 25, 2016

p.3_74-3_80

Programmers often use keyword-based code search tools to find code fragments to be changed simultaneously. However, there are many code fragments not to be changed in search results. Such code fragments cause programmers making mistakes. In order to prevent programmers from making mistakes, we investigated reordered results of a keyword-based code search tool using code clones and logical couplings. We have applied the two reordering approaches to three software systems in a company. As a result, we confirmed that code fragments required changes were reordered to the higher rank in the case of using code clones. However, code fragments required changes were occasionally not reordered to the higher rank in the case of using logical couplings.

A Study on the Number of Graftable Bugs in Automated Program Repair

Soichi SUMI, Yoshiki HIGO, Keisuke HOTTA, Shinji KUSUMOTO

Released: September 25, 2016

p.3_81-3_87

In recent years, automated program repair by reusing existing source code is attracting much attention. In insert operation of the automated program repair, a source code line is selected from existing source code and it is inserted to a faulty code region. However, only a limited number of bugs can be fixed by reusing code lines that exist in the source code. In this research, we propose two approaches to fix more bugs by the automated program repair. The first approach is reusing code lines from a large dataset of source code. The second approach is normalizing variable names. In this paper, we examine how much bugs can be fixed by the automated program repair. To evaluate the approaches, we examine a ratio of code lines reusable from existing source code to all inserted code lines in bug fix commits. The investigation results on 5 software repositories showed that the first and second approaches increased the ratio to 43–59% and 56–64% from 37–54%, respectively. In the case where we used both the approaches, the ratio increased to 64–69%.

[title in Japanese]

Shinpei KATO

Released: September 25, 2016

p.3_88-3_89

Full Text PDF[728K]

Decision Method of Reachability based on Rewrite Rule Overlapping

Kentaro SHIMANUKI, Takahito AOTO, Yoshihito TOYAMA

Released: August 10, 2016

p.3_93-3_107

Tree automata completion is a popular method for reachability analysis over term rewriting systems, which has many applications such as confluence analysis and normalizing strategy analysis. The point of this method is to ensure termination of the completion procedure, and it is known that the completion procedure terminates for the classes of growing term rewriting systems and finite path overlapping term rewriting systems. In this paper, we propose a new class of term rewriting systems, named non-left-right-overlapping term rewriting systems, which is incompatible with the classes of growing systems and finite path overlapping systems. Analyzing the overlapping relation between the left-hand side and the right-hand side of the rewrite rules, we give a sufficient condition for termination of the tree automata completion procedure for non-left-right-overlapping term rewriting systems. The reachability problem is decidable for the class of term rewriting systems satisfying this sufficient condition.

A Linear-Time Self-Interpreter of a Reversible Imperative Language

Robert GLÜCK, Tetsuo YOKOYAMA

Released: August 10, 2016

p.3_108-3_128

A linear-time reversible self-interpreter in an r-Turing complete reversible imperative language is presented. The proposed imperative language has reversible structured control flow operators and symbolic tree-structured data (S-expressions). The latter data structures are dynamically allocated and enable reversible simulation of programs of arbitrary size and space consumption. As self-interpreters are used to show a number of fundamental properties in classic computability and complexity theory, the present study of an efficient reversible self-interpreter is intended as a basis for future work on reversible computability and complexity theory as well as programming language theory for reversible computing. Although the proposed reversible interpreter consumes superlinear space, the restriction of the number of variables in the source language leads to linear-time reversible simulation.

1 - 13 / 13 Articles.

Top of this Page

System Maintenance

J-STAGE will undergo scheduled maintenance as follows.
Year 2016
Oct 29(Sat) 10:00 - 15:00(JST)
(Oct 29(Sat) 01:00 - 06:00(UTC))

Details

Announcement From J-STAGE

May 18, 2016
We have released “J-STAGE BETA site”.

May 01, 2015
Please note the "spoofing mail" that pretends to be J-STAGE.

Back Issues

Volume And Issue List
Computer Software

Computer Software Vol. 33(2016) No. 3

[title in Japanese]

Introduction to the Special Issue on Network Technologies

Prototype Implementations and Evaluation Techniques for Information-Centric Networking

Detecting Malicious Domains with Probabilistic Threat Propagation on DNS Graph

Multipathing in Commodity-based Data Center Networks with IP Tunneling

Recent Advances on Data Infrastructure Systems

Open Source Software at Enterprise in Practice

Toward Japanese Writing System through Technology

Reordering Results of Keyword-based Code Search Tool by Code Clone and Logical Coupling

A Study on the Number of Graftable Bugs in Automated Program Repair

[title in Japanese]

Decision Method of Reachability based on Rewrite Rule Overlapping

A Linear-Time Self-Interpreter of a Reversible Imperative Language

System Maintenance

Announcement From J-STAGE

Journal Tools

Share this Title

Volume And Issue List Computer Software

Computer Software Vol. 33(2016) No. 3

System Maintenance

Announcement From J-STAGE

Journal Tools

Share this Title

Volume And Issue List
Computer Software