TY - GEN
T1 - Static Data-Flow Analysis of UML/SysML Functional Views for Signal and Image Processing Applications
AU - Enrici, Andrea
AU - Apvrille, Ludovic
AU - Pacalet, Renaud
AU - Pham, Minh Hiep
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2020.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - The complexity of heterogeneous Multi-Processor Systems-on-Chip stretches the limits of software development solutions based on sequential languages such as C/C++. While these are still the most widely used languages in practice, model-based solutions appear to be an efficient alternative. However, the optimized compilation of models for multi-processor systems still presents many open research problems. Among others, static data-flow analyses for models require the adaptation of traditional algorithms used in program analysis (iterative and worklist algorithms). These algorithms operate on Control-Flow Graphs with a unique start node (i.e., a node without predecessors) and assume that every basic block is reachable from this start node. In this paper, we present a novel combination of the well-known iterative and worklist algorithms that examines a Control-Flow Graph where basic blocks can be reached by paths that originate from different start states. We apply this solution to functional views of signal and image processing models denoted with UML Activity and SysML Block diagrams. We demonstrate its effectiveness on interval analysis and show that significant reductions in the number of visits of the models’ control-flow graphs can be achieved.
AB - The complexity of heterogeneous Multi-Processor Systems-on-Chip stretches the limits of software development solutions based on sequential languages such as C/C++. While these are still the most widely used languages in practice, model-based solutions appear to be an efficient alternative. However, the optimized compilation of models for multi-processor systems still presents many open research problems. Among others, static data-flow analyses for models require the adaptation of traditional algorithms used in program analysis (iterative and worklist algorithms). These algorithms operate on Control-Flow Graphs with a unique start node (i.e., a node without predecessors) and assume that every basic block is reachable from this start node. In this paper, we present a novel combination of the well-known iterative and worklist algorithms that examines a Control-Flow Graph where basic blocks can be reached by paths that originate from different start states. We apply this solution to functional views of signal and image processing models denoted with UML Activity and SysML Block diagrams. We demonstrate its effectiveness on interval analysis and show that significant reductions in the number of visits of the models’ control-flow graphs can be achieved.
KW - Multi-Processor System-on-Chip
KW - Optimizing model compilation UML/SysML
KW - Static data-flow analysis
UR - https://www.scopus.com/pages/publications/85078439213
U2 - 10.1007/978-3-030-37873-8_5
DO - 10.1007/978-3-030-37873-8_5
M3 - Conference contribution
AN - SCOPUS:85078439213
SN - 9783030378721
T3 - Communications in Computer and Information Science
SP - 101
EP - 126
BT - Model-Driven Engineering and Software Development - 7th International Conference, MODELSWARD 2019, Revised Selected Papers
A2 - Hammoudi, Slimane
A2 - Pires, Luís Ferreira
A2 - Selic, Bran
PB - Springer
T2 - 7th International Conference on Model-Driven Engineering and Software Development, MODELSWARD 2019
Y2 - 20 February 2019 through 22 February 2019
ER -