All issues
Volume 22 (2005)
- Issue 4 Pages 4_1-
- Issue 3 Pages 3_1-
- Issue 2 Pages 2_1-
- Issue 1 Pages 1_1-
Volume 22, Issue 2
Displaying 1-8 of 8 articles from this issue
- |<
- <
- 1
- >
- >|
-
Kazuo IWANO, Hideyuki TOKUDA, Satoshi MATSUOKA, Kazuaki MURAKAMI, Yosh ...2005 Volume 22 Issue 2 Pages 2_1-2_20
Published: April 26, 2005
Released on J-STAGE: September 09, 2008
JOURNAL FREE ACCESSDownload PDF (849K) -
Takuya KATAYAMA2005 Volume 22 Issue 2 Pages 2_21
Published: April 26, 2005
Released on J-STAGE: September 09, 2008
JOURNAL FREE ACCESSDownload PDF (25K) -
Shoji YUEN2005 Volume 22 Issue 2 Pages 2_22-2_43
Published: April 26, 2005
Released on J-STAGE: September 09, 2008
JOURNAL FREE ACCESSThis tutorial introduces the communicating process model that is a fundamental computation model with concurrency. Processes running concurrently exchange messages through communication channels by the ‘hand-shake’, where processes are identified by external observation of communications with the environment. Based on the algebraic characterization of the communicating process model, we examine the basic features for modeling software with concurrency aiming at better quality and reliability.View full abstractDownload PDF (413K) -
Shoji YUEN, Keishi KATO, Daiju KATO, Kiyoshi AGUSA2005 Volume 22 Issue 2 Pages 2_44-2_57
Published: April 26, 2005
Released on J-STAGE: September 09, 2008
JOURNAL FREE ACCESSWe propose a behavioral model of web applications, called ‘Web Automata’, based on the MVC(Model View and Control) model architecture. The MVC model architecture separates design concerns to improve the overall software quality. Since the architecture only defines the abstract outline of the configurations, there is a broad gap between web application codes and their behavioral properties.
We model the behavior of a web application with dynamic contents as an extension of links-automata proposed by Stotts et al. with the constraint-logic feature of the Extended Finite Automata, EFA for short, by Sarna-Starosa and Ramakrishna. As extended in the model checking techniques, we view a web application as a data-independent system, where variables appearing in link parameters and form inputs are attached to each page.
We present a testing framework for web applications based on the behavioral model. We show it provides reasonable testing criteria for web applications when we focus on the loops in the Web automaton model. We apply our framework to the Jakarta Struts by presenting the extended configuration schema of Struts in order to describe the web automata directly.View full abstractDownload PDF (246K) -
Mitsutaka OKAZAKI, Toshiaki AOKI, Takuya KATAYAMA2005 Volume 22 Issue 2 Pages 2_58-2_73
Published: April 26, 2005
Released on J-STAGE: September 09, 2008
JOURNAL FREE ACCESSIt is important for analyzing real-time software to obtain information of concurrent tasks: ‘how many, when and what kind of execution sequences art running simultaneously in the system’ because the performance of a system highly depends on its internal execution sequences. However, it is difficult to obtain such information from object-oriented model since execution sequences are not explicitly modeled in the model. In this paper, we present a formal approach to transform an object-oriented model to a Concurrent Sequence Model in order to obtain information of execution sequences from object-oriented model. Since the Concurrent Sequence Model contains all possible execution sequences of software, it is easy to observe concurrent tasks from the model.View full abstractDownload PDF (187K) -
Kunihiko MIYAZAKI, David BASIN, Hironobu KURUMA, Kazuo TAKARAGI, Sator ...2005 Volume 22 Issue 2 Pages 2_74-2_84
Published: April 26, 2005
Released on J-STAGE: September 09, 2008
JOURNAL FREE ACCESSWe report on a case study in applying formal methods to model and validate a digital signature system. We use PROMELA (PROcess MEta LAnguage) to model the system implemented on top of DARMA which enable two different operationg systems to work on the same computer simultaneously. Afterwards, we use the Spin model checker to validate integrity properties. We describe here our modeling approach and the benefits gained from our analysis.View full abstractDownload PDF (157K) -
Xin LI, Mizuhito OGAWA2005 Volume 22 Issue 2 Pages 2_85-2_89
Published: April 26, 2005
Released on J-STAGE: September 09, 2008
JOURNAL FREE ACCESSThis paper proposes Proxy Certificate Trust List (PCTL) to efficiently record trusted delegation trace for grid computing. Our solution based on PCTL provides functions as follows: (1) On-demand inquiry service for real time delegation information of grid computing underway; (2) Lightweight mutual authentication that is beneficial for proxy nodes with short life span or limited computation power as wireless devices in mobile computing; (3) A kind of revocation mechanism for proxy certificates to improve the security and availability of grid computing.View full abstractDownload PDF (99K) -
Jun FURUSE2005 Volume 22 Issue 2 Pages 2_90-2_94
Published: April 26, 2005
Released on J-STAGE: September 09, 2008
JOURNAL FREE ACCESSExtensional polymorphism provides non-parametric polymorphic values called generic values in ML. We pointed out semantical and efficiency problems of classical compilation of generic values by type dispatching. To overcome these difficulties, we proposed a new compilation by dispatching directed integer graphs called “flows” which encode typing information of generic values. By reusing well-typed witness obtained in static typing, troublesome run-time type pattern matches become redundant and can be simplified to mere array accesses, which provide better semantics and efficiency.View full abstractDownload PDF (106K)
- |<
- <
- 1
- >
- >|