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

DOI10.1016/0167-6423(83)90015-1MaRDI QIDQ1052815zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(10)

• 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
• Finding the maximum subsequence sum on interconnection networks
• Mechanical inference of invariants for FOR-loops
• The co-invariant generator: An aid in deriving loop bodies
• Randomized algorithm for the sum selection problem
• Ranking \(k\) maximum sums
• Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
• Alternative developments of cyclic-permutation algorithms
• Functional Pearls

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1052815)