Difference between revisions of "Koushanfar2000"
From ACES
(Import from BibTeX) |
m (Import from BibTeX) |
||
Line 3: | Line 3: | ||
|abstract=Symbolic debuggers are system development tools that can accelerate the validation speed of behavioral specifications by allowing a user to interact with an executing code at the source level. In response to a user query, the debugger retrieves the value of a source variable in a manner consistent with respect to the source statement where execution has halted. However, when a behavioral specification has been optimized using transformations, values of variables may be inaccessible in the run-time state. We have developed a set of techniques that, given a behavioral specification CDFG, enforce computation of a selected subset Vcut of user variables such that (i) all other variables \υ鈭圕DFG can be computed from Vcut and (ii) this enforcement has minimal impact on the optimization potential of the computation. The implementation of the new debugging approach poses several optimization tasks. We have formulated the optimization tasks and developed heuristics to solve them. The effectiveness of the approach has been demonstrated on a set of benchmark designs. | |abstract=Symbolic debuggers are system development tools that can accelerate the validation speed of behavioral specifications by allowing a user to interact with an executing code at the source level. In response to a user query, the debugger retrieves the value of a source variable in a manner consistent with respect to the source statement where execution has halted. However, when a behavioral specification has been optimized using transformations, values of variables may be inaccessible in the run-time state. We have developed a set of techniques that, given a behavioral specification CDFG, enforce computation of a selected subset Vcut of user variables such that (i) all other variables \υ鈭圕DFG can be computed from Vcut and (ii) this enforcement has minimal impact on the optimization potential of the computation. The implementation of the new debugging approach poses several optimization tasks. We have formulated the optimization tasks and developed heuristics to solve them. The effectiveness of the approach has been demonstrated on a set of benchmark designs. | ||
|pages=40 - 43 | |pages=40 - 43 | ||
|month= | |||
|year=2000 | |||
|booktitle=IEEE/ACM International Conference on Computer Aided Design (ICCAD) | |booktitle=IEEE/ACM International Conference on Computer Aided Design (ICCAD) | ||
|title=Symbolic Debugging Scheme for Optimized Hardware and Software | |title=Symbolic Debugging Scheme for Optimized Hardware and Software | ||
|entry=inproceedings | |entry=inproceedings | ||
}} | }} |
Revision as of 03:24, 4 September 2021
Koushanfar2000 | |
---|---|
entry | inproceedings |
address | |
annote | |
author | F. Koushanfar and D. Kirovski and M. Potkonjak |
booktitle | IEEE/ACM International Conference on Computer Aided Design (ICCAD) |
chapter | |
edition | |
editor | |
howpublished | |
institution | |
journal | |
month | |
note | |
number | |
organization | |
pages | 40 - 43 |
publisher | |
school | |
series | |
title | Symbolic Debugging Scheme for Optimized Hardware and Software |
type | |
volume | |
year | 2000 |
doi | |
issn | |
isbn | |
url | |