Transformation of algorithms written in the form of composition schemes

DOI10.1007/S10559-014-9600-1MaRDI QIDQ466022zbMATH OpenOpenAlexFDO

Authors V. G. Akulovskiy, A. E. Doroshenko

Publication date 24 October 2014

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-014-9600-1

zbMATH Keywords

algorithmsalgorithmic algebra with datacomposition schemes of algorithmstransformation of algorithms

Mathematics Subject Classification ID

General topics in the theory of data (68P01) General topics in the theory of algorithms (68W01)

Recommendations

• scientific article; zbMATH DE number 3936509
• Transformational programming and the derivation of algorithms
• Euro-Par 2004 Parallel Processing
• Transformation synthesis of efficient algorithms with auxiliary specifications
• Formal transformation of structured sorting algorithms
• Computable transformations of structures
• Transformational reducibility and synthesis of algorithms and programs of symbolic processing
• Generalised compositionality in graph transformation
• Algorithms and reductions for rewriting problems

Cited in

(4)

• Some aspects of algorithm transformation based on the formalization of information connections
• The Algorithmic Transformation of Schemas to Structured Form
• Formalization of interrelations between operators and data within the framework of an extended algebra of algorithms
• scientific article; zbMATH DE number 1194289 (Why is no real title available?)

This page was built for publication: Transformation of algorithms written in the form of composition schemes

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