Design and Implementation of a CASE Tool Supporting Proof of Consistency between OO Models


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 11, pp. 2965-2980, Nov. 1999
10.3745/KIPSTE.1999.6.11.2965,   PDF Download:

Abstract

A deductive database consists of facts being the extensional database and rules being the intensional database. Because of the difficulty of evaluating rules, many parallel evaluation algorithms for rules have beeen presented. But we hvae not gotten an acceptable result. This paper proposes a new methoddology to evaluate proof-theoretic meaning of the linear recursion rule which contains transitive dependency by using a shared-nothing parallel architecture. At first, we prove that there exists the equivalent expression for a linear recursion rule, design the algorithm for evaluating the linear recursion rule based on the equivalent expression, and finally analyse performance of the proposed algorithm.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. M. Lee, J. O. Jeon, J. C. Ryou, "Design and Implementation of a CASE Tool Supporting Proof of Consistency between OO Models," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 11, pp. 2965-2980, 1999. DOI: 10.3745/KIPSTE.1999.6.11.2965.

[ACM Style]
Sun Mi Lee, Jin Ok Jeon, and Jae Chol Ryou. 1999. Design and Implementation of a CASE Tool Supporting Proof of Consistency between OO Models. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 11, (1999), 2965-2980. DOI: 10.3745/KIPSTE.1999.6.11.2965.