Show simple item record

dc.contributor.authorChu, Hang
dc.date.accessioned2011-01-19 16:34:08 (GMT)
dc.date.available2011-01-19 16:34:08 (GMT)
dc.date.issued2011-01-19T16:34:08Z
dc.date.submitted2011
dc.identifier.urihttp://hdl.handle.net/10012/5729
dc.description.abstractThis 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.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectCollection Disjointnessen
dc.subjectStatic Analysisen
dc.subjectJavaen
dc.titleCollection Disjointness Analysis in Javaen
dc.typeMaster Thesisen
dc.pendingfalseen
dc.subject.programElectrical and Computer Engineeringen
uws-etd.degree.departmentElectrical and Computer Engineeringen
uws-etd.degreeMaster of Applied Scienceen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages