Strongest invariant functions: Their use in the systematic analysis of while statements (Q797985): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4191568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying programs by induction on their data structure: general format and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The new math of computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized control structure and its formal definition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relational theory of computing / rank
 
Normal rank

Latest revision as of 12:53, 14 June 2024

scientific article
Language Label Description Also known as
English
Strongest invariant functions: Their use in the systematic analysis of while statements
scientific article

    Statements

    Strongest invariant functions: Their use in the systematic analysis of while statements (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    Strongest invariant functions, a useful tool in the analysis of while statements, are defined and discussed. Their relationships to loop invariants and to the function computed by the while statement are investigated.
    0 references
    Strongest invariant functions
    0 references
    while statements
    0 references
    loop invariants
    0 references

    Identifiers