Software Reification using the SETS Calculus
[ DI/UM ]

by J.N. Oliveira (invited paper in BCS FACS 5th Refinement Workshop, Theory and Practice of Formal Software Development , 8-10 January 1992, London, 140-171, Springer Verlag) ISBN 3-540-19752-4, ©British Computer Society 1992 Paper: [available as a 115K ps.gz file]

Abstract: 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.

BibTeX:

@inproceedings{Ol92,
   author = "J. N. Oliveira",
   title = {Software Reification using the SETS Calculus},
   booktitle = "Proc. of the BCS FACS 5th Refinement Workshop,
        Theory and Practice of Formal Software Development,
        London, UK",
   month = "8--10 January",
   year = "1992",
   pages = "140--171",
   publisher = "Springer-Verlag"
}