Building and maintaining analysis-level class hierarchies using Galois Lattices
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Reusable software: the Base object-oriented component libraries
Reusable software: the Base object-oriented component libraries
Reengineering of configurations based on mathematical concept analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Assessing modular structure of legacy code based on mathematical concept analysis
ICSE '97 Proceedings of the 19th international conference on Software engineering
Identifying objects using cluster and concept analysis
Proceedings of the 21st international conference on Software engineering
Understanding class hierarchies using concept analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Identifying modules via concept analysis
ICSM '97 Proceedings of the International Conference on Software Maintenance
Debugging temporal specifications with concept analysis
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Fast factorization by similarity in formal concept analysis of data with fuzzy attributes
Journal of Computer and System Sciences
Formal concept analysis with constraints by closure operators
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Granularity of attributes in formal concept analysis
Information Sciences: an International Journal
| Hi-index | 0.00 |
Our research promotes the use of a mathematical concept lattice as a novel visualization of the interfaces of Java classes. The binary relation of accesses between methods and fields, from which the lattice is constructed, serves as a heuristic for an automatic feature categorization. We demonstrate in a detailed real-life case study that such a lattice is valuable for understanding and reverse-engineering purposes, in that it helps reason about the interface and structure of the class and find errors in the absence of source code. We also show that if the source code of the class is available, then the lattice can be of assistance in selecting an efficient reading order.