Algorithm classification through synthesis
From MaRDI portal
Publication:3862422
DOI10.1093/comjnl/23.1.61zbMath0426.68041OpenAlexW2054358146MaRDI QIDQ3862422
No author found.
Publication date: 1980
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/23.1.61
program specificationprogram synthesisalgorithm classificationformal specification of the sort function
Related Items (9)
LOGIC DERIVATION OF PARALLEL LINEAR EQUATION SYSTEM SOLVERS WITHIN ELIMINATION STRATEGY ⋮ Synthesis of list algorithms by mechanical proving ⋮ Algorithm design through the optimization of reuse-based generation ⋮ Program morphisms ⋮ Semantics of algorithmic languages ⋮ Deductive synthesis of sorting programs ⋮ On synthesis of scheduling algorithms ⋮ Top-down synthesis of divide-and-conquer algorithms ⋮ Foundation of logic programming based on inductive definition
This page was built for publication: Algorithm classification through synthesis