Strongest invariant functions: Their use in the systematic analysis of while statements
type: Item
instance of: scholarly article
title: Strongest invariant functions: Their use in the systematic analysis of while statements
zbMATH Open document ID: 0546.68011
DOI: 10.1007/BF00290145
author: Ali Mili
author: Jules Desharnais
author: Jean-Raymond Gagné
published in: Acta Informatica
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 3870575
zbMATH Keywords: Strongest invariant functions
zbMATH Keywords: while statements
zbMATH Keywords: loop invariants
MaRDI profile type: Publication
cites work: Q4191568
cites work: Q3949952
cites work: Q3925859
cites work: An axiomatic basis for computer programming
cites work: Q4124327
cites work: Verifying programs by induction on their data structure: general format and applications
cites work: The new math of computer programming
cites work: A generalized control structure and its formal definition
cites work: A relational theory of computing
description: scientific article; zbMATH DE number 3870575