Formal transformation of structured sorting algorithms

MaRDI QIDQ1067782zbMATH OpenFDO

Authors G. E. Tsejtlin

Publication date 1985

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmssemanticssequential algorithmssystems of algorithmic algebras

Mathematics Subject Classification ID

Searching and sorting (68P10) Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99)

Review text

The article focuses on formalization of the semantics of sequential and parallel sorting algorithms using the apparatus of Glushkov's systems of algorithmic algebras and their modifications. We particularly consider formal transformation of sorting algorithms with the purpose of optimizing them by a set of given criteria.

Recommendations

• Design of sequential sorting algorithms: Classification, transformation, synthesis
• On optimal parallelization of sorting networks
• A note on synthesis and classification of sorting algorithms
• Some aspects of algorithm transformation based on the formalization of information connections
• scientific article; zbMATH DE number 4076602

Cited in

(4)

• Design of sequential sorting algorithms: Classification, transformation, synthesis
• Some aspects of algorithm transformation based on the formalization of information connections
• Transformation of algorithms written in the form of composition schemes
• A Generic Approach to the Verification of the Permutation Property of Sequential and Parallel Swap-Based Sorting Algorithms

This page was built for publication: Formal transformation of structured sorting algorithms

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