Tree Component Alternatives to the Composite Design Pattern
| dc.contributor.author | Sudhir, Arun | en |
| dc.contributor.committeechair | Kulczycki, Gregory W. | en |
| dc.contributor.committeemember | Chen, Ing-Ray | en |
| dc.contributor.committeemember | Lu, Chang-Tien | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2014-03-14T20:50:06Z | en |
| dc.date.adate | 2009-01-31 | en |
| dc.date.available | 2014-03-14T20:50:06Z | en |
| dc.date.issued | 2008-12-03 | en |
| dc.date.rdate | 2009-01-31 | en |
| dc.date.sdate | 2008-12-16 | en |
| dc.description.abstract | The Composite design pattern is commonly employed in object-oriented languages to design a system of objects that form a part-whole hierarchical structure with composite objects formed out of primitive objects. The client does not differentiate between a composite object and a primitive object. The composite hierarchy effectively forms a tree-like hierarchical grouping of objects. From a software engineering perspective, there are at least two problems with the Composite pattern. First, it does not maintain a separation of concerns between the structure of the objects in a system and the objects themselves. The objects that comprise the system contain information about their relationship to other objects. This limits the ability of programmers to reuse the system's structural information. Secondly, there is no mechanism for encapsulating the system as a whole. This makes it difficult to specify and reason about global system properties. This thesis presents two tree components that can be used as alternatives to the Composite design pattern in systems that are traditionally implemented with the pattern. Both components are data structures that can contain arbitrary objects and maintain the structure of those objects as an ordered-tree. Since the components encapsulate only the tree structure, they only need to be specified and verified once, and they are available for black-box reuse. The first component is a traversable tree that maintains a conceptual "cursor" position. Methods are provided for inserting and removing objects at the cursor position, and for moving the cursor throughout the tree. The second component extends the traversable tree. A formal specification for each tree component is presented in the Tako language — a Java-like language with alias avoidance that is designed to facilitate specification and verification. A case study is presented that shows how the indexed tree can be used and reasoned about in an application — a text-based adventure game. Finally, a similar application is developed in Java, once using the composite pattern and once using the indexed tree data structure, and object-oriented metrics are given for both systems. | en |
| dc.description.degree | Master of Science | en |
| dc.identifier.other | etd-12162008-180406 | en |
| dc.identifier.sourceurl | http://scholar.lib.vt.edu/theses/available/etd-12162008-180406/ | en |
| dc.identifier.uri | http://hdl.handle.net/10919/36206 | en |
| dc.language.iso | en | en |
| dc.publisher | Virginia Tech | en |
| dc.relation.haspart | Thesis.pdf | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | Formal Reasoning | en |
| dc.subject | Tako | en |
| dc.subject | Java | en |
| dc.subject | Design Patterns | en |
| dc.subject | Tree | en |
| dc.subject | Indexed Tree | en |
| dc.subject | Composite Pattern | en |
| dc.title | Tree Component Alternatives to the Composite Design Pattern | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | Computer Science | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | masters | en |
| thesis.degree.name | Master of Science | en |
Files
Original bundle
1 - 1 of 1