Algorithm theories and design tactics

DOI10.1016/0167-6423(90)90025-9MaRDI QIDQ918221zbMATH OpenOpenAlexFDO

Authors Douglas R. Smith, Michael R. Lowry

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0167-6423(90)90025-9

zbMATH Keywords

algorithm designalgorithm theoryformal derivation of algorithmsprogram specificationprogram theory

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• An incremental approach to automatic algorithm design
• The design of divide and conquer algorithms
• Functional algorithm design
• Design of sequential sorting algorithms: Classification, transformation, synthesis
• Algorithms. Design techniques and analysis

Cited in

(8)

• Program construction by verifying specification
• Constructing specification morphisms
• Designing algorithms by expectations
• An incremental approach to automatic algorithm design
• Categories, relations and dynamic programming
• scientific article; zbMATH DE number 1759398 (Why is no real title available?)
• Synthesis of implementations for divide-and-conquer specifications
• A problem reduction based approach to discrete optimization algorithm design

Describes a project that uses

Uses Software

• OBJ3

This page was built for publication: Algorithm theories and design tactics

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