The telegram analysis problem posed by P. Henderson and R. A. Snowdon has been repeatedly taken into account. This paper adds yet another contribution to this problem. We propose a rigorous specification method, and describe how programs can be derived from it. This method functional programming by which procedural programs can be easily derived from a formal specification in the form of an abstract sequential machine. The method has been applied to sorting, file handlers and High Level Data Link Control Procedures.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yuji SUGIYAMA, Koji TORII, Tadao KASAMI, "Functional Programming for the Telegram Analysis Problem" in IEICE TRANSACTIONS on transactions,
vol. E71-E, no. 5, pp. 523-529, May 1988, doi: .
Abstract: The telegram analysis problem posed by P. Henderson and R. A. Snowdon has been repeatedly taken into account. This paper adds yet another contribution to this problem. We propose a rigorous specification method, and describe how programs can be derived from it. This method functional programming by which procedural programs can be easily derived from a formal specification in the form of an abstract sequential machine. The method has been applied to sorting, file handlers and High Level Data Link Control Procedures.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e71-e_5_523/_p
Copy
@ARTICLE{e71-e_5_523,
author={Yuji SUGIYAMA, Koji TORII, Tadao KASAMI, },
journal={IEICE TRANSACTIONS on transactions},
title={Functional Programming for the Telegram Analysis Problem},
year={1988},
volume={E71-E},
number={5},
pages={523-529},
abstract={The telegram analysis problem posed by P. Henderson and R. A. Snowdon has been repeatedly taken into account. This paper adds yet another contribution to this problem. We propose a rigorous specification method, and describe how programs can be derived from it. This method functional programming by which procedural programs can be easily derived from a formal specification in the form of an abstract sequential machine. The method has been applied to sorting, file handlers and High Level Data Link Control Procedures.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Functional Programming for the Telegram Analysis Problem
T2 - IEICE TRANSACTIONS on transactions
SP - 523
EP - 529
AU - Yuji SUGIYAMA
AU - Koji TORII
AU - Tadao KASAMI
PY - 1988
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E71-E
IS - 5
JA - IEICE TRANSACTIONS on transactions
Y1 - May 1988
AB - The telegram analysis problem posed by P. Henderson and R. A. Snowdon has been repeatedly taken into account. This paper adds yet another contribution to this problem. We propose a rigorous specification method, and describe how programs can be derived from it. This method functional programming by which procedural programs can be easily derived from a formal specification in the form of an abstract sequential machine. The method has been applied to sorting, file handlers and High Level Data Link Control Procedures.
ER -