Proof–Based Synthesis of Sorting Algorithms for Trees

DOI10.1007/978-3-319-30000-9_43zbMath1443.68045OpenAlexW2407196640MaRDI QIDQ2798749

Isabela Drămnesc, Tudor Jebelean, Sorin Stratulat

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30000-9_43

zbMATH Keywords

sortingtheorem provingalgorithm synthesis

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (3)

Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques ⋮ Synthesis of sorting algorithms using multisets in \textit{Theorema} ⋮ Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema

Uses Software

• Coq
• Mathematica
• Theorema
• Isabelle/HOL
• Fiat

This page was built for publication: Proof–Based Synthesis of Sorting Algorithms for Trees