Formal Product Families for Abstract Machines

in: Universität Augsburg Technical Report, Institute of Computer Science, University of Augsburg, March 2011

Abstract:
The goal of this work is to underlay the formal product family algebra with the semantics of abstract machines. To reach this goal, we develop a formal product family algebra for abstract machines and investigate the properties of this algebra. Afterwards we present a model of this algebra. In this model we can compose families of machines to build larger ones in an incremental way. We then compare the development of a system using B, to the development of this system using the presented algebraic model. Furthermore we briefly discuss how rules for correct machines given in B can be expressed in this model.

Downloads:

• tr2011-06  -  (tr2011-06.pdf, 0 KB)