On the Effectiveness of Theorem Proving Guided Discovery of Formal Assertions for a Register Allocator in a High-Level Synthesis System (0)
| Venue: | Proceedings of 11th Conference on Theorem Proving in Higher Or der Logics (TPHOL'98 |
| Citations: | 3 - 3 self |
BibTeX
@INPROCEEDINGS{Narasimhan_onthe,
author = {Naren Narasimhan and Ranga Vemuri},
title = {On the Effectiveness of Theorem Proving Guided Discovery of Formal Assertions for a Register Allocator in a High-Level Synthesis System},
booktitle = {Proceedings of 11th Conference on Theorem Proving in Higher Or der Logics (TPHOL'98},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper presents a formal specification and a proof of correctness for the register optimization task in high--level synthesis. A widely implemented register optimization algorithm is modeled in higher--order logic and verified in a theorem prover environment. A rich collection of correctness properties is systematically formulated during the theorem proving exercise. These properties constitute a detailed set of formal assertions that are identified with the invariants at various stages of the algorithm. The formal assertions are then embedded as programming assertions in the implementation of the register optimization algorithm in a production-strength high--level synthesis system. When turned on, the programming assertions (1) certify whether a specific run of the high--level synthesis system produced designs with error--free register allocation and, (2) in the event of a failure, help discover and isolate programming errors in the implementation. We present a detaile...
