PREDICATE LOGIC FOR SOFTWARE ENGINEERING

被引:33
作者
PARNAS, DL
机构
[1] Telecommunications Research Institute of Ontario (TRIO), Communications Research Laboratory, Department of Electrical and Computer Engineering, McMaster University, Hamilton., Ontario, L8S
基金
加拿大自然科学与工程研究理事会;
关键词
FORMAL METHODS; PREDICATE LOGIC; PARTIAL FUNCTIONS; SOFTWARE DOCUMENTATION; TABULAR EXPRESSIONS;
D O I
10.1109/32.241769
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The interpretations of logical expressions found in most introductory textbooks are not suitable for use in software engineering applications because they do not deal with partial functions. More advanced papers and texts deal with partial functions in a variety of complex ways. This paper proposes a very simple change to the classic interpretation of predicate expressions, one that defines their value for all values of all variables, yet is almost identical to the standard definitions. It then illustrates the application of this interpretation in software documentation.
引用
收藏
页码:856 / 862
页数:7
相关论文
共 9 条
  • [1] CHENG JH, 1991, 3RD P REF WORKSH
  • [2] Dijkstra EW, 1976, DISCIPLINE PROGRAMMI
  • [3] FARMER WF, 1990, J SYMBOLIC LOGIC, P1269
  • [4] Halmos, 1960, NAIVE SET THEORY
  • [5] MENDELSON E, 1987, INTRO MATH LOGIC
  • [6] PARNAS DL, 1991, NUCL SAFETY, V32, P189
  • [7] PARNAS DL, 1992, CRL260 TRIO MCMAST U
  • [8] PARNAS DL, 1992, CRL259 TRIO MCMAST U
  • [9] PARNAS DL, 1991, CRL237 TRIO MCMAST U