Proof–based synthesis of sorting algorithms for trees

I Drămnesc, T Jebelean, S Stratulat - … , Czech Republic, March 14-18, 2016 …, 2016 - Springer
We develop various proof techniques for the synthesis of sorting algorithms on binary trees,
by extending our previous work on the synthesis of algorithms on lists. Appropriate induction …
被引用次数：7 相关文章

Proof–based Synthesis of Sorting Algorithms for Trees

I Dramnesc, T Jebelean, S Stratulat - 140th International Conference on …, 2016 - hal.science
e develop various proof techniques for the synthesis of sorting algorithms on binary trees, by
extending our previous work on the synthesis of algorithms on lists. Appropriate induction …

Proof–based Synthesis of Sorting Algorithms for Trees

I Dramnesc, T Jebelean, S Stratulat - … International Conference on …, 2016 - hal.univ-lorraine.fr
e develop various proof techniques for the synthesis of sorting algorithms on binary trees, by
extending our previous work on the synthesis of algorithms on lists. Appropriate induction …
[PDF] academia.edu

[PDF][PDF] Proof–based Synthesis of Sorting Algorithms for Trees

I Dramnesc, T Jebelean, S Stratulat - academia.edu
We develop various proof techniques for the synthesis of sorting algorithms on binary trees,
by extending our previous work on the synthesis of algorithms on lists. Appropriate induction …
[PDF] jku.at

[PDF][PDF] Proof–based Synthesis of Sorting Algorithms for Trees

I Dramnesc, T Jebelean, S Stratulat - risc.jku.at
Remark: These replacements are performed according to certain heuristics: for instance in
the example above T1, T2 correspond in the final algorithm to the recursive calls, so it is …
[PDF] hal.science

[PDF][PDF] Proof–based Synthesis of Sorting Algorithms for Trees

I Dramnesc, T Jebelean, S Stratulat - hal.science
We develop various proof techniques for the synthesis of sorting algorithms on binary trees,
by extending our previous work on the synthesis of algorithms on lists. Appropriate induction …