Publicação
Software reification using the SETS calculus
| Resumo: | SETS is an emerging reification calculus for the derivation of implementations of model-oriented specifications of abstract data types. This paper shows how abstraction invariants can be synthesized by calculation in SETS, and the potential of this calculus for assessing, comparing or classifying specifications. The main results of the paper are concerned with a functorial approach to reification, particularly wrt. the systematic implementation of recursive data domains on non-recursive run-time environments. A final example of this class of implementations is provided. |
|---|---|
| Autores principais: | Oliveira, José Nuno Fonseca |
| Assunto: | Reification Calculus |
| Ano: | 1992 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| Resumo: | SETS is an emerging reification calculus for the derivation of implementations of model-oriented specifications of abstract data types. This paper shows how abstraction invariants can be synthesized by calculation in SETS, and the potential of this calculus for assessing, comparing or classifying specifications. The main results of the paper are concerned with a functorial approach to reification, particularly wrt. the systematic implementation of recursive data domains on non-recursive run-time environments. A final example of this class of implementations is provided. |
|---|