The major drawback of reported high level synthesis techniques is their limited applicability to a specific class of algorithms without extendibility to general algorithms and the lack of a formal approach to prove the correctness of the such techniques. In this paper, we introduce a novel approach for high level synthesis from -recursive algorithms. Completeness means the ability to use the approach for any general algorithm.
Correctness is achieved by using a set of transformations that are proved to be correct.
A formal framework for the synthesis procedure has been developed which can be easily automated. ASL has the ability to describe any general algorithm. An automatic procedure is used to transform an ASL representation into a specific realization specification using a correctness preserving set of transformations. The Digital Library is published by the Association for Computing Machinery.