TOTAL CORRECTNESS OF CSP PROGRAMS

被引：4
作者：
SOUNDARARAJAN, N
机构：
[1] Ohio State Univ, Columbus, OH, USA, Ohio State Univ, Columbus, OH, USA
来源：
ACTA INFORMATICA | 1986年 / 23卷 / 02期
关键词：
COMPUTER METATHEORY - Programming Theory;
D O I：
10.1007/BF00289498
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we propose an axiomatic system for proving the total correctness of CSP programs. The system is based on the author's partial correctness system. He uses the proposed system to prove the total correctness of a program for set partitioning.
引用
收藏
页码：193 / 215
页数：23
相关论文
共 9 条
  • [1] APT K, 1982, 2ND P C F SOFTW TECH, P146
  • [2] A Proof System for Communicating Sequential Processes
    Apt, Krzysztof R.
    Francez, Nissim
    De Roever, Willem P.
    [J]. ACM Transactions on Programming Languages and Systems, 1980, 2 (03): : 359 - 385
  • [3] FORMAL JUSTIFICATION OF A PROOF SYSTEM FOR COMMUNICATING SEQUENTIAL PROCESSES
    APT, KR
    [J]. JOURNAL OF THE ACM, 1983, 30 (01) : 197 - 216
  • [4] APT KR, UNPUB THEORET COMPUT
  • [5] A PROOF TECHNIQUE FOR COMMUNICATING SEQUENTIAL PROCESSES
    LEVIN, GM
    GRIES, D
    [J]. ACTA INFORMATICA, 1981, 15 (03) : 281 - 302
  • [6] Manna Z., 1974, Acta Informatica, V3, P243, DOI 10.1007/BF00288637
  • [7] SOUNDARARAJAN N, 1984, ACM T PROGR LANG SYS, V6, P647, DOI 10.1145/1780.1805
  • [8] SOUNDARARAJAN N, 1984, TOTAL CORRECTNESS CS
  • [9] SOUNDARARAJAN N, UNPUB BIT
1