Paper Info
Title
Refinements in typed abstract state machines
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.
Year
DOI
Venue
2006
10.1007/978-3-540-70881-0_27
Ershov Memorial Conference
Keywords
DocType
Citations 
abstract state machines,particular application area,existing logical formalisms,data warehouse,refinement rule,refinement calculus,on-line analytical processing,data-intensive area,abstract state machine,ground model,general purpose development method
Conference
5
PageRank 
References 
Authors
0.47
15
3
Name
Order
Citations
PageRank
Sebastian Link130719.17
Klaus-dieter Schewe21367202.78
Jane Zhao3647.13