Title :
A formalism for functionality preserving system level transformations
Author :
Abdi, Samar ; Gajski, Daniel
Author_Institution :
Center for Embedded Comput. Syst., UC Irvine, CA, USA
Abstract :
With the rise in complexity of modern systems, designers are spending a significant time on modeling at the system level of abstraction. This paper introduces Model Algebra, a formalism built on top of system level design languages, that can be used for implementing functionality preserving transformations on system level models. Such transformations enable us to implement high level design decisions without having to write new models for each design decision. Moreover, since these transformations preserve functionality, the transformed models do not need to be reverified. We present the definition of Model Algebra and show how system level models can be represented as expressions in this formalism. The laws of Model Algebra are use to define correct model transformations. We show a system level design scenario, where design decisions gradually refine the functional model of the system to an architectural model with components and communication structure. The refinement can be performed using the correct model transformations in our formalism.
Keywords :
formal verification; high level synthesis; specification languages; abstraction level; architectural model; functionality preserving transformations; high level design decision; model algebra; model transformations; system level design languages; system level models; system level transformations; Algebra; Boolean functions; Carbon capture and storage; Embedded computing; Embedded system; Hardware; Hierarchical systems; High level synthesis; Petri nets; System-level design;
Conference_Titel :
Design Automation Conference, 2005. Proceedings of the ASP-DAC 2005. Asia and South Pacific
Print_ISBN :
0-7803-8736-8
DOI :
10.1109/ASPDAC.2005.1466146