Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Modelling the algebra of weakest preconditions
In expounding the notions of pre- and postconditions, of termination and nontermination, of correctness and of predicate transformers I found that the same trivalent distinction played a major role in all contexts. Namely: Initialisation properties: An execution of a program always, sometimes or nev...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Mathematics and Applied Mathematics
2017
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Modelling the algebra of weakest preconditions
- Providing mechanical support for program development in a weakest precondition calculus
- A topological framework for program semantics
- Preconditioning and Uniform Convergence for Convection-Diffusion Problems Discretized on Shishkin-Type Meshes
- Steinberg algebra and Leavitt path algebras
- Ideals in von Neumann algebras and in associated operator algebras
- Preconditioning for feature selection in classification