- Using formal concept analysis for the verification of process-data matrices in conceptual domain models
- IASTED International Conference on Software Engineering (SE 2010), Innsbruck, Austria
- Book/source title
- Proceedings of the IASTED International Conference on Software Engineering: February 16-18, 2010, Innsbruck, Austria
- Pages (from-to)
- Anaheim, CA: ACTA Press
- Document type
- Conference contribution
- Faculty of Economics and Business (FEB)
- Amsterdam Business School Research Institute (ABS-RI)
One of the first steps in a software engineering process is the elaboration of the conceptual domain model. In this paper, we investigate how Formal Concept Analysis can be used to formally underpin the construction of a conceptual domain model. In particular, we demonstrate that intuitive verification rules for process-data matrices can be formally grounded in FCA theory. As a case study, we show that the well-formedness rules from MERODE are isomorphic to the clustering rules in Formal Concept Analysis, and that the relationships in the class diagram are isomorphic to the subconcept-superconcept relationship in FCA.
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.