Keywords and Phrases
Heuristic Search; Model Summary; Search Based Software Engineering
"Large systems are complex and consist of numerous components and interactions between the components. Hence managing such large systems is a cumbersome and time consuming task. Large systems are usually described at the model level. But the large number of components in such models makes it difficult to modify. As a consequence, developers need a solution to rapidly detect which model components to revise. Effective solution is to generate a model summary. Although existing techniques are powerful enough to provide good summaries based on lexical information (relevant terms), they do not make use of structural information (component structure) well. In this thesis, model summarization is considered as an optimization problem that combines structural and lexical information to evaluate possible solutions. A summary solution is defined as a combination of model elements (e.g., classes, methods, comments, etc.) that should maximize, as much as possible, the coverage of both automatically generated structural rules and lexical information. The results of the experiments are reported on 6 open source projects where the majority of generated summaries are approved by developers"--Abstract, page iii.
Liu, Xiaoqing Frank
M.S. in Computer Science
Missouri University of Science and Technology
viii, 51 pages
© 2013 Lokesh Krishna Ravichandran, All rights reserved.
Thesis - Open Access
Library of Congress Subject Headings
Software maintenance -- Evaluation -- Methodology
Software measurement -- Evaluation -- Methodology
Genetic programming (Computer science) -- Evaluation -- Methodology
Information retrieval -- Evaluation -- Methodology
Combinatorial optimization -- Evaluation -- Methodology
Source code (Computer science) -- Information technology
Automatic programming (Computer science) -- Technique
Open source software -- Case studies
Electronic OCLC #
Ravichandran, Lokesh Krishna, "Search-based model summarization" (2013). Masters Theses. 5391.