Modular code generation from synchronous block diagrams: modularity vs. code size

DOI10.1145/1480881.1480893zbMATH Open1315.68041OpenAlexW2048145195WikidataQ130967600 ScholiaQ130967600MaRDI QIDQ5261507FDOQ5261507

Authors Roberto Lublinerman, Christian Szegedy, Stavros Tripakis 

Publication date 3 July 2015

Published in Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1480881.1480893

zbMATH Keywords

clusteringNP-completeblock diagramscode generationembedded softwaresynchronous languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Compositionality in dataflow synchronous languages: Specification and distributed code generation
• scientific article; zbMATH DE number 7364138
• Synthesis of modular block diagrams for automatic control systems
• scientific article; zbMATH DE number 1956592
• Synthesizing program generators for embedded software

Cited in

(4)

• Semantic translation of Simulink diagrams to input/output extended finite automata
• Refinement-oriented models of Stateflow charts
• scientific article; zbMATH DE number 5485922 (Why is no real title available?)
• The refinement calculus of reactive systems

Describes a project that uses

Uses Software

• SCADE
• Simulink
• LUSTRE

This page was built for publication: Modular code generation from synchronous block diagrams: modularity vs. code size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261507)