Verification of a class of loop programs without using loop invariants (Q2265799)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Verification of a class of loop programs without using loop invariants |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Verification of a class of loop programs without using loop invariants |
scientific article |
Statements
Verification of a class of loop programs without using loop invariants (English)
0 references
1984
0 references
A method is considered for simplifying the verification of structured loop programs that do not contain embedded loops. An axiomatic system is described that constitutes a modification of Hoare's logic and that uses recursive functions instead of loop invariants, these functions being directly determined in accordance with the syntactic structure of the loops.
0 references
verification
0 references
structured loop programs
0 references
Hoare's logic
0 references
recursive functions
0 references
loop invariants
0 references
