Total correctness of CSP programs |
| |
| Authors: | N. Soundararajan |
| |
| Affiliation: | (1) Department of Computer and Information Science, The Ohio State University, 43210 Columbus, OH, USA |
| |
| Abstract: | Summary In this paper we propose an axiomatic system for proving the total correctness of CSP programs. The system is based on the partial correctness system of [6, 7]. We use the proposed system to prove the total correctness of a program for set partitioning.This work was supported in part by the NSF grant no. ECS8404725 |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
