Program correctness and matricial iteration theories

Stephen L. Bloom, Zoltán Ésik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

The analysis of partial correctness assertions given in [Béa] is specialized to matricial iteration theories. A system of rules for partial correctness is given and a completeness theorem is stated. It is shown how to formulate total correctness in all iteration theories as an equation, and some total correctness rules are considered.

Original languageEnglish
Title of host publicationMathematical Foundations of Programming Semantics - 7th International Conference, Proceedings
EditorsMichael Main, Michael Mislove, Stephen Brookes, Austin Melton, David Schmidt
PublisherSpringer Verlag
Pages457-476
Number of pages20
ISBN (Print)9783540555117
DOIs
Publication statusPublished - Jan 1 1992
Event7th International Conference on the Mathematical Foundations of Programming Semantics, 1991 - Pittsburgh, United States
Duration: Mar 25 1991Mar 28 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume598 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Conference on the Mathematical Foundations of Programming Semantics, 1991
CountryUnited States
CityPittsburgh
Period3/25/913/28/91

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bloom, S. L., & Ésik, Z. (1992). Program correctness and matricial iteration theories. In M. Main, M. Mislove, S. Brookes, A. Melton, & D. Schmidt (Eds.), Mathematical Foundations of Programming Semantics - 7th International Conference, Proceedings (pp. 457-476). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 598 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-55511-0_24