Refinements in typed abstract state machines

Authors:
Sebastian Link;Klaus-Dieter Schewe;Jane Zhao
Affiliations:
Massey University, Department of Information Systems & Information Science Research Centre, Palmerston North, New Zealand;Massey University, Department of Information Systems & Information Science Research Centre, Palmerston North, New Zealand;Massey University, Department of Information Systems & Information Science Research Centre, Palmerston North, New Zealand
Venue:
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Year:
2006

Citing 13
Cited 3

Research problems in data warehousing

CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
The B-book: assigning programs to meanings

The B-book: assigning programs to meanings
Some high level language constructs for data of type relation

ACM Transactions on Database Systems (TODS)
Sequential abstract-state machines capture sequential algorithms

ACM Transactions on Computational Logic (TOCL)
On the unification of query algebras and their extension to rational tree structures

ADC '01 Proceedings of the 12th Australasian database conference
Olap Solutions: Building Multidimensional Information Systems

Olap Solutions: Building Multidimensional Information Systems
Naturally Embedded Query Languages

ICDT '92 Proceedings of the 4th International Conference on Database Theory
A Foundation for Multi-dimensional Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Abstract state machines capture parallel algorithms

ACM Transactions on Computational Logic (TOCL)
Using abstract state machines for distributed data warehouse design

APCCM '04 Proceedings of the first Asian-Pacific conference on Conceptual modelling - Volume 31
Balancing redundancy and query costs in distributed data warehouses

APCCM '05 Proceedings of the 2nd Asia-Pacific conference on Conceptual modelling - Volume 43
ASM-based design of data warehouses and on-line analytical processing systems

Journal of Systems and Software - Special issue: Quality software
View integration and cooperation in databases, data warehouses and web information systems

Journal on Data Semantics IV

Dynamic data warehouse design as a refinement in ASM-based approach

APCCM '07 Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67
Typed Abstract State Machines for data-intensive applications

Knowledge and Information Systems
Using abstract state machines for the design of multi-level transaction schedulers

Rigorous Methods for Software Construction and Analysis

Quantified Score

Hi-index	0.00

Visualization

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.