dc.contributor.author | Chu, Hang | |
dc.date.accessioned | 2011-01-19 16:34:08 (GMT) | |
dc.date.available | 2011-01-19 16:34:08 (GMT) | |
dc.date.issued | 2011-01-19T16:34:08Z | |
dc.date.submitted | 2011 | |
dc.identifier.uri | http://hdl.handle.net/10012/5729 | |
dc.description.abstract | This thesis presents a collection disjointness analysis to find disjointness relations between collections in Java. We define the three types of disjointness relations between collections: must-shared, may-shared and not-may-shared. The collection- disjointness analysis is implemented following the way of a forward data-flow analysis using Soot Java bytecode analysis framework. For method calls, which are usually difficult to analyze in static analysis, our analysis provide a way of generating and reading annotations of a method to best approximate the behavior of the calling methods. Finally, this thesis presents the experimental results of the collection-disjointness analysis on several tests. | en |
dc.language.iso | en | en |
dc.publisher | University of Waterloo | en |
dc.subject | Collection Disjointness | en |
dc.subject | Static Analysis | en |
dc.subject | Java | en |
dc.title | Collection Disjointness Analysis in Java | en |
dc.type | Master Thesis | en |
dc.pending | false | en |
dc.subject.program | Electrical and Computer Engineering | en |
uws-etd.degree.department | Electrical and Computer Engineering | en |
uws-etd.degree | Master of Applied Science | en |
uws.typeOfResource | Text | en |
uws.peerReviewStatus | Unreviewed | en |
uws.scholarLevel | Graduate | en |