Category Theory Based Identification of Reusable Components
through Formal Specifications
Abstract: Software reuse can only be implemented in an
efficient way if it is practised systematically. This work presents a system
that automates the process of software reuse through formal specifications.
We use single-sort algebraic specifications to describe the behaviour
of software components, and then we apply the mathematical framework of
category theory to develop matching mechanisms that locate reusable components.
The system translates the algebraic specification introduced by the user
into a categorical representation, and tries to identify an isomorphic
or a compositional matching between the user categorical specification
and the ones that are in the library.
The system is also part of a complexity analysis that makes possible
the demonstration of its viability when applied to great amounts of information.
March of 2001 - Humboldt-Universitat zu Berlin-Germany,
First International Workshop on Automated Verification of Infinite-State
Systems (AVIS'01), co-located with FME 2001,
Title:"The Development of a Computer Application that Identifies Reusable
Components through Formal Specifications",
September of 2001; Darmstad-Germany,
5th European Conference on Research and Advanced Technology for Digital
Libraries (ECDL2001) (poster),
Title:"Category theory based Identification of reusable components through formal