Strongest invariant functions: Their use in the systematic analysis of while statements
From MaRDI portal
(Redirected from Publication:797985)
Recommendations
- Invariant functions and invariant relations: an alternative to invariant assertions
- A versatile concept for the analysis of loops
- Reflexive transitive invariant relations: A basis for computing loop functions
- Relational methods in the analysis of while loops: observations of versatility
- Computing Preconditions and Postconditions of While Loops
Cites work
- scientific article; zbMATH DE number 3740740 (Why is no real title available?)
- scientific article; zbMATH DE number 3768952 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3630186 (Why is no real title available?)
- A generalized control structure and its formal definition
- A relational theory of computing
- An axiomatic basis for computer programming
- The new math of computer programming
- Verifying programs by induction on their data structure: general format and applications
Cited in
(9)- Relational methods in the analysis of while loops: observations of versatility
- Regularity of relations: A measure of uniformity
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- A versatile concept for the analysis of loops
- Invariant functions and invariant relations: an alternative to invariant assertions
- Mechanical inference of invariants for FOR-loops
- Reflexive transitive invariant relations: A basis for computing loop functions
- Convergence: integrating termination and abort-freedom
- Mathematics for reasoning about loop functions
This page was built for publication: Strongest invariant functions: Their use in the systematic analysis of while statements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797985)
