dc.contributor.author |
Link, Sebastian |
en |
dc.contributor.author |
Schewe, KD |
en |
dc.contributor.author |
Zhao, J |
en |
dc.contributor.editor |
Virbitskaite, I |
en |
dc.contributor.editor |
Voronkov, A |
en |
dc.coverage.spatial |
Novosibirsk, Russia |
en |
dc.date.accessioned |
2011-12-08T19:03:56Z |
en |
dc.date.issued |
2007-08-04 |
en |
dc.identifier.citation |
PSI, Novosibirsk, Russia, 27 Jun 2006 - 30 Jun 2006. Editors: Virbitskaite I, Voronkov A. Perspectives of Systems Informatics - 6th International Andrei Ershov Memorial Conference. Springer Lecture Notes in Computer Science, Berlin/Heidelberg. 4378: 310-321. 04 Aug 2007 |
en |
dc.identifier.isbn |
978-3-540-70880-3 |
en |
dc.identifier.issn |
0302-9743 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/9906 |
en |
dc.description.abstract |
While Abstract State Machines (ASMs) provide a general purpose development method, it is advantageous to provide extensions that ease their use in particular application areas. This paper focuses on such extensions for the benefit of a “refinement calculus” in the area of data warehouses and on-line analytical processing (OLAP). We show that providing typed ASMs helps to exploit the existing logical formalisms used in data-intensive areas to define a ground model and refinement rules. We also note that the extensions do not increase the expressiveness of ASMs, as each typed ASM will be equivalent to an “ordinary” one. |
en |
dc.publisher |
Springer-Verlag Berlin Heidelberg |
en |
dc.relation.ispartof |
PSI |
en |
dc.relation.ispartofseries |
Perspectives of Systems Informatics - 6th International Andrei Ershov Memorial Conference |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from
http://www.sherpa.ac.uk/romeo/issn/0302-9743/ |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Refinements in typed abstract state machines |
en |
dc.type |
Conference Item |
en |
dc.identifier.doi |
10.1007/978-3-540-70881-0_27 |
en |
pubs.begin-page |
310 |
en |
pubs.volume |
4378 |
en |
dc.rights.holder |
Copyright: Springer-Verlag Berlin Heidelberg |
en |
pubs.author-url |
http://dx.doi.org/10.1007/978-3-540-70881-0_27 |
en |
pubs.end-page |
321 |
en |
pubs.finish-date |
2006-06-30 |
en |
pubs.place-of-publication |
Berlin/Heidelberg |
en |
pubs.start-date |
2006-06-27 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/RestrictedAccess |
en |
pubs.subtype |
Conference Paper |
en |
pubs.elements-id |
257703 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
dc.identifier.eissn |
1611-3349 |
en |
pubs.record-created-at-source-date |
2011-12-08 |
en |