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 |
| _version_ | 1866878050010923008 |
|---|---|
| author | Oliveira, José Nuno Fonseca |
| author_facet | Oliveira, José Nuno Fonseca |
| author_role | author |
| contributor_name_str_mv | Universidade do Minho |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Oliveira, José Nuno Fonseca\"}] |
| datacite.contributors.contributor.contributorName.fl_str_mv | Universidade do Minho |
| datacite.creators.creator.creatorName.fl_str_mv | Oliveira, José Nuno Fonseca |
| datacite.date.Accepted.fl_str_mv | 1992-01-01T00:00:00Z |
| datacite.date.available.fl_str_mv | 2006-08-22T14:23:40Z |
| datacite.date.embargoed.fl_str_mv | 2006-08-22T14:23:40Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| datacite.subjects.subject.fl_str_mv | Reification Calculus |
| datacite.titles.title.fl_str_mv | Software reification using the SETS calculus |
| dc.contributor.none.fl_str_mv | Universidade do Minho |
| dc.creator.none.fl_str_mv | Oliveira, José Nuno Fonseca |
| dc.date.Accepted.fl_str_mv | 1992-01-01T00:00:00Z |
| dc.date.available.fl_str_mv | 2006-08-22T14:23:40Z |
| dc.date.embargoed.fl_str_mv | 2006-08-22T14:23:40Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://hdl.handle.net/1822/5444 |
| dc.language.none.fl_str_mv | eng |
| dc.publisher.none.fl_str_mv | Springer Verlag |
| dc.rights.none.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| dc.subject.none.fl_str_mv | Reification Calculus |
| dc.title.fl_str_mv | Software reification using the SETS calculus |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_6501 |
| 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. |
| dirty | 0 |
| eu_rights_str_mv | openAccess |
| format | article |
| fulltext.url.fl_str_mv | https://prod-dspace.uminho.pt/bitstreams/ec559342-681a-4f0c-97bb-d5e1a2e88a60/download |
| id | rum_a435da975bbcf2ec6e5c81167f41f6d9 |
| identifier.url.fl_str_mv | https://hdl.handle.net/1822/5444 |
| instacron_str | repositorium |
| institution | Universidade do Minho |
| instname_str | Universidade do Minho |
| language | eng |
| network_acronym_str | rum |
| network_name_str | RepositóriUM - Universidade do Minho |
| oai_identifier_str | oai:repositorium.uminho.pt:1822/5444 |
| organization_str_mv | urn:organizationAcronym:repositorium |
| person_str_mv | Oliveira, José Nuno Fonseca |
| publishDate | 1992 |
| publisher.none.fl_str_mv | Springer Verlag |
| reponame_str | RepositóriUM - Universidade do Minho |
| repository_id_str | urn:repositoryAcronym:rum |
| service_str_mv | urn:repositoryAcronym:rum |
| spelling | engSpringer VerlagengSETS 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.application/pdfengSoftware reification using the SETS calculusOliveira, José Nuno FonsecaHostingInstitutionOrganizationalUniversidade do Minhoe-mailmailto:repositorium@usdb.uminho.ptrepositorium@usdb.uminho.ptISBNIsPartOf3-540-19752-42006-08-22T14:23:40Z1992-011992-01-01T00:00:00ZHandlehttps://hdl.handle.net/1822/5444http://purl.org/coar/access_right/c_abf2open accessReificationCalculus850185 bytesliteraturehttp://purl.org/coar/resource_type/c_6501journal articlehttp://purl.org/coar/access_right/c_abf2application/pdffulltexthttps://prod-dspace.uminho.pt/bitstreams/ec559342-681a-4f0c-97bb-d5e1a2e88a60/download |
| spellingShingle | Software reification using the SETS calculus Oliveira, José Nuno Fonseca Reification Calculus |
| status | SINGLETON |
| subject.fl_str_mv | Reification Calculus |
| title | Software reification using the SETS calculus |
| title_full | Software reification using the SETS calculus |
| title_fullStr | Software reification using the SETS calculus |
| title_full_unstemmed | Software reification using the SETS calculus |
| title_short | Software reification using the SETS calculus |
| title_sort | Software reification using the SETS calculus |
| topic | Reification Calculus |
| topic_facet | Reification Calculus |
| url | https://hdl.handle.net/1822/5444 |
| visible | 1 |