Introduction to algorithms
Scheduling synchronous dataflow graphs for efficient looping
Journal of VLSI Signal Processing Systems
Source-level debugging of scalar optimized code
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Analysis of Checkpointing Schemes with Task Duplication
IEEE Transactions on Computers
Maximally fast and arbitrarily fast implementation of linear computations
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Symbolic Debugging of Optimized Code
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic debugging of globally optimized behavioral specifications
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Fast Prototyping of Datapath-Intensive Architectures
IEEE Design & Test
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Controller-based power management for control-flow intensive designs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Improving the observability and controllability of datapaths for emulation-based debugging
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Real time emulations: foundation and applications
Proceedings of the 47th Design Automation Conference
| Hi-index | 0.00 |
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 v ∈ CDFG 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.