PREDICATIVE SPECIFICATIONS FOR FUNCTIONAL PROGRAMS DESCRIBING COMMUNICATING NETWORKS

被引:19
作者
BROY, M
机构
[1] Univ of Passau, Passau, West Ger, Univ of Passau, Passau, West Ger
关键词
COMPUTER PROGRAMMING;
D O I
10.1016/0020-0190(87)90227-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A simple predicative specification language with an integrated functional language is given. It is powerful enough to specify and write programs representing finite and infinite nondeterministic data flow networks. The language is formally defined in terms of predicative specifications and a few simple examples are given. By doing so, one of the key questions is the treatment of nondeterminism. It is resolved in a simple way: a recursive declaration of a nondeterministic function can rather be seen as an equational specification of a predicate on functions. Then, the set of functions that fulfill this predicate is taken as the meaning of the recursive declaration.
引用
收藏
页码:93 / 101
页数:9
相关论文
共 6 条
[1]  
BROY M, 1985, LECT NOTES COMPUT SC, V185, P4
[2]  
DYBIER P, 1985, UNPUB REASONING STRE
[3]  
HAREL D, 1979, LECTURE NOTES COMPUT, V68
[4]   PREDICATIVE PROGRAMMING .1. [J].
HEHNER, ECR .
COMMUNICATIONS OF THE ACM, 1984, 27 (02) :134-143
[5]  
Hoare CAR, 1985, MATH LOGIC PROGRAMMI, P141
[6]  
PARK D, 1980, LECTURE NOTES COMPUT, V86, P504