Formal product families for abstract machines
- 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.
| Author: | Andreas Zelend |
|---|---|
| URN: | urn:nbn:de:bvb:384-opus4-12112 |
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/1503 |
| Series (Serial Number): | Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2011-06) |
| Publisher: | Institut für Informatik, Universität Augsburg |
| Place of publication: | Augsburg |
| Type: | Report |
| Language: | English |
| Year of first Publication: | 2011 |
| Publishing Institution: | Universität Augsburg |
| Release Date: | 2011/03/28 |
| Institutes: | Fakultät für Angewandte Informatik |
| Fakultät für Angewandte Informatik / Institut für Informatik | |
| Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme | |
| Dewey Decimal Classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
| Licence (German): |  Deutsches Urheberrecht |
