### 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 language | English |
---|---|

Title of host publication | Mathematical Foundations of Programming Semantics - 7th International Conference, Proceedings |

Publisher | Springer Verlag |

Pages | 457-476 |

Number of pages | 20 |

ISBN (Print) | 9783540555117 |

DOIs | |

Publication status | Published - Jan 1 1992 |

Event | 7th International Conference on the Mathematical Foundations of Programming Semantics, 1991 - Pittsburgh, United States Duration: Mar 25 1991 → Mar 28 1991 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 598 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 7th International Conference on the Mathematical Foundations of Programming Semantics, 1991 |
---|---|

Country | United States |

City | Pittsburgh |

Period | 3/25/91 → 3/28/91 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*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

**Program correctness and matricial iteration theories.** / Bloom, Stephen L.; Ésik, Z.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Mathematical Foundations of Programming Semantics - 7th International Conference, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 598 LNCS, Springer Verlag, pp. 457-476, 7th International Conference on the Mathematical Foundations of Programming Semantics, 1991, Pittsburgh, United States, 3/25/91. https://doi.org/10.1007/3-540-55511-0_24

}

TY - GEN

T1 - Program correctness and matricial iteration theories

AU - Bloom, Stephen L.

AU - Ésik, Z.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0001278395&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0001278395&partnerID=8YFLogxK

U2 - 10.1007/3-540-55511-0_24

DO - 10.1007/3-540-55511-0_24

M3 - Conference contribution

AN - SCOPUS:0001278395

SN - 9783540555117

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 457

EP - 476

BT - Mathematical Foundations of Programming Semantics - 7th International Conference, Proceedings

PB - Springer Verlag

ER -