-
Tetsuo TAMAI, Taiichi YUASA, Ken SATOH, Shin NAKAJIMA
2006 Volume 23 Issue 2 Pages
2_1-2_3
Published: 2006
Released on J-STAGE: June 30, 2006
JOURNAL
FREE ACCESS
-
Hidehiko MASUHARA
2006 Volume 23 Issue 2 Pages
2_4-2_28
Published: 2006
Released on J-STAGE: June 30, 2006
JOURNAL
FREE ACCESS
Aspect-oriented programming (AOP) is an emerging programming paradigm for modularizing crosscutting concerns. This tutorial introduces basic concepts of AOP and its novel language constructs such as the pointcut and advice, and the inter-type declarations. The tutorial also overviews research and development trends in AOP, mainly on language designs, implementation techniques, support for software development, theoretical foundations, and empirical studies.
View full abstract
-
Akihiro YAMAMOTO
2006 Volume 23 Issue 2 Pages
2_29-2_44
Published: 2006
Released on J-STAGE: June 30, 2006
JOURNAL
FREE ACCESS
Inductive Logic Programming (ILP, for short) is machine learning using logic programs and is useful for knowledge discovery from structured data. In this survey we explain foundations of ILP, based on computational learning theory and comparing it with parameter estimation in statistics. In particular we explain details of refinement operations which are defined with deductive inference rules, with showing their role in machine learning procedures. We also introduce some recent topics in ILP research.
View full abstract
-
Masayuki INABA, Kei OKADA, Ikuo MIZUUCHI, Tetsunari INAMURA
2006 Volume 23 Issue 2 Pages
2_45-2_61
Published: 2006
Released on J-STAGE: June 30, 2006
JOURNAL
FREE ACCESS
A robot is a programming system on perception and action on a robot body working in the real world. Recent robotics research has progressed on humanoid robot that has human-like figure. This paper introduces the research on the programming system for humanoids that have evolved from tiny to life-size and musculoskeltal humanoids through inheriting the software developing environment in the object-oriented Euslisp that is designed for extensible and useful system programming.
View full abstract
-
Toshihiro MATSUI
2006 Volume 23 Issue 2 Pages
2_62-2_71
Published: 2006
Released on J-STAGE: June 30, 2006
JOURNAL
FREE ACCESS
This paper presents the concept and implementation of EusLisp developed for describing 3D geometric models on which environment recognition functions and intelligent task planning are performed. Based on an idea that object-orientation is best suited for intelligent robot programming, object oriented functions are implmented at the basis and Lisp functionalities similar to Common Lisp are built on it. For the smooth unification of this object orientation and functional programming, constant-time type discrimination scheme in cascaded class hierarchy is implemented. Memory efficiency for variable-size memory allocation is improved by introducing the Fibonacci buddy memory management. Performance of the multi-thread parallelism with thread local memory management scheme is evaluated. The advantages of EusLisp are demonstrated by its systematic implementation of a solid modeler and two robot applications.
View full abstract
-
Shin NAKAJIMA
2006 Volume 23 Issue 2 Pages
2_72-2_86
Published: 2006
Released on J-STAGE: June 30, 2006
JOURNAL
FREE ACCESS
Model-checking is a promising approach to automating software verification. This paper presents an introductory overview of the model-checking technology and sketches how it has been used in various ways regarding to the formal analysis of software design.
View full abstract
-
Takayasu ITO
2006 Volume 23 Issue 2 Pages
2_87-2_100
Published: 2006
Released on J-STAGE: June 30, 2006
JOURNAL
FREE ACCESS
-
Daisuke SAKAMOTO, Tetsuo ONO
2006 Volume 23 Issue 2 Pages
2_101-2_107
Published: 2006
Released on J-STAGE: June 30, 2006
JOURNAL
FREE ACCESS
We introduce a system based on a concept of "Colored Information" that is embedded in an environment and shows interactive pictures. These pictures are changing from embedded sensor data. Furthermore, a user can effect to the pictures by touching to a display. The pictures are managed as a plug-in called "motif" in the system. Therefore the user can also change the pictures by managing the plug-in. The display that shows the interactive pictures is not regarded as PC display, but as a part of the environment. In other words, our system aims at coloring the information in the environment in the same way as decorating a room with pictures. In this paper, we discuss a possibility of the embedded interactive art that prettily paint a private room, office, café and other public spaces.
View full abstract
-
Shin-Cheng MU, Zhenjiang HU, Masato TAKEICHI
2006 Volume 23 Issue 2 Pages
2_129-2_141
Published: 2006
Released on J-STAGE: May 30, 2006
JOURNAL
FREE ACCESS
A transformation from the source data to a target view is said to be bidirectional if, when the target is altered, the transformation somehow induces a way to reflect the changes back to the source, with the updated source satisfying certain healthiness conditions. Several bidirectional transformation languages have been proposed. In this paper, on the other hand, we aim at making existing transformations bidirectional. As a case study we chose the Haskell combinator library, HaXML, and embed it into Inv, a language the authors previously developed to deal with bidirectional updating. With the embedding, existing HaXML transformations gain bidirectionality.
View full abstract
-
Makoto HAMANA
2006 Volume 23 Issue 2 Pages
2_142-2_156
Published: 2006
Released on J-STAGE: May 30, 2006
JOURNAL
FREE ACCESS
We show that the structures of binding algebras and Σ-monoids by Fiore, Plotkin and Turi are sound and complete models of Klop's Combinatory Reduction Systems (CRSs). These algebraic structures play the same role of universal algebra for term rewriting systems. Restricting the algebraic structures to the ones equipped with well-founded relations, we obtain a complete characterisation of terminating CRSs. We can also naturally extend the characterisation to rewriting on meta-terms by using the notion of Σ-monoids.
View full abstract
-
Tomoyuki AOTANI, Hidehiko MASUHARA
2006 Volume 23 Issue 2 Pages
2_157-2_167
Published: 2006
Released on J-STAGE: May 30, 2006
JOURNAL
FREE ACCESS
We propose improvements to the SCoPE compiler, which supports highly expressive pointcuts in AspectJ programs by matching conditional pointcuts at compile-time. The improvements include a faster bindingtime checking algorithm and a framework to exploit existing bytecode engineering libraries from within conditional pointcuts. The improved SCoPE compiler allows us to define static pointcuts based on nontrivial program analysis and to compile programs with those pointcuts in a practical time.
View full abstract
-
Kei OKADA, Ryo HANAI, Shigeru KANZAKI, Masayuki INABA, Taiichi YUASA
2006 Volume 23 Issue 2 Pages
2_168-2_174
Published: 2006
Released on J-STAGE: May 30, 2006
JOURNAL
FREE ACCESS
In this paper, we propose humanoid programming environment as a new application area for software system. In order to realize productive programming environment for developing complex humanoid software that is required to include high-level description of real-world representation, concurrent processing of recognitive behaviors and real-time/reactive modules, we adopt the EusLisp which was designed for robot software application and features such as interactive, processing, 3D geometrical modeling, multi-threading and automatic memory management. However, suspension time caused by a garbage collector prevents periodic update of joint angles and sometimes induces serious malfunctions. Therefore we have implemented a real-time GC to reduce suspension time and proceed with GC effectively without suffering memory starvation.
View full abstract
-
Katsuhiko GONDOW, Tomoya SUZUKI, Hayato KAWASHIMA
2006 Volume 23 Issue 2 Pages
2_175-2_198
Published: 2006
Released on J-STAGE: May 30, 2006
JOURNAL
FREE ACCESS
We have been studying the integration of lower CASE tools using XML. In this paper, we introduce an application of DWARF2 debugging information to verify a novel technique, which is based on debugging information, for developing CASE tools for the C language. Debugging information has been used in debuggers, but rarely in CASE tools. Our technique of using debugging information allows us to easily develop more applicable and more practical CASE tools with less false positives. Also introducing DWARF2-XML, an XML representation for DWARF2, can improve the interoperability among CASE tools, and reduce the development cost. In our preliminary experiment, we successfully developed a debugger, a cross-referencer and a static call-graph extractor using DWARF2-XML in a very short time.
View full abstract
-
Masahiro MATSUNUMA, Kenichi KOURAI, Hideaki HIBINO, Yoshiki SATO, Shig ...
2006 Volume 23 Issue 2 Pages
2_199-2_210
Published: 2006
Released on J-STAGE: May 30, 2006
JOURNAL
FREE ACCESS
This paper proposes session-aware queue scheduling (SQS), which prevents performance degradation of web application servers under overload. Most of existing admission control are not suitable for real workloads using sessions since they limit the number of concurrent processing either to the whole server or each page. To schedule request processing under real workloads, SQS cooperates page-level schedulers and session-level schedulers. A page scheduler monitors the progress of a web application and detemines an appropriate concurrency level for processing each page. A session scheduler monitors the queue of page requests waiting to be processed in front of each page scheduler and determines the appropriate number of concurrent sessions. We have implemented these schedulers in Tomcat and performed experiments using workloads including sessions. The result shows that SQS improves server throughput for session.
View full abstract
-
Kengo MIYOSHI, Shigeru KUSAKABE, Keijiro ARAKI
2006 Volume 23 Issue 2 Pages
2_211-2_224
Published: 2006
Released on J-STAGE: May 30, 2006
JOURNAL
FREE ACCESS
In software development, verification of the specifications and designs at the earlier stage of development is effective in reducing errors which occur at the later development stage. While there are many methods for verification of the specifications and designs, combining such methods in a systematic way enables us to analyze multi-aspect of the target system. In this paper, we discuss a systematic method to extract FSP models from a VDM-SL model. Our approach is to focus on the data types related to the functional property and trace the transition of the value of the variables whose data types are focused on.
View full abstract
-
Tasuku HIRAISHI, Masahiro YASUGI, Taiichi YUASA
2006 Volume 23 Issue 2 Pages
2_225-2_238
Published: 2006
Released on J-STAGE: May 30, 2006
JOURNAL
FREE ACCESS
We are developing S-expression based C languages, SC languages, and their language system, which supports transformation-based language extension. When we need SC header files corresponding to existing C header files, translating header files into SC by hand will need undesirable implementation cost. So in this research we have implemented a C-to-SC translator. In some cases such a translation is not obvious. In particular, it is sometimes impossible to translate #define macro definitions for the C preprocessor into %defmacro or %defconstant constructs for the SC preprocessor mainly because of their syntactical difference. This paper discusses the limitations of the translation and our pragmatic and reasonable solutions to them. Some of the ideas of our solutions are applicable to translation between other languages.
View full abstract
