A Formal Verification Method of Scheduling in High-level Synthesis

Abstract

This paper describes a formal method for checking the equivalence between the finite state machine with data path (FSMD) model of the high-level behavioural specification and the FSMD model of the behaviour transformed by the scheduler. The method consists in introducing cutpoints in one FSMD, visualizing its computations as concatenation of paths from cutpoints to cutpoints and finally, identifying equivalent finite path segments in the other FSMD; the process is then repeated with the FSMDs interchanged. The method is strong enough to accommodate merging of the segments in the original behaviour by the typical scheduler such as DLS, a feature very common in scheduling but not captured by many works reported in the literature. It also handles arithmetic transformations.

DOI: 10.1109/ISQED.2006.10

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@inproceedings{Karfa2006AFV, title={A Formal Verification Method of Scheduling in High-level Synthesis}, author={Chandan Karfa and Chittaranjan A. Mandal and Dipankar Sarkar and S. R. Pentakota and Chris Reade}, booktitle={ISQED}, year={2006} }