Show simple item record

dc.contributor.authorFelleisen, Matthias
Steckler, Paul A.
dc.date.accessioned 2017-08-02T22:02:48Z
dc.date.available 2017-08-02T22:02:48Z
dc.date.issued 2001-04
dc.identifier.urihttps://hdl.handle.net/1911/96276
dc.description.abstract A static debugger assists a programmer in finding potential errors in programs. The key to a static debugger is set-based analysis (SBA). Many authors have described formulations of SBA, but leave open gaps among that theory, its implementation, and its use for a particular purpose. An implementation needs to confront these practical issues. While some of the implementation proceeds directly from the formal description of the analysis, there is much fine detail in the code. With a series of reports, we intend to bridge the gap between theory and implementation. In this first report, we implement an analyzer for a simple, first-order functional language and show how to use the analysis in a static debugger.
dc.format.extent 45 pp
dc.language.iso eng
dc.rights You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
dc.title Implementing a Static Debugger for a First-Order Functional Programming Language
dc.type Technical report
dc.date.note April 2001
dc.identifier.digital TR00-359
dc.type.dcmi Text
dc.identifier.citation Felleisen, Matthias and Steckler, Paul A.. "Implementing a Static Debugger for a First-Order Functional Programming Language." (2001) https://hdl.handle.net/1911/96276.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record