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

Japan Advanced Institute of Science and Technology

N/A
N/A
Protected

Academic year: 2021

シェア "Japan Advanced Institute of Science and Technology"

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

1998‑03

Type

Thesis or Dissertation

Text version

author

URL

http://hdl.handle.net/10119/851

Rights

Description

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

(2)

Reective Computation

Hiroshi Ishikawa

School of Information Science,

Japan Advanced Institute of Science and Technology

January 16, 1998

Abstract

Theconcurrentreectivecomputationmodelisrecognizedtobeauseful frameworkfor

constructing reliable and easy-to-maintain concurrent and/or distributed system. Many

applications have b een constructed based on the framework. In order to construct such

a system having more higher quality, it is required to give its specication as correctas

possible.

This thesis proposes a method to give specications for concurrent reective compu-

tation in rewriting logic which can represent dynamic behaviours of concurrent and/or

reactivesystemsdeclaratively. Furthermorethosespecicationsareexecutable,theauthor

constructs some example based onthem and analyzes their properties.

In this thesis, twosubjectsare contained:

Thegroup-widearchitectureisproposedasoneofframeworktoconstructconcurrent

reectivecomputational system. Makinguse ofitsmodellingbasedonactormo del,

theauthorreconstructsitinrewritinglogic. Basedonthespecication,anexample

isexecuted, and a property of the metalevelsystem is proved.

TheauthorgivesanoperationalsemanticsofGAEA,organicprogramminglanguage.

Based on the semantics, a robot example is constructed and executed, and some

prop erties of GAEA are analyzed.

This thesis shows that giving the specication of concurrent reective computation in

rewritinglogiccanbeexpectedtounderstandthesystemitselfandanalyzeitsprop erties.

Key Words: Concurrent Reective Computation, Group-Wide Architec-

ture, Operational Semantics, Organic Programming Lan-

guage GAEA, Rewriting Logic

参照

関連したドキュメント

These abstract machines are inspired by Girard’s Geometry of Interaction, and model program execution as dynamic rewriting of graph representation of a pro- gram, guided and

redex search token passing reduction diagram rewriting. computation

• local & step-wise reasoning to prove observational equivalence, with the concept of robustness..

In this note, we show how the notion of relational flow dia- gram (essentially a matrix whose entries are relations on the set of states of the program), introduced by Schmidt, can

Standard domino tableaux have already been considered by many authors [33], [6], [34], [8], [1], but, to the best of our knowledge, the expression of the

H ernández , Positive and free boundary solutions to singular nonlinear elliptic problems with absorption; An overview and open problems, in: Proceedings of the Variational

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

This, together with the observations on action calculi and acyclic sharing theories, immediately implies that the models of a reflexive action calculus are given by models of