Deductive synthesis of sorting programs

DOI10.1016/S0747-7171(89)80040-9zbMath0679.68017MaRDI QIDQ1822927

Jonathan Traugott

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

derivationsautomatic programmingprogram constructiondeductive synthesisrecursive sorting programs

Mathematics Subject Classification ID

Searching and sorting (68P10) Specification and verification (program logics, model checking, etc.) (68Q60) Artificial intelligence (68T99) General topics in the theory of software (68N01)

Related Items (5)

\textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema} ⋮ An approach to automatic deductive synthesis of functional programs ⋮ Synthesis of sorting algorithms using multisets in \textit{Theorema} ⋮ Program construction by verifying specification ⋮ Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema

Cites Work

• Unnamed Item
• A mechanical solution of Schubert's steamroller by many-sorted resolution
• Top-down synthesis of divide-and-conquer algorithms
• Completely non-clausal theorem proving
• A synthesis of several sorting algorithms
• Special relations in automated deduction
• Algorithm classification through synthesis
• A Deductive Approach to Program Synthesis

This page was built for publication: Deductive synthesis of sorting programs