Strongest invariant functions: Their use in the systematic analysis of while statements
From MaRDI portal
Publication:797985
DOI10.1007/BF00290145zbMATH Open0546.68011MaRDI QIDQ797985FDOQ797985
Jean-Raymond Gagné, Ali Mili, Jules Desharnais
Publication date: 1985
Published in: Acta Informatica (Search for Journal in Brave)
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
- A generalized control structure and its formal definition
- An axiomatic basis for computer programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- The new math of computer programming
- Verifying programs by induction on their data structure: general format and applications
- A relational theory of computing
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- A versatile concept for the analysis of loops
- 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
- Regularity of relations: A measure of uniformity
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)
