Mason Archival Repository Service

A Compiler-Based Approach to Implementing Smart Pointers

Show simple item record

dc.contributor.author Hoskins, Stephen
dc.creator Hoskins, Stephen
dc.date.accessioned 2007-12-13T18:41:46Z
dc.date.available 2007-12-13T18:41:46Z
dc.date.issued 2007-12-13T18:41:46Z
dc.identifier.uri https://hdl.handle.net/1920/2925
dc.description.abstract Because of the growing popularity of programming languages with garbage collectors, such as C# and Java, there is a clearly a desire for languages that support automated memory management. However, as a result of the inefficiencies of the garbage collectors of C# and Java, there is a requirement that programmers have a better understanding of the underlying implementations of the garbage collectors in order to make applications more robust or so that they can run on real-time systems. Using an implementation of smart pointers written from scratch, this paper attempts to address this problem by exploring techniques that are used by garbage collectors and ultimately concluding which features of object-oriented languages make the task of automating efficient garbage collection more difficult. As a result of the conclusions produced in this paper, it may be possible to create a brand new language with the simplicity and elegance of Java and the robustness and efficiency of C without the developer ever needing to perform memory management.
dc.language.iso en_US en
dc.subject compilers en_US
dc.subject garbage en_US
dc.subject collection en_US
dc.subject reference en_US
dc.subject counting en_US
dc.title A Compiler-Based Approach to Implementing Smart Pointers en
dc.type Thesis en
thesis.degree.name Master of Science in Computer Science en
thesis.degree.level Master's en
thesis.degree.discipline Computer Science en
thesis.degree.grantor George Mason University en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search MARS


Advanced Search

Browse

My Account

Statistics