Incollection,

Refinements in Typed Abstract State Machines

, , and .
(2007)
DOI: http://dx.doi.org/10.1007/978-3-540-70881-0\_27

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.

Tags

Users

  • @leonardo

Comments and Reviews