2013 Proceedings of the International Conference on Embedded Software (EMSOFT)最新文献

On the schedulability of real-time discrete-event systems 实时离散事件系统的可调度性

2013 Proceedings of the International Conference on Embedded Software (EMSOFT) Pub Date : 2013-09-29 DOI: 10.1109/EMSOFT.2013.6658590

E. Matsikoudis, C. Stergiou, Edward A. Lee

引用次数: 8

A synchronous embedding of Antescofo, a domain-specific language for interactive mixed music 同步嵌入Antescofo，这是一种用于交互式混合音乐的特定领域语言

2013 Proceedings of the International Conference on Embedded Software (EMSOFT) Pub Date : 2013-09-29 DOI: 10.1109/EMSOFT.2013.6658579

Guillaume Baudart, Florent Jacquemard, Louis Mandel, Marc Pouzet

{"title":"A synchronous embedding of Antescofo, a domain-specific language for interactive mixed music","authors":"Guillaume Baudart, Florent Jacquemard, Louis Mandel, Marc Pouzet","doi":"10.1109/EMSOFT.2013.6658579","DOIUrl":"https://doi.org/10.1109/EMSOFT.2013.6658579","url":null,"abstract":"Antescofo is recently developed software for musical score following and mixed music: it automatically, and in real-time, synchronizes electronic instruments with a musician playing on a classical instrument. Therefore, it faces some of the same major challenges as embedded systems. The system provides a programming language used by composers to specify musical pieces that mix interacting electronic and classical instruments. This language is developed with and for musicians and it continues to evolve according to their needs. Yet its semantics has only recently been formally defined. This paper presents a synchronous semantics for the core language of Antescofo and an alternative implementation based on an embedding inside an existing synchronous language, namely ReactiveML. The semantics reduces to a few rules, is mathematically precise and leads to an interpretor of only a few hundred lines. The efficiency of this interpretor compares well with that of the actual implementation: on all musical pieces we have tested, response times have been less than the reaction time of the human ear. Moreover, this embedding permitted the prototyping of several new programming constructs, some of which are described in this paper.","PeriodicalId":325726,"journal":{"name":"2013 Proceedings of the International Conference on Embedded Software (EMSOFT)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124022338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Bit-precise formal verification of discrete-time MATLAB/Simulink Models using SMT Solving 用SMT求解离散时间MATLAB/Simulink模型的位精确形式化验证

2013 Proceedings of the International Conference on Embedded Software (EMSOFT) Pub Date : 2013-09-29 DOI: 10.1109/EMSOFT.2013.6658586

Paula Herber, Robert Reicherdt, P. Bittner

引用次数: 27

Stability-aware analysis and design of embedded control systems 嵌入式控制系统的稳定感知分析与设计

2013 Proceedings of the International Conference on Embedded Software (EMSOFT) Pub Date : 2013-09-29 DOI: 10.1109/EMSOFT.2013.6658601

A. Aminifar, P. Eles, Zebo Peng, A. Cervin

{"title":"Stability-aware analysis and design of embedded control systems","authors":"A. Aminifar, P. Eles, Zebo Peng, A. Cervin","doi":"10.1109/EMSOFT.2013.6658601","DOIUrl":"https://doi.org/10.1109/EMSOFT.2013.6658601","url":null,"abstract":"Many embedded systems comprise several controllers sharing available resources. It is well known that such resource sharing leads to complex timing behavior that can jeopardize stability of control applications, if it is not properly taken into account in the design process, e.g., mapping and scheduling. As opposed to hard real-time systems where meeting the deadline is a critical requirement, control applications do not enforce hard deadlines. Therefore, the traditional real-time analysis approaches are not readily applicable to control applications. Rather, in the context of control applications, stability is often the main requirement to be guaranteed, and can be expressed as the amount of delay and jitter a control application can tolerate. The nominal delay and response-time jitter can be regarded as the two main factors which relate the real-time aspects of a system to control performance and stability. Therefore, it is important to analyze the impact of variations in scheduling parameters, i.e., period and priority, on the nominal delay and response-time jitter and, ultimately, on stability. Based on such an analysis, we address, in this paper, priority assignment and sensitivity analysis problems for control applications considering stability as the main requirement.","PeriodicalId":325726,"journal":{"name":"2013 Proceedings of the International Conference on Embedded Software (EMSOFT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127200602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 19

Simple analysis of partial worst-case execution paths on general control flow graphs 一般控制流程图上部分最坏情况执行路径的简单分析

2013 Proceedings of the International Conference on Embedded Software (EMSOFT) Pub Date : 2013-09-29 DOI: 10.1109/EMSOFT.2013.6658594

Jan C. Kleinsorge, H. Falk, P. Marwedel

{"title":"Simple analysis of partial worst-case execution paths on general control flow graphs","authors":"Jan C. Kleinsorge, H. Falk, P. Marwedel","doi":"10.1109/EMSOFT.2013.6658594","DOIUrl":"https://doi.org/10.1109/EMSOFT.2013.6658594","url":null,"abstract":"One of the most important computations in static worst-case execution time analyses is the path analysis which computes the potentially most time-consuming execution path in a program. This is typically done either with an implicit path computation based on solving an integer linear program, or with explicit path computations directly on the program's control flow graph. The former approach is powerful and comparably simple to use but hard to extend and to combine with other program analyses due to its restriction to the linear equation model. The latter approaches are often restricted to well-structured graphs, suffer from inaccuracy or require nontrivial structural analyses or graph transformations upfront or during their computations. In this paper, we propose a generalized computational model and a comprehensive explicit path analysis that operates on arbitrary directed control flow graphs. We propose simple and yet effective techniques to deal with unstructured control flows and complex flow fact models. The analysis does not require a control flow graph to be mutable, is non-recursive, fast, and provides the means to compute all worst-case paths from arbitrary source nodes. It is well suited for solving local problems and the computation of partial solutions, which is highly relevant for problems related to scheduling and execution modes alike.","PeriodicalId":325726,"journal":{"name":"2013 Proceedings of the International Conference on Embedded Software (EMSOFT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130472424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Safety verification for linear systems 线性系统的安全验证

2013 Proceedings of the International Conference on Embedded Software (EMSOFT) Pub Date : 2013-09-29 DOI: 10.1109/EMSOFT.2013.6658585

Parasara Sridhar Duggirala, A. Tiwari

引用次数: 11

DIME: Time-aware dynamic binary instrumentation using rate-based resource allocation DIME:使用基于速率的资源分配的时间感知动态二进制仪器

2013 Proceedings of the International Conference on Embedded Software (EMSOFT) Pub Date : 2013-09-29 DOI: 10.1109/EMSOFT.2013.6658603

Pansy Arafa, H. Kashif, S. Fischmeister

{"title":"DIME: Time-aware dynamic binary instrumentation using rate-based resource allocation","authors":"Pansy Arafa, H. Kashif, S. Fischmeister","doi":"10.1109/EMSOFT.2013.6658603","DOIUrl":"https://doi.org/10.1109/EMSOFT.2013.6658603","url":null,"abstract":"Program analysis tools are essential for understanding programs, analyzing performance, and optimizing code. Some of these tools use code instrumentation to extract information at runtime. The instrumentation process can alter program behavior such as timing behavior and memory consumption. Time-sensitive programs, however, must meet specific timing constraints and thus require that the instrumentation process, for instance, bounds the timing overhead. Time-aware instrumentation techniques try to honor the timing constraints of such programs. All previous techniques, however, support only static source-code instrumentation methods. Hence, they become impractical beyond microcontroller code for instrumenting large programs along with all their library dependencies. In this work, we propose DIME, a time-aware dynamic binary instrumentation technique that adds an adjustable bound on the timing overhead to the program under analysis. We implement DIME using the dynamic instrumentation framework, Pin. Quantitative evaluation of the three implementation alternatives shows an average reduction of the instrumentation overhead by 12, 7, and 3 folds compared to native Pin. Instrumenting the VLC media player and a laser beam stabilization experiment demonstrate the practicality and scalability of DIME.","PeriodicalId":325726,"journal":{"name":"2013 Proceedings of the International Conference on Embedded Software (EMSOFT)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115658483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 17

BPDF: A statically analyzable dataflow model with integer and boolean parameters BPDF:具有整数和布尔参数的静态可分析数据流模型

2013 Proceedings of the International Conference on Embedded Software (EMSOFT) Pub Date : 2013-09-29 DOI: 10.1109/EMSOFT.2013.6658581

Vagelis Bebelis, Pascal Fradet, A. Girault, Bruno Lavigueur

{"title":"BPDF: A statically analyzable dataflow model with integer and boolean parameters","authors":"Vagelis Bebelis, Pascal Fradet, A. Girault, Bruno Lavigueur","doi":"10.1109/EMSOFT.2013.6658581","DOIUrl":"https://doi.org/10.1109/EMSOFT.2013.6658581","url":null,"abstract":"Dataflow programming models are well-suited to program many-core streaming applications. However, many streaming applications have a dynamic behavior. To capture this behavior, parametric dataflow models have been introduced over the years. Still, such models do not allow the topology of the dataflow graph to change at runtime, a feature that is also required to program modern streaming applications. To overcome these restrictions, we propose a new model of computation, the Boolean Parametric Data Flow (BPDF) model which combines integer parameters (to express dynamic rates) and boolean parameters (to express the activation and deactivation of communication channels). High dynamism is provided by integer parameters which can change at each basic iteration and boolean parameters which can even change within the iteration. The major challenge with such dynamic models is to guarantee liveness and boundedness. We present static analyses which ensure statically the liveness and the boundedness of BDPF graphs. We also introduce a scheduling methodology to implement our model on highly parallel platforms and demonstrate our approach using a video decoder case study.","PeriodicalId":325726,"journal":{"name":"2013 Proceedings of the International Conference on Embedded Software (EMSOFT)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114153006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 44

Determinate composition of FMUs for co-simulation 确定联合模拟用fmu的组成

2013 Proceedings of the International Conference on Embedded Software (EMSOFT) Pub Date : 2013-09-29 DOI: 10.1109/EMSOFT.2013.6658580

David Broman, Christopher X. Brooks, L. Greenberg, Edward A. Lee, M. Masin, S. Tripakis, M. Wetter

{"title":"Determinate composition of FMUs for co-simulation","authors":"David Broman, Christopher X. Brooks, L. Greenberg, Edward A. Lee, M. Masin, S. Tripakis, M. Wetter","doi":"10.1109/EMSOFT.2013.6658580","DOIUrl":"https://doi.org/10.1109/EMSOFT.2013.6658580","url":null,"abstract":"In this paper, we explain how to achieve deterministic execution of FMUs (Functional Mockup Units) under the FMI (Functional Mockup Interface) standard. In particular, we focus on co-simulation, where an FMU either contains its own internal simulation algorithm or serves as a gateway to a simulation tool. We give conditions on the design of FMUs and master algorithms (which orchestrate the execution of FMUs) to achieve deterministic co-simulation. We show that with the current version of the standard, these conditions demand capabilities from FMUs that are optional in the standard and rarely provided by an FMU in practice. When FMUs lacking these required capabilities are used to compose a model, many basic modeling capabilities become unachievable, including simple discrete-event simulation and variable-step-size numerical integration algorithms. We propose a small extension to the standard and a policy for designing FMUs that enables deterministic execution for a much broader class of models. The extension enables a master algorithm to query an FMU for the time of events that are expected in the future. We show that a model can be executed deterministically if all FMUs in the model are either memoryless or implement one of rollback or step-size prediction. We show further that such a model can contain at most one “legacy” FMU that is not memoryless and provides neither rollback nor step-size prediction.","PeriodicalId":325726,"journal":{"name":"2013 Proceedings of the International Conference on Embedded Software (EMSOFT)","volume":"3 17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129103931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 156

Time-aware relational abstractions for hybrid systems 混合系统的时间感知关系抽象

2013 Proceedings of the International Conference on Embedded Software (EMSOFT) Pub Date : 2013-09-29 DOI: 10.1109/EMSOFT.2013.6658592

Sergio Mover, A. Cimatti, A. Tiwari, Stefano Tonetta

{"title":"Time-aware relational abstractions for hybrid systems","authors":"Sergio Mover, A. Cimatti, A. Tiwari, Stefano Tonetta","doi":"10.1109/EMSOFT.2013.6658592","DOIUrl":"https://doi.org/10.1109/EMSOFT.2013.6658592","url":null,"abstract":"Hybrid Systems model both discrete switches and continuous dynamics and are suitable to represent embedded systems where discrete controllers interact with a physical plant. Relational abstraction is a new approach for verifying hybrid systems. In relational abstraction, the continuous dynamics in each location of the hybrid system is abstracted by a binary relation that relates the current value of the continuous variables with all future values of the variables that are reachable after a time elapse (continuous) transition. The abstract system is an infinite-state system, which can be verified using k-induction or abstract interpretation. Existing techniques for computing relational abstractions are time-agnostic: they do not construct any relationship between the state variables and the time elapsed during the continuous evolution. Time-agnostic abstractions cannot verify timing properties. We present a technique to compute a time-aware relational abstraction for verifying (timing-related) safety properties of cyber-physical systems. We show the effectiveness of the new abstraction on several case studies on which the previous techniques fail.","PeriodicalId":325726,"journal":{"name":"2013 Proceedings of the International Conference on Embedded Software (EMSOFT)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134521857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 26