• 検索結果がありません。

Lightweight Formal Methods for Component-based Software Development

N/A
N/A
Protected

Academic year: 2021

シェア "Lightweight Formal Methods for Component-based Software Development"

Copied!
2
0
0

読み込み中.... (全文を見る)

全文

(1)

Japan Advanced Institute of Science and Technology

JAIST Repository

https://dspace.jaist.ac.jp/

Title コンポーネントソフトウェア開発用軽量フォーマルメ

ソッドの研究

Author(s) 松本, 充広

Citation

Issue Date 2002‑03

Type Thesis or Dissertation Text version author

URL http://hdl.handle.net/10119/920 Rights

Description Supervisor:二木 厚吉, 情報科学研究科, 博士

(2)

Lightweight Formal Methods for Component-based Software Development

Michihiro Matsumoto School of Information Science,

Japan Advanced Institute of Science and Technology January 10, 2002

Abstract

In the thesis, we discuss (1) lightweight formal methods for component-based software called LFMB and LFME, (2) the component-based software development using LFMB or LFME called CBDL, and (3) the support tools of CBDL. Recently, component-based software development has gained in popularity. The reason for the popularity is that it can increase software productivity. To increase software productivity, components must be reused. The obstacles of component reuse are (a) a lack of a consensus about component usage between component developers and software developers, i.e. component users and (b) an architectural mismatch. We developed CBDL to eliminate the obstacles. CBDL is based on the Catalysis approach. The former obstacle is eliminated by specifying business models and component specifications by using UML diagrams with OCL descriptions and verifying consistency in the UML diagrams. The former technique is an idea of the Catalysis approach. The latter technique, i.e. LFMB and LFME, is a contribution of the thesis. Because LFMB and LFME include automated verification methods of the consistency, component developers and software developers who are not familiar with the verification can get the benefit of the verification by using the support tools of CBDL.

The latter obstacle is eliminated by selecting tree architecture that we developed. We can regard the UML diagrams as specifications specified by a language for programming-in- the-large. So, in CBDL, moreover, we generate component-based software from the UML diagrams by combining the connectors specified in the UML diagrams and components of a component library. Note that the above consistency verification guarantees the correctness of the connectors. Because the support tools of CBDL are designed as client-server type software, component developers and software developers can access to the tools through Internet at any place at any time. To summarize, by using the support tools of CBDL, we can increase component reuse and correctness of component-based software.

Key Words: Lightweight formal methods, component-based software de- velopment, algebraic specification, term rewriting system, UML

Copyright c2002 by Michihiro Matsumoto

参照

関連したドキュメント

Keywords: Convex order ; Fréchet distribution ; Median ; Mittag-Leffler distribution ; Mittag- Leffler function ; Stable distribution ; Stochastic order.. AMS MSC 2010: Primary 60E05

NIST - Mitigating the Risk of Software Vulnerabilities by Adopting a Secure Software Development Framework (SSDF).

The idea of applying (implicit) Runge-Kutta methods to a reformulated form instead of DAEs of standard form was first proposed in [11, 12], and it is shown that the

The proof uses a set up of Seiberg Witten theory that replaces generic metrics by the construction of a localised Euler class of an infinite dimensional bundle with a Fredholm

In conclusion, we reduced the standard L-curve method for parameter selection to a minimization problem of an error estimating surrogate functional from which two new parameter

Example 4.1: Solution of the error-free linear system (1.2) (blue curve), approximate solution determined without imposing nonnegativity in Step 2 of Algorithm 3.1 (black

Using the batch Markovian arrival process, the formulas for the average number of losses in a finite time interval and the stationary loss ratio are shown.. In addition,

Com- pared to the methods based on Taylor expansion, the proposed symplectic weak second-order methods are implicit, but they are comparable in terms of the number and the complexity