A note on a standard strategy for developing loop invariants and loops
From MaRDI portal
Publication:1052815
DOI10.1016/0167-6423(83)90015-1zbMath0516.68008MaRDI QIDQ1052815
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
68N01: General topics in the theory of software
Related Items
Finding the maximum subsequence sum on interconnection networks, Functional Pearls, 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, Mechanical inference of invariants for FOR-loops, Randomized algorithm for the sum selection problem, Ranking \(k\) maximum sums, Alternative developments of cyclic-permutation algorithms, The co-invariant generator: An aid in deriving loop bodies, Efficient algorithms for the sum selection problem and \(k\) maximum sums problem