The existence and the construction of a specification morphism between two algebraic specifications is a crucial step in modular system design and in the reusability of software. The problem of determining the existence of a signature morphism between two algebraic signatures is analyzed and proved to be NP-complete by reducing the well known 3SAT problem. As a consequence, the problem of finding a specification morphism is at least as hard as that of verifying its existence.
File in questo prodotto:
Non ci sono file associati a questo prodotto.