naistar (NAIST Academic Repository) >
学術リポジトリ naistar / NAIST Academic Repository naistar >
テクニカルレポート / Technical Report >
Please use this identifier to cite or link to this item:
|Title: ||Implementation of natural language specifications of communication protocols by executable specifications|
|Authors: ||Kasami, Tadao|
|Issue Date: ||Jul-1994|
|Publisher: ||Nara Institute of Science and Technology|
|Series/Report no.: ||Information Science Technical Report ~ TR94026|
|Abstract: ||First, this paper defines a subclass of algebraic specifications. Each specification of the subclass consists of two sub-specifications: a BE program and a BE interpreter specification. The syntax of BE programs resembles the syntax of LOTOS, and the semantics of BE programs is defined as a behavior of an interpreter, called a BE interpreter, which has a finite number of registers and unbounded I/O buffers. Since BE interpreter specifications are based on a state transition model, each specification of the subclass can be easily compiled into an executable program. Next, the paper proposes a method of implementing logical formulae, which are derived from natural language specifications of communication protocols, by BE programs. Such a natural language specification often specifies valid sequences of actions to be performed by a protocol machine. In this implementation method, the meaning of each predicate that corresponds to a word denoting actions is defined as a BE program and stored as a “lexical item” of the predicate. Then, a BE program for logical formulae is constructed in a bottom-up manner. Thus, a natural language specification of communication protocols can be translated into an executable program in the framework of algebraic specifications.|
|Text Version: ||author|
|Appears in Collections:||テクニカルレポート / Technical Report|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.