Axioms for the term-wise correctness of programs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)
KeywordsInference Rule Partial Function Transitive Closure Inductive Assumption Axiom System
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- Cook, S.A. “Soundness and completeness of an axiom system for program verification” SIAM J. Comput. 7, 70–90, 1978Google Scholar
- Mazurkiewicz, A. “Proving properties of processes” Algorytmy XI, 5–22, 1974Google Scholar
- Sokołowski, S. “Programs as term transformers” Fundamenta Informaticae III, 419–432, 1980Google Scholar
© Springer-Verlag Berlin Heidelberg 1981