A note on a standard strategy for developing loop invariants and loops

DOI10.1016/0167-6423(83)90015-1zbMath0516.68008OpenAlexW2009992143MaRDI QIDQ1052815

David Gries

Publication date: 1982

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6370

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (10)

Functional Pearls ⋮ The co-invariant generator: An aid in deriving loop bodies ⋮ Mechanical inference of invariants for FOR-loops ⋮ Randomized algorithm for the sum selection problem ⋮ Ranking \(k\) maximum sums ⋮ Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence ⋮ Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence ⋮ Alternative developments of cyclic-permutation algorithms ⋮ Finding the maximum subsequence sum on interconnection networks ⋮ Efficient algorithms for the sum selection problem and \(k\) maximum sums problem

This page was built for publication: A note on a standard strategy for developing loop invariants and loops