RISC Forum
David Cerna: Conference SCSS16; Xinhua Xiong: Self-introduction; Tudor Jebelean: Proof-based Synthesis of Sorting Algorithms for Trees
| When |
Apr 11, 2016
from 01:30 PM to 02:30 PM |
|---|---|
| Where | Seminar room castle |
| Add event to calendar |
vCal
iCal
|
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 principles are designed and various specific prove-solve methods are experimented, mixing rewriting with assumption-based forward reasoning and goal-based backward reasoning a la Prolog. The proof techniques are implemented in the Theorema system and are used for the automatic synthesis of several algorithms for sorting and for the auxiliary functions, from which we present few here. Moreover we formalize and check some of the algorithms and some of the
properties in the Coq system.