Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/6563
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Oliveira, José Nuno Fonseca | - |
dc.contributor.author | Rodrigues, César J. | - |
dc.date.accessioned | 2007-06-08T17:03:21Z | - |
dc.date.available | 2007-06-08T17:03:21Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Oliveira, J.N., Rodrigues, C.J. (2006). Pointfree Factorization of Operation Refinement. In: Misra, J., Nipkow, T., Sekerinski, E. (eds) FM 2006: Formal Methods. FM 2006. Lecture Notes in Computer Science, vol 4085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11813040_17 | eng |
dc.identifier.isbn | 978-3-540-37215-8 | - |
dc.identifier.issn | 0302-9743 | por |
dc.identifier.uri | https://hdl.handle.net/1822/6563 | - |
dc.description.abstract | The standard operation refinement ordering is a kind of “meet of op- posites”: non-determinism reduction suggests “smaller” behaviour while increase of definition suggests “larger” behaviour. Groves’ factorization of this ordering into two simpler relations, one per refinement concern, makes it more mathe- matically tractable but is far from fully exploited in the literature. We present a pointfree theory for this factorization which is more agile and calculational than the standard set-theoretic approach. In particular, we show that factorization leads to a simple proof of structural refinement for arbitrary parametric types and ex- ploit factor instantiation across different subclasses of (relational) operation. The prospect of generalizing the factorization to coalgebraic refinement is discussed | eng |
dc.description.sponsorship | Fundação para a Ciência e a Tecnologia (FCT) - PURE Project (Program Understanding and Re-engineering: Calculi and Applications), contract POSI/ICHS/44304/2002. | por |
dc.language.iso | eng | eng |
dc.publisher | Springer | eng |
dc.relation | info:eu-repo/grantAgreement/FCT/POSC/POSI%2FCHS%2F44304%2F2002/PT | - |
dc.rights | openAccess | eng |
dc.subject | Theoretical foundations | eng |
dc.subject | Refinement | eng |
dc.subject | Calculation | eng |
dc.subject | Reusable theories | eng |
dc.title | Pointfree factorization of operation refinement | eng |
dc.type | conferencePaper | eng |
oaire.citationStartPage | 236 | por |
oaire.citationEndPage | 251 | por |
oaire.citationVolume | 4085 | por |
dc.identifier.doi | 10.1007/11813040_17 | - |
dc.identifier.eisbn | 978-3-540-37216-5 | - |
dc.subject.wos | Science & Technology | por |
sdum.journal | Lecture Notes in Computer Science | por |
sdum.conferencePublication | FM 2006: FORMAL METHODS, PROCEEDINGS | por |
Aparece nas coleções: | DI/CCTC - Artigos (papers) |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
paper_jno.pdf | Documento principal | 195,79 kB | Adobe PDF | Ver/Abrir |