Paper Info
Title
Typed Abstract State Machines for data-intensive applications
Abstract
This paper focuses on extensions of Abstract State Machines (ASMs) for the benefit of a refinement calculus in the area of data-intensive applications, in particular data warehouses and on-line analytical processing. The extensions lead to a typed version of ASMs and a more specific notion of strong data refinement, which incorporates the preservation of information content by means of schema dominance. Each typed ASM can be effectively translated into an equivalent ordinary one. Providing typed ASMs helps to exploit the existing logical formalisms used in data-intensive applications to define a ground model. Furthermore, strong data refinement helps to set up a refinement-based development method that uses provably correct standard refinement rules.
Year
DOI
Venue
2008
10.1007/s10115-007-0083-5
Knowl. Inf. Syst.
Keywords
Field
DocType
abstract state machines,existing logical formalisms,standard refinement rule,data-intensive application,abstract state machines · types · data warehouses · refinement,information content,particular data warehouse,refinement calculus,on-line analytical processing,ground model,typed abstract state machines,strong data refinement,refinement,abstract state machine,data warehouses,data warehouse
Data warehouse,Data mining,Refinement calculus,Computer science,Abstract state machines,Finite-state machine,Online analytical processing,Rotation formalisms in three dimensions,Abstract machine,Metamodeling
Journal
Volume
Issue
ISSN
15
3
0219-3116
Citations 
PageRank 
References 
2
0.37
10
Authors
2
Name
Order
Citations
PageRank
Klaus-dieter Schewe11367202.78
Jane Zhao2647.13