DMCA
Modular code generation from synchronous block diagrams — modularity vs. code size (2009)
Cached
Download Links
| Venue: | in Proc. POPL |
| Citations: | 24 - 6 self |
BibTeX
@INPROCEEDINGS{Lublinerman09modularcode,
author = {Roberto Lublinerman and Christian Szegedy and Stavros Tripakis},
title = {Modular code generation from synchronous block diagrams — modularity vs. code size},
booktitle = {in Proc. POPL},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We study modular, automatic code generation from hierarchical block diagrams with synchronous semantics. Such diagrams are the fundamental model behind widespread tools in the embedded software domain, such as Simulink and SCADE. Code is modular in the sense that it is generated for a given composite block independently from context (i.e., without knowing in which diagrams the block is to be used) and using minimal information about the internals of the block. In previous work, we have shown how modular code can be generated by computing a set of interface functions for each block and a set of dependencies between these functions that is exported along with the interface. We have also introduced a quantified notion of modularity in terms of the number of interface functions generated per block, and showed how to minimize this number, which is essential for scalability. Finally, we have exposed
Keyphrases
code size synchronous block diagram modularity v modular code generation interface function hierarchical block diagram automatic code generation synchronous semantics quantified notion fundamental model widespread tool composite block minimal information previous work embedded software domain modular code
