Author(s):
Oliveira, José Nuno Fonseca 
Date: 1992
Persistent ID: http://hdl.handle.net/1822/5444
Origin: RepositóriUM - Universidade do Minho
Subject(s): Reification; Calculus
Document details
Software reification using the SETS calculus
Description
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.
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.
Document Type
Article
Language English
Language English
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||