Identifying modules via concept analysis (1997)
| Venue: | Proc. International Conference on Software Maintenance |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Si97identifyingmodules,
author = {Michael Si and Thomas Reps},
title = {Identifying modules via concept analysis},
booktitle = {Proc. International Conference on Software Maintenance},
year = {1997},
pages = {170--179},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a general technique for identifying modules in programs that donot designate them explicitly. The method is based on concept analysis | a branch of lattice theory that can beusedtoidentify similarities among a set of objects basedontheirattributes. We discuss how concept analysis can identify potential modules using both \positive " and \negative" information. We present analgorithmic framework to construct a lattice of concepts from a program, where each concept represents a potential module. We describe an algorithm that, givenaconcept lattice, identi es possible ways of partitioning the program into modules. We discuss a prototype implementation and some results on small and medium-sized programs.
